Uncovering the small community structure in large networks: A local spectral approach

WWW 2015 - Proceedings of the 24th International Conference on World Wide Web

Volumn , Issue , 2015, Pages 658-668

  Li, Yixuan ^a   He, Kun ^b   Bindel, David ^a   Hopcroft, John E ^a  

^a Department of Obstetrics Gynecology   (United States)

^b HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

Author keywords

Community detection; Local spectral clustering; Minimum one norm; Random walk; Seed set expansion

Indexed keywords

CITRUS FRUITS; CLUSTERING ALGORITHMS;

COMMUNITY DETECTION; ONE NORMS; RANDOM WALK; SEED SET; SPECTRAL CLUSTERING;

WORLD WIDE WEB;

EID: 84968835239     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2736277.2741676     Document Type: Conference Paper

References (28)

1. GNU linear programming kit. http://www.gnu.org/software/glpk.
2. Stanford Network Analysis Project. http://snap.stanford.edu.
3. B. Abrahao, S. Soundarajan, J. Hopcroft, and R. Kleinberg. A separability framework for analyzing community structure. ACM Transactions on Knowledge Discovery from Data (TKDD), 8(1):5, 2014.
4. Y.-Y. Ahn, J. P. Bagrow, and S. Lehmann. Link communities reveal multiscale complexity in networks. Nature, 466(7307):761-764, 2010.
5. R. Andersen, F. Chung, and K. Lang. Local graph partitioning using pagerank vectors. In FOCS, pages 475-486. IEEE, 2006.
6. R. Andersen and K. J. Lang.communities from seed sets. In WWW, pages 223-232. ACM, 2006.
7. M.-F. Balcan, C. Borgs, M. Braverman, J. Chayes, and S.-H. Teng. Finding endogenously formed communities. In SIAM, pages 767-783. ACM, 2013.
8. A. Clauset, C. R. Shalizi, and M. E. Newman. Power-law distributions in empirical data. SIAM review, 51(4):661-703, 2009.
9. M. Coscia, G. Rossetti, F. Giannotti, and D. Pedreschi. Demon: A local-first discovery method for overlapping communities. In KDD, pages 615-623. ACM, 2012.
10. S. Fortunato.community detection in graphs. Physics Reports, 486(3):75-174, 2010.
11. T. J. Hansen and M. W. Mahoney. Semi-supervised eigenvectors for large-scale locally-biased learning. Journal of Machine Learning Research, 15:3691-3734, 2014.
12. D. Jin, B. Yang, C. Baquero, D. Liu, D. He, and J. Liu. A markov random walk under constraint for discovering overlapping communities in complex networks. Journal of Statistical Mechanics: Theory and Experiment, 2011(05):P05031, 2011.
13. K. Kloster and D. F. Gleich. Heat kernel based community detection. In KDD. ACM, 2014.
14. I. M. Kloumann and J. M. Kleinberg.community membership identification from small seed sets. In KDD. ACM, 2014.
15. A. Lancichinetti, S. Fortunato, and F. Radicchi. Benchmark graphs for testing community detection algorithms. Physical Review E, 78(4):046110, 2008.
16. A. Lancichinetti, F. Radicchi, J. J. Ramasco, and S. Fortunato. Finding statistically significant communities in networks. PloS one, 6(4):e18961, 2011.
17. J. Leskovec, K. J. Lang, A. Dasgupta, and M. W. Mahoney. Statistical properties of community structure in large social and information networks. In WWW, pages 695-704. ACM, 2008.
18. M. Meila and J. Shi. A random walks view of spectral segmentation. 2001.
19. M. Molloy and B. Reed. A critical point for random graphs with a given degree sequence. Random structures & algorithms, 6(2-3):161-180, 1995.
20. A. Y. Ng, M. I. Jordan, Y. Weiss, et al. On spectral clustering: Analysis and an algorithm. Advances in neural information processing systems, 2:849-856, 2002.
21. P. Pons and M. Latapy.computing communities in large networks using random walks. In Computer and Information Sciences-ISCIS 2005, pages 284-293. Springer, 2005.
22. U. N. Raghavan, R. Albert, and S. Kumara. Near linear time algorithm to detect community structures in large-scale networks. Physical Review E, 76(3):036106, 2007.
23. M. Rosvall and C. T. Bergstrom. Multilevel compression of random walks on networks reveals hierarchical organization in large integrated systems. PloS one, 6(4):e18209, 2011.
24. D. A. Spielman and S.-H. Teng. Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. In STOC, pages 81-90. ACM, 2004.
25. J. J. Whang, D. F. Gleich, and I. S. Dhillon. Overlapping community detection using seed set expansion. In CIKM, pages 2099-2108. ACM, 2013.
26. J. Xie, S. Kelley, and B. K. Szymanski. Overlapping community detection in networks: The state-of-The-Art and comparative study. ACM Computing Surveys (CSUR), 45(4):43, 2013.
27. J. Yang and J. Leskovec. Defining and evaluating network communities based on ground-Truth. In ICDM, pages 10-13, 2012.
28. V. Zlatic, A. Gabrielli, and G. Caldarelli. Topologically biased random walk and community finding in networks. Physical Review E, 82(6):066109, 2010.