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)

@article{Surendran2016ASG,
title={A scalable geometric algorithm for community detection from social networks with incremental update},
author={Subu Surendran and D. Chithra Prasad and M. Ramachandra Kaimal},
journal={Social Network Analysis and Mining},
year={2016},
volume={6},
pages={1-13}
}