Method, system, and computer program product for community detection

Abstract

Methods, systems, and computer program products for community detection: (i) obtain a plurality of node embeddings associated with a graph; (ii) determine a number of clusters into which the plurality of node embeddings is to be clustered; (iii) cluster, based on distances between pairs of node embeddings, the plurality of node embeddings into the number of clusters until, for each node embedding in each cluster, a node associated with that node embedding is within k-hops in the graph of each other node associated with each other node embedding in that cluster; (iv) reposition centroids of the number of clusters; (v) repeat steps (iii) and (iv) until a first stopping criteria is satisfied; (vi) repeat steps (ii) through (v) until a second stopping criteria that depends on a conductance of a clustering including the number of clusters is satisfied; and (vii) provide the clustering including the number of clusters.