A scalable geometric algorithm for community detection from social networks with incremental update


In recent years, a series of algorithms have been proposed to detect community from social networks. Most of the algorithms are based on traditional spectral clustering algorithms such as k-means. One of the major limitations of such algorithms is that entire eigenvalues of the similarity matrix of the network need to be calculated in advance. In the case… (More)
DOI: 10.1007/s13278-016-0399-9


7 Figures and Tables