Dynamic Community Detection Algorithm Based on Automatic Parameter Adjustment
Community detection is widely used in social network analysis. It clusters densely connected vertices into communities. As social networks get larger, scalable algorithms are drawing more attention. Among those methods, the algorithm named Attractor is quite outstanding both in terms of accuracy and scalability. However, it is highly dependent on the parameter, which is abstract for users. The improper parameter value can bring about some problems. There can be a huge community (monster) sometimes; other time the communities are generally too small (fragments). The existing fragments also need eliminating. Such phenomenon greatly deteriorates the performance of Attractor. We modify the algorithm and propose mAttractor, which adjusts the parameter automatically. We introduce two constraints to limit monsters and fragments and to narrow the parameter range. An optional parameter is also introduced. The proposed algorithm can choose to satisfy or ignore the optional parameter by judging whether it is reasonable. Our algorithm also eliminates the existing fragments. A delicate pruning is designed for fast determination. Experiments show that our mAttractor outperforms Attractor by 2%–270%.
KeywordsCommunity detection Social network Data mining
This work is partially supported by The National Key Research and Development Program of China (2016YFB0200401), by program for New Century Excellent Talents in University, by National Science Foundation (NSF) China 61402492, 61402486, 61379146, by the laboratory pre-research fund (9140C810106150C81001).
- 1.Adamic, L.A., Glance, N.: The political blogosphere and the 2004 US election: divided they blog. In: Proceedings of the 3rd International Workshop on Link Discovery, pp. 36–43. ACM (2005)Google Scholar
- 2.Cross, R., Parker, A., Christensen, C.M., Anthony, S.D., Roth, E.A.: The hidden power of social networks. J. Appl. Manag. Entrepreneurship 9 (2004)Google Scholar
- 17.Mislove, A., Marcon, M., Gummadi, K.P., Druschel, P., Bhattacharjee, B.: Measurement and analysis of online social networks. In: Proceedings of the 7th ACM SIGCOMM Conference on Internet Measurement, pp. 29–42. ACM (2007)Google Scholar
- 22.Shao, J., Han, Z., Yang, Q., Zhou, T.: Community detection based on distance dynamics. In: Proceedings of the 21st ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1075–1084. ACM (2015)Google Scholar
- 24.Van Dongen, S.M.: Graph clustering by flow simulation. Ph.D. thesis, University of Utrecht (2001)Google Scholar