LabelRank: A stabilized label propagation algorithm for community detection in networks

Proceedings of the 2013 IEEE 2nd International Network Science Workshop, NSW 2013

Volumn , Issue , 2013, Pages 138-143

  Xie, Jierui ^a   Szymanski, Boleslaw K ^a  

^a Rensselaer Polytechnic Institute   (United States)

Author keywords

clustering; community detection; group; social network analysis

Indexed keywords

CLUSTERING; COMMUNITY DETECTION; GENETIC NETWORKS; GROUP; LABEL PROPAGATION; LARGE-SCALE NETWORK; PROPAGATION DYNAMICS; REAL-WORLD NETWORKS;

POPULATION DYNAMICS; SOCIAL NETWORKING (ONLINE);

ALGORITHMS;

EID: 84886075369     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/NSW.2013.6609210     Document Type: Conference Paper

References (33)

1. W. S. Bainbridge. Computational Sociology. In Blackwell Encyclopedia of Sociology, Blackwell Reference Online, 2007, doi:10.1111/b.9781405124331.2007.x.
2. R. E. Park. Human communities: The city and human ecology, Free Press, 1952.
3. M. S. Granovetter The strength of weak ties. American journal of sociology, 1360-1380, 1973.
4. U. N. Raghavan, R. Albert, and S. Kumara. Near linear time algorithm to detect community structures in large-scale networks. Phys. Rev. E, 76:036106, 2007.
5. J. Xie and B. K. Szymanski. Community detection using a neighborhood strength driven label propagation algorithm. In IEEE Network Science Workshop 2011, pages 188-195, 2011.
6. J. Xie and B. K. Szymanski. Towards linear time overlapping community detection in social networks. In PAKDD, pages 25-36, 2012.
7. J. Xie, B. K. Szymanski and X. Liu. SLPA: Uncovering Overlapping Communities in Social Networks via A Speaker-listener Interaction Dynamic Process. In Proc. of ICDM 2011 Workshop, 2011.
8. S. van Dongen. A cluster algorithm for graphs. Technical Report INS-R0010, National Research Institute for Mathematics and Computer Science, 2000.
9. S. Gregory. Finding overlapping communities in networks by label propagation. New J. Phys., 12:103018, 2010.
10. H. Zhou and R. Lipowsky. Network brownian motion: A new method to measure vertex-vertex proximity and to identify communities and subcommunities. Lect. Notes Comput. Sci., 3038:1062-1069, 2004.
11. Y. Hu, M. Li, P. Zhang, Y. Fan and Z. Di. Community detection by signaling on complex networks. Phys. Rev. E., 78:1, pp. 016115, 2008.
12. Pascal Pons and Matthieu Latapy. Computing Communities in Large Networks Using Random Walks. J. Graph Algorithms Appl., 10:2, pp. 191-218, 2006.
13. J. Shi and J. Malik. Normalized cuts and image segmentation. IEEE Trans. Pattern Anal. Mach. Intell., 22:8, pp. 888-90, 2000.
14. S. White and P. Smyth. A spectral clustering approach to finding communities in graphs. Proc. of SIAM International Conference on Data Mining, pp. 76-84, 2005.
15. A. Capocci, V.D.P. Servedio, G. Caldarelli and F. Colaiori. Detecting communities in large networks. Physica A, 352, pp. 669-676, 2005.
16. V. Blondel, J. Guillaume, R. Lambiotte and E. Lefebvre. Fast Unfolding of Communities in Large Networks. J. Stat. Mech., 2008.
17. M. E. J. Newman. Finding Community Structure in Networks Using the Eigenvectors of Matrices. Phys. Rev. E, 74, pp. 036104, 2006.
18. M. E. J. Newman and M. Girvan. Finding and Evaluating Community Structure in Networks. Phys. Rev. E, 69, pp. 026113, 2004.
19. K. Wakita and T. Tsurumi. Finding community structure in mega-scale social networks. In WWW Conference, pp. 1275-1276, 2007.
20. P. Schuetz and A. Caflisch. Efficient modularity optimization by multistep greedy algorithm and vertex mover refinement. Phys. Rev. E, 77, pp. 046112, 2008.
21. S. Banach. Sur les opérations dans les ensembles abstraits et leur application aux équations intégrales. Fund. Math., 1922.
22. M. E. J. Newman. Fast algorithm for detecting community structure in networks. Phys. Rev. E, 69:066133, 2004.
23. V. Satuluri, and S. Parthasarathy. Label graph clustering using stochastic flows: applications to community discovery. In SIGKDD, pages 737-746, 2009.
24. J. Xie, S. Kelley, and B. K. Szymanski. Overlapping community detection in networks: the state of the art and comparative study. ACM Computing Surveys 45(12), December 2013.
25. S. Fortunato. Community detection in graphs. Physics Reports, 486:75-174, 2010.
26. J. Leskovec, J. Kleinberg, and C. Faloutsos. Graphs over time: densification laws, shrinking diameters and possible explanations. In SIGKDD, pages 177-187, 2005.
27. I. Leung, P. Hui, P. Lio, and J. Crowcroft. Towards real-time community detection in large networks. Phys. Rev. E, 79:066107, 2009.
28. W.W. Zachary. An Information Flow Model for Conflict and Fission in Small Groups. Journal of Anthropological Research, 33, pp. 452-473, 1977.
29. M. Girvan and M. E. J. Newman. Community Structure in Social and Biological Networks. Proc Natl Acad Sci USA, 99, pp. 7821-7826, 2002.
30. M. Boguna and R. Pastor-Satorras and A. Diaz-Guilera and A. Arenas. Models of social networks based on social distance attachment. Phys. Revi. E, 70, pp. 056122, 2004.
31. M. Richardson and R. Agrawal and P. Domingos. Trust Management for the Semantic Web. In Ineternational Semantic Web Conference, 2003.
32. J. Leskovec, K. Lang, A. Dasgupta, M. Mahoney. Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters. Internet Mathematics, 6(1) pp. 29-123, 2009.
33. L. Leskovec and B. Adamic. The Dynamics of Viral Marketing. ACM Transactions on the Web, 1(1), 2007.