Overlapping community detection using seed set expansion

International Conference on Information and Knowledge Management, Proceedings

Volumn , Issue , 2013, Pages 2099-2108

  Whang, Joyce Jiyoung ^a   Gleich, David F ^b   Dhillon, Inderjit S ^a  

^a University of Texas at Austin   (United States)

^b PURDUE UNIVERSITY   (United States)

Author keywords

Clustering; Community detection; Overlapping clusters; Seed set expansion; Seeds

Indexed keywords

CLUSTERING; COMMUNITY DETECTION; INFORMATION NETWORKS; OVERLAPPING CLUSTERS; OVERLAPPING COMMUNITIES; OVERLAPPING COMMUNITY DETECTIONS; PERSONALIZED PAGERANK; SEED SET;

INFORMATION SERVICES; KNOWLEDGE MANAGEMENT; SEED;

POPULATION DYNAMICS;

EID: 84889587455     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2505515.2505535     Document Type: Conference Paper

References (28)

1. Stanford Network Analysis Project. http://snap.stanford.edu/.
2. B. Abrahao, S. Soundarajan, J. Hopcroft, and R. Kleinberg. On the separability of structural classes of communities. In KDD, pages 624-632, 2012.
3. Y.-Y. Ahn, J. P. Bagrow, and S. Lehmann. Link communities reveal multiscale complexity in networks. Nature, 466:761-764, 2010.
4. R. Andersen, F. Chung, and K. Lang. Local graph partitioning using PageRank vectors. In FOCS, 2006.
5. R. Andersen and K. J. Lang. Communities from seed sets. In WWW, pages 223-232, 2006.
6. F. Bonchi, P. Esfandiar, D. F. Gleich, C. Greif, and L. V. Lakshmanan. Fast matrix computations for pairwise and columnwise commute times and Katz scores. Internet Mathematics, 8(1-2):73-112, 2012.
7. R. Burt. Structural Holes: The Social Structure of Competition. Harvard University Press, 1995.
8. M. Coscia, G. Rossetti, F. Giannotti, and D. Pedreschi. Demon: a local-first discovery method for overlapping communities. In KDD, 2012.
9. I. S. Dhillon, Y. Guan, and B. Kulis. Weighted graph cuts without eigenvectors: A multilevel approach. PAMI, 29(11):1944-1957, 2007.
10. U. Gargi, W. Lu, V. Mirrokni, and S. Yoon. Large-scale community detection on YouTube for topic discovery and exploration. In ICWSM, 2011.
11. D. F. Gleich and C. Seshadhri. Vertex neighborhoods, low conductance cuts, and good seeds for local community methods. In KDD, pages 597-605, 2012.
12. G. Karypis and V. Kumar. Multilevel k-way partitioning scheme for irregular graphs. JPDC, 48:96-129, 1998.
13. R. Khandekar, G. Kortsarz, and V. Mirrokni. Advantage of overlapping clusters for minimizing conductance. In LATIN, pages 494-505, 2012.
14. R. I. Kondor and J. D. Lafferty. Diffusion kernels on graphs and other discrete input spaces. In ICML, 2002.
15. D. Lai, X. Wu, H. Lu, and C. Nardini. Learning overlapping communities in complex networks via non-negative matrix factorization. Int. J. Mod Phys C, 22(10):1173-1190, 2011.
16. J. Leskovec, K. J. Lang, A. Dasgupta, and M. W. Mahoney. Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters. Internet Mathematics, 6(1):29-123, 2009.
17. M. W. Mahoney, L. Orecchia, and N. K. Vishnoi. A local spectral method for graphs: With applications to improving graph partitions and exploring data graphs locally. JMLR, 13:2339-2365, 2012.
18. N. Mishra, R. Schreiber, I. Stanton, and R. E. Tarjan. Clustering social networks. In WAW, 2007.
19. A. Mislove, H. S. Koppula, K. P. Gummadi, P. Druschel, and B. Bhattacharjee. Growth of the Flickr social network. In The First Workshop on Online Social Networks, 2008.
20. G. Palla, I. Derényi, I. Farkas, and T. Vicsek. Uncovering the overlapping community structure of complex networks in nature and society. Nature, 435:814-818, 2005.
21. J.-Y. Pan, H.-J. Yang, C. Faloutsos, and P. Duygulu. Automatic multimedia cross-modal correlation discovery. In KDD, pages 653-658, 2004.
22. B. S. Rees and K. B. Gallagher. Overlapping community detection by collective friendship group inference. In ASONAM, pages 375-379, 2010.
23. H. Shen, X. Cheng, K. Cai, and M.-B. Hu. Detect overlapping and hierarchical community structure in networks. Phys. A, 388(8):1706-1712, 2009.
24. H. H. Song, B. Savas, T. W. Cho, V. Dave, I. Dhillon, Y. Zhang, and L. Qiu. Clustered embedding of massive social networks. In SIGMETRICS, 2012.
25. J. J. Whang, X. Sui, and I. S. Dhillon. Scalable and memory-efficient clustering of large-scale social networks. In ICDM, pages 705-714, 2012.
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, 2013.
27. J. Yang and J. Leskovec. Overlapping community detection at scale: a nonnegative matrix factorization approach. In WSDM, pages 587-596, 2013.
28. S. Zhang, R.-S. Wang, and X.-S. Zhang. Identification of overlapping community structure in complex networks using fuzzy c-means clustering. Phys. A, 374(1):483-490, 2007.