Detecting communities in social networks using max-min modularity

Society for Industrial and Applied Mathematics - 9th SIAM International Conference on Data Mining 2009, Proceedings in Applied Mathematics

Volumn 2, Issue , 2009, Pages 973-984

  Chen, Jiyang ^a   Zaïane, Osmar R ^a   Goebel, Randy ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMMON PROPERTY; COMMUNITY DETECTION; COMMUNITY MINING; COMMUNITY STRUCTURES; DATA SETS; DENSITY MEASURES; DOMAIN EXPERTS; HIERARCHICAL CLUSTERING ALGORITHMS; IN-NETWORK; MAX-MIN; OR-NETWORKS; REAL-WORLD NETWORKS; ROBUSTNESS AGAINST NOISE; SOCIAL NETWORKS; STRUCTURAL MEASURES;

BEHAVIORAL RESEARCH; FLUORINE CONTAINING POLYMERS; GRAPH THEORY;

CLUSTERING ALGORITHMS;

EID: 72749116929     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (46)

1. E. Achtert, C. Bohm, H.-P. Kriegel, P. Kroger, and A. Zimek. Robust, complete, and e cient correlation clustering. In Proc 7th SIAM International Conference on Data Mining (SDM'07), 2007.
2. N. Bansal, A. Blum, and S. Chawla. Correlation clustering. In Machine Learning, pages 238-247, 2002.
3. S. Basu, A. Banerjee, and R. J. Mooney. Semi-supervised clustering by seeding. In ICML, pages 27-34, 2002.
4. S. Boccaletti, M. Ivanchenko, V. Latora, A. Pluchino, and A. Rapisarda. Detection of complex networks modularity by dynamical clustering. Physical Review E, 75:045102, 2007.
5. M. Charikar, V. Guruswami, and A. Wirth. Clustering with qualitative information. In FOCS, page 524, 2003.
6. A. Clauset. Finding local community structure in networks. Physical Review E, 72:026132, 2005.
7. A. Clauset, M. E. J. Newman, and C. Moore. Finding community structure in very lage networks. Phys. Rev. E, 70:066111, 2004.
8. L. Danon, J. Duch, A. Diaz-Guilera, and A. Arenas. Comparing community structure identification. J. Stat. Mech, page P09008, 2005.
9. I. S. Dhillon, S. Mallela, and D. S. Modha. Information-theoretic co-clustering. In KDD, pages 89-98, 2003.
10. C. H. Q. Ding, X. He, H. Zha, M. Gu, and H. D. Simon. A min-max cut algorithm for graph partitioning and data clustering. In ICDM, pages 107-114, 2001.
11. J. Duch and A. Arenas. Community detection in complex networks using extremal optimization. Phys. Rev. E, 72:027104, 2005.
12. G. W. Flake, S. Lawrence, and C. L. Giles. E cient identification of web communities. In KDD, pages 150-160, 2000.
13. S. Fortunato and M. Barthelemy. Resolution limit in community detection. PROC. NATL. ACAD. SCI. USA, 104:36, 2007.
14. L. Getoor and C. P. Diehl. Link mining: a survey. SIGKDD Explor. Newsl., 7(2):3-12, 2005.
15. A. Gionis, H. Mannila, and P. Tsaparas. Clustering aggregation. In ICDE, pages 341-352, 2005.
16. I. Giotis and V. Guruswami. Correlation clustering with a fixed number of clusters. In SODA, pages 1167-1176, 2006.
17. M. Girvan and M. E. J. Newman. Community structure in social and biological networks. In PNAS USA, 99:8271-8276. 2002.
18. S. Gregory. An algorithm to find overlapping community structure in networks. In PKDD, pages 91-102, 2007.
19. R. Guimera and L. A. N. Amaral. Functional cartography of complex metabolic networks. Nature, 433:895-900, 2005.
20. IMDB. http://www.imdb.com/.
21. D. Jensen, statistical challenges to inductive inference in linked data, 1999.
22. G. Karypis and V. Kumar. Multilevel k-way partitioning scheme for irregular graphs. Journal of Parallel and Distriuted Computing, 48(1):96-129. 1998.
23. D. Liben-Nowell and J. Kleinberg. The link prediction problem for social networks. In CIKM, pages 556-559, 2003.
24. B. Long, X. Wu, Z. M. Zhang, and P. S. Yu. Unsupervised learning on k-partite graphs. In KDD, pages 317-326, 2006.
25. B. Long, Z. M. Zhang, and P. S. Yu. A probabilistic framework for relational clustering. In KDD, pages 470-479, 2007.
26. T. Nepusz, A. Petroczi, L. Negyessy, and F. Bazso. Fuzzy communities and the concept of bridgeness in complex networks. Physical Review E, 77, 2008.
27. M. E. J. Newman. Fast algorithm for detecting community structure in networks. Physical Review E, 69, 2004.
28. M. E. J. Newman. Finding community structure in networks using the eigenvectors of matrices. Physical Review E, 74, 2006.
29. M. E. J. Newman. Modularity and community structure in networks. PNAS USA, 103, 2006.
30. M. E. J. Newman and M. Girvan. Finding and evaluating community structure in networks. Physical Review E, 69, 2004.
31. Pajek. http://vlado.fmf.uni-li.si/pub/networks/paiek/.
32. G. Palla, I. Derenyi, I. Farkas, and T. Vicsek. Uncovering the overlapping community structure of complex networks in nature and society. Nature, 435:814, 2005.
33. J. Ruan and W. Zhang. An e cient spectral algorithm for network community discovery and its applications to biological and social networks. In ICDM, pages 643-648 2007.
34. J. Ruan and W. Zhang. Identifying network communities with a high resolution. Physical Review E, 77:016104, 2008.
35. J. Scripps, P.-N. Tan, and A.-H. Esfahanian. Exploration of link structure and community-based node roles in network. In ICDM, 2007.
36. J. Shi and J. Malik. Normalized cuts and image segmentation. IEEE. Trans, on Pattern Analysis and Machine Intelligence, 2000.
37. C. Swamy. Correlation clustering: maximizing agreements via semidefinite programming. In SODA, pages 526-527, 2004.
38. C. Tantipathananandh, T. Berger-Wolf, and D. Kempe. A framework for community identification in dynamic social networks. In KDD, pages 717-726, 2007.
39. K. Wagstaff and C. Cardie. Clustering with instance-level constraints. In ICML, pages 1103-1110, 2000.
40. K. Wagstaff, C. Cardie, S. Rogers, and S. Schrodl. Constrained k-means clustering with background knowledge. In ICML, pages 577-584, 2001.
41. S. White and P. Smyth. A spectral clustering approach to finding communities in graphs. In SIAM, 2005.
42. X. Xu, N. Yuruk, Z. Feng, and T. A. J. Schweiger. Scan: a structural clustering algorithm for networks. In KDD, pages 824-833, 2007.
43. K. Y. Yip and M. K. Ng. Harp: A practical projected clustering algorithm. IEEE TKDE, 16(11):1387-1397, 2004.
44. W. W. Zachary. An information flow model for conflict and fission in small groups. Journal of Anthropological Research, 33:452-473, 1977.
45. O. R. Zaiane, J. Chen, and R. Goebel. Dbconnect: Mining research community on dblp data. In Joint 9th WEBKDD and 1st SNA-KDD Workshop, 2007.
46. S. Zhang, R.-S. Wang, and X.-S. Zhang. Identification of overlapping community structure in complex networks using fuzzy c-means clustering. Physica A, 374:483-490, 2007.