A Novel Approach for Community Detection Using the Label Propagation Technique
In this chapter, we propose a new label propagation-based approach to detect community structure in social networks. This is a multiple label propagation technique in which a node can obtain labels of different communities, which allows researchers to discover overlapping communities. One important advantage of this approach is the updating of node labels over time that makes it dynamic. Given an underlying social network, we assume that each node receives a unique label id similar to its node id in the initial phase. We allow each node to accept multiple labels from its neighbors if each of the neighbors has a high common neighbor score, which naturally encompasses the idea of overlapping communities.
The first author wishes to say thanks to the Council of Scientific and Industrial Research (CSIR) for financial assistance received in the form of JRF.
- 1.Breiger, R.L. 2004. The analysis of social networks. In Handbook of Data Analysis, ed. M. Hardy, and A. Bryman, 505–526. London: SAGE Publications.Google Scholar
- 3.Havvaei, E., and N. Deo. 2016. A game-theoretic approach for detection of overlapping communities in dynamic complex networks. 1: 113–324. arXiv:1603.00509.
- 6.Newman, M.E., and G. Reinert. 2016. Estimating the number of communities in a network. Physical Review Letters 117–125.Google Scholar
- 8.Pizzuti, C. 2009. Overlapped community detection in complex networks. In Proceedings of the 11th Annual Conference On Genetic And Evolutionary Computation, 859–866, ACM.Google Scholar