Online search of overlapping communities

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 2013, Pages 277-288

  Cui, Wanyun ^a   Xiao, Yanghua ^a   Wang, Haixun ^b   Lu, Yiqi ^a   Wang, Wei ^a  

^a FUDAN UNIVERSITY   (China)

^b MICROSOFT RESEARCH ASIA   (China)

Author keywords

Community search; Graph mining; Social networks

Indexed keywords

COMMUNITY SEARCH; EVOLVING NETWORKS; GRAPH MINING; MINING ALGORITHMS; MODEL AND ALGORITHMS; OVERLAPPING COMMUNITIES; REAL-LIFE NETWORKS; RECENT RESEARCHES;

ALGORITHMS; DATA MINING; ONLINE SEARCHING; SOCIAL NETWORKING (ONLINE);

MATHEMATICAL MODELS;

EID: 84880566637     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2463676.2463722     Document Type: Conference Paper

References (31)

1. G. Palla, I. Derényi, I. Farkas, and T. Vicsek, "Uncovering the overlapping community structure of complex networks in nature and society.," Nature, Vol. 435, no. 7043, pp. 814-818, Jun. 2005.
2. http://www.facebook.com/press/info.php?statistics.
3. M. Sozio and A. Gionis, "The community-search problem and how to plan a successful cocktail party," in KDD, 2010.
4. B. Adamcsek, G. Palla, I. J. Farkas, I. Derĺȩnyi, and T. Vicsek, "Cfinder: locating cliques and overlapping modules in biological networks," Bioinformatics, Vol. 22, no. 8, pp. 1021-1023, 2006.
5. H. Shen, X. Cheng, K. Cai, and M.-B. Hu, "Detect overlapping and hierarchical community structure in networks," Physica A, Vol. 388, no. 8, pp. 1706-1712, 2009.
6. S. Gregory, "An algorithm to find overlapping community structure in networks," in PKDD, 2007.
7. -, "A fast algorithm to find overlapping communities in networks," in Machine Learning and Knowledge Discovery in Databases, ser. Lecture Notes In Computer Science, 2008, vol. 5211, pp. 408-423.
8. Y.-Y. Ahn, J. P. Bagrow, and S. Lehmann, "Link communities reveal multiscale complexity in networks," Nature, Vol. 466, pp. 761-764, Jun. 2010.
9. J. Baumes, M. Goldberg, and M. Magdon-ismail, "Efficient identification of overlapping communities," in ISI, 2005, pp. 27-36.
10. X. Xu, N. Yuruk, Z. Feng, and T. A. Schweiger, "Scan: a structural clustering algorithm for networks," in KDD, 2007.
11. J. Xie, B. K. Szymanski, and X. Liu, "Slpa: Uncovering overlapping communities in social networks via a speaker-listener interaction dynamic process," in ICDMW, 2011.
12. C. Lee, F. Reid, A. McDaid, and N. Hurley, "Detecting highly overlapping community structure by greedy clique expansion," arXiv preprint arXiv:1002.1827, 2010.
13. A. Lancichinetti, F. Radicchi, J. J. Ramasco, and S. Fortunato, "Finding statistically significant communities in networks," PloS one, Vol. 6, no. 4, p. e18961, 2011.
14. D. Goldstein and M. Langberg, "The dense k subgraph problem," CoRR, Vol. abs/0912.5327, 2009.
15. D. Gibson, R. Kumar, and A. Tomkins, "Discovering large dense subgraphs in massive graphs," in VLDB, 2005.
16. S. V. Bahman Bahmani, Ravi Kumar, "Densest Subgraph in Streaming and MapReduce," in PVLDB, 2012.
17. N. Wang, J. Zhang, K.-L. Tan, and A. K. H. Tung, "On triangulation-based dense neighborhood graphs discovery," in PVLDB, 2010.
18. R. M. Karp, "Reducibility Among Combinatorial Problems," in Complexity of Computer Computations, 1972, pp. 85-103.
19. I. Derényi, G. Palla, and T. Vicsek, "Clique Percolation in Random Networks," Physical Review Letters, Vol. 94, no. 16, pp. 160-202, Apr. 2005.
20. P. Erdos and A. Rényi, "On the evolution of random graphs," in Publication of the Mathematical Institue of the Hungaria Academy of Sciences, 1960, pp. 17-61.
21. E. Aarts and J. K. Lenstra, Eds., Local Search in Combinatorial Optimization, 1997.
22. R. Battiti and M. Protasi, "Reactive local search for the maximum clique problem," Algorithmica, Vol. 29, no. 4, pp. 610-637, 2001.
23. W. Pullan and H. H. Hoos, "Dynamic local search for the maximum clique problem," J. Artif. Int. Res., Vol. 25, pp. 159-185, February 2006.
24. A. Grosso, M. Locatelli, and W. Pullan, "Simple ingredients leading to very efficient heuristics for the maximum clique problem," Journal of Heuristics, Vol. 14, pp. 587-612, December 2008.
25. *-graph," in SIGMOD, 2010.
26. M. Brunato, H. Hoos, and R. Battiti, "On effectively finding maximal quasi-cliques in graphs," Learning and Intelligent Optimization, pp. 41-55, 2008.
27. N. Eagle, M. Macy, and R. Claxton, "Network Diversity and Economic Development," Science, Vol. 328, no. 5981, pp. 1029-1031, 2010.
28. R. S. Burt, Structural holes: The social structure of competition. Harvard University Press, 1992.
29. Q. Shi, B. Xu, X. Xu, Y. Xiao, W. Wang, and H. Wang, "Diversity of social ties in scientific collaboration networks," Physica A, Vol. 390, no. 234, pp. 4627-4635, 2011.
30. H. Han, H. Zha, and C. L. Giles, "Name disambiguation in author citations using a k-way spectral clustering method," in ICDL, 2005.
31. H. Han, L. Giles, H. Zha, C. Li, and K. Tsioutsiouliklis, "Two supervised learning approaches for name disambiguation in author citations," in JCDL, 2004.