DEMON: A local-first discovery method for overlapping communities

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2012, Pages 615-623

  Coscia, Michele ^a   Rossetti, Giulio ^b   Giannotti, Fosca ^c   Pedreschi, Dino ^b  

^a HARVARD UNIVERSITY   (United States)

^b UNIVERSITY OF PISA   (Italy)

^c ISTI CNR   (Italy)

Author keywords

community discovery; complex networks; data mining

Indexed keywords

COMMUNITY DISCOVERY; COMMUNITY ORGANIZATIONS; COMPLEX NETWORKS; GLOBAL LEVELS; GLOBAL SYSTEMS; GLOBAL VIEW; GRAPH PARTITIONING ALGORITHMS; INFORMATION NETWORKS; KNOWLEDGE EXTRACTION; LABEL PROPAGATION; LARGE NETWORKS; LOCAL COMMUNITY; MODULAR STRUCTURES; OVERLAPPING COMMUNITIES; REAL NETWORKS; REAL-WORLD NETWORKS; TIME COMPLEXITY; TOPDOWN;

ALGORITHMS; DATA MINING; INFORMATION SERVICES; METADATA;

WEBSITES;

EID: 84866039245     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2339530.2339630     Document Type: Conference Paper

References (25)

1. Yong-Yeol Ahn, James P. Bagrow, and Sune Lehmann. Link communities reveal multiscale complexity in networks. Nature, 466(7307):761-764, June 2010.
2. James P. Bagrow and Erik M. Bollt. Local method for detecting communities. Physical Review E, 72(4):046108+, October 2005.
3. Vincent D. Blondel, Jean-Loup Guillaume, Renaud Lambiotte, and Etienne Lefebvre. Fast unfolding of communities in large networks. J.STAT.MECH., page P10008, 2008.
4. Paolo Boldi, Marco Rosa, Massimo Santini, and Sebastiano Vigna. Layered label propagation: a multiresolution coordinate-free ordering for compressing social networks. In WWW, pages 587-596, 2011.
5. Aaron Clauset, M. E. J. Newman, and Cristopher Moore. Finding community structure in very large networks. Physical Review E, 70:066111, 2004.
6. Michele Coscia, Fosca Giannotti, and Dino Pedreschi. A classification for community discovery methods in complex networks. Statistical Analysis and Data Mining, 4(5):512-546, 2011.
7. Jeffrey Dean and Sanjay Ghemawat. MapReduce: Simplified data processing on large clusters. OSDI, pages 137-150, 2004.
8. Imre Derényi, Gergely Palla, and Tamás Vicsek. Clique Percolation in Random Networks. Physical Review Letters, 94(16):160202+, April 2005.
9. S. Fortunato. Community detection in graphs. Physics Reports, 486:75-174, February 2010.
10. Santo Fortunato and Marc Barthélemy. Resolution limit in community detection. PNAS, 104(1):36-41, January 2007.
11. Shantanu Godbole and Sunita Sarawagi. Discriminative methods for multi-labeled classification. In PAKDD, pages 22-30, 2004.
12. Amit Goyal, Byung-Won On, Francesco Bonchi, and Laks V. S. Lakshmanan. Gurumine: A pattern mining system for discovering leaders and tribes. ICDE, 0:1471-1474, 2009.
13. Keith Henderson, Tina Eliassi-Rad, Spiros Papadimitriou, and Christos Faloutsos. Hcdf: A hybrid community discovery framework. In SDM, pages 754-765, 2010.
14. Liran Katzir, Edo Liberty, and Oren Somekh. Estimating sizes of social networks via biased sampling. In WWW, pages 597-606, 2011.
15. A. Lancichinetti and S. Fortunato. Community detection algorithms: A comparative analysis. Physical Review E, 80(5):056117-+, November 2009.
16. Jure Leskovec, Lada A. Adamic, and Bernardo A. Huberman. The dynamics of viral marketing. ACM Trans. Web, 1, May 2007.
17. Peter J. Mucha, Thomas Richardson, Kevin Macon, Mason A. Porter, and J-P Onnela. Community structure in Time-Dependent, multiscale, and multiplex networks. Science, 328(5980):876-878, 2010.
18. M. E. J. Newman. Modularity and community structure in networks. Proceedings of the National Academy of Sciences, 103(23):8577-8582, June 2006.
19. Spiros Papadimitriou, Jimeng Sun, Christos Faloutsos, and Philip S. Yu. Hierarchical, parameter-free community discovery. In ECML PKDD, pages 170-187, 2008.
20. Pascal Pons and Matthieu Latapy. Computing communities in large networks using random walks. J. Graph Algorithms Appl., 10(2):191-218, 2006.
21. Usha N. Raghavan, Réka Albert, and Soundar Kumara. Near linear time algorithm to detect community structures in large-scale networks. Physical Review E, 76(3):036106+, September 2007.
22. Martin Rosvall and Carl T. Bergstrom. Maps of random walks on complex networks reveal community structure. PNAS, 105(4):1118-1123, January 2008.
23. Jianhua Ruan and Weixiong Zhang. An efficient spectral algorithm for network community discovery and its applications to biological and social networks. Data Mining, IEEE International Conference on, 0:643-648, 2007.
24. G. Tsoumakas and I. Katakis. Multi label classification: An overview. International Journal of Data Warehousing and Mining, 3(3):1-13, 2007.
25. Dashun Wang, Zhen Wen, Hanghang Tong, Ching-Yung Lin, Chaoming Song, and Albert-László Barabási. Information spreading in context. In WWW, pages 735-744, 2011.