One common problem in viral marketing, counter-terrorism and epidemic modeling is the efficient detection of a community that is centered at an individual of interest. Most community detection algorithms are designed to detect all communities in the entire network. As such, it would be computationally intensive to first detect all communities followed by identifying communities where the individual of interest belongs to, especially for large scale networks. We propose a community detection algorithm that directly detects the community centered at an individual of interest, without the need to first detect all communities. Our proposed algorithm utilizes an expanding ring search starting from the individual of interest as the seed user. Following which, we iteratively include users at increasing number of hops from the seed user, based on our definition of a community. This iterative step continues until no further users can be added, thus resulting in the detected community comprising the list of added users. We evaluate our algorithm on four social network datasets and show that our algorithm is able to detect communities that strongly resemble the corresponding real-life communities.
|Cite as: Lim, K.H. and Datta, A. (2013). A Seed-Centric Community Detection Algorithm based on an Expanding Ring Search. In Proc. The Web 2013 (AWC 2013) Adelaide, Australia. CRPIT, 144. Ashman, H., Sheng, Q.Z. and Trotman, A. Eds., ACS. 21-26 |
(local if available)