Scalable community discovery of large networks

Proceedings - The 9th International Conference on Web-Age Information Management, WAIM 2008

Volumn , Issue , 2008, Pages 381-388

  Zhu, Zhemin ^a   Wang, Chen ^b   Ma, Li ^b   Pan, Yue ^b   Ding, Zhiming ^a  

^a INSTITUTE OF SOFTWARE   (China)

^b ISM   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ADMINISTRATIVE DATA PROCESSING; CHLORINE COMPOUNDS; CLUSTER ANALYSIS; CLUSTERING ALGORITHMS; COMPUTER SYSTEMS; DECISION SUPPORT SYSTEMS; FLOW OF SOLIDS; GRAPH THEORY; INFORMATION SCIENCE; INTERNET; MANAGEMENT INFORMATION SYSTEMS; SEARCH ENGINES; STANDARDS; WORLD WIDE WEB;

COMMUNITY DISCOVERY; COMMUNITY STRUCTURES; COMPLEX NETWORKS; GRAPH CLUSTERING; GRAPH PARTITIONING; HIGHLY SENSITIVE; INTERNATIONAL CONFERENCES; LARGE NETWORKS; NETWORKED SYSTEMS; Q FUNCTIONS; SCALABLE ALGORITHMS; SOCIAL NETWORKS; STATISTICAL PROPERTIES;

INFORMATION MANAGEMENT;

EID: 51849103356     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WAIM.2008.13     Document Type: Conference Paper

References (23)

1. M. E. J. Newman and M. Girvan, "Finding and evaluating community structure in networks," Physical Review E, vol. 69, p. 026113, 2004. [Online]. Available: http://www.citebase.org/abstract?id=oai:arXiv.org:condmat/ 0308217
2. T. N. Bui and C. Jones, "A heuristic for reducing fill-in in sparse matrix factorization." in PPSC, 1993, pp. 445-452.
3. M. E. J. Newman, "Finding community structure in networks using the eigenvectors of matrices," Physical Review E, vol. 74, p. 036104, 2006. [Online]. Available: doi:10.1103/PhysRevE.74.036104
4. _, "Modularity and community structure in networks," PROC.NATLACAD.SCI.USA, vol. 103, p. 8577, 2006. [Online]. Available: doi:10.1073/pnas.0601602103
5. Y.-C. Wei and C.-K. Cheng, "Towards efficient hierarchical designs by ratio cut partitioning," 1989.
6. J. Shi and J. Malik, "Normalized cuts and image segmentation," IEEE Trans. Pattern Anal. Mach. Intell., vol. 22, no. 8, pp. 888-905, 2000.
7. C. H. Q. Ding, X. He, H. Zha, M. Gu, and H. D. Simon, "A minmax cut algorithm for graph partitioning and data clustering," in ICDM'01: Proceedings of the 2001 IEEE International Conference on Data Mining. Washington, DC, USA: IEEE Computer Society, 2001, pp. 107-114.
8. A. Clauset, M. E. J. Newman, and C. Moore, "Finding community structure in very large networks," Physical Review E, vol. 70, p. 066111, 2004. [Online]. Available: http://www.citebase.org/abstract?id=oai: arXiv.org:cond-mat/0408187
9. M. E. J. Newman, "Fast algorithm for detecting community structure in networks," Physical Review E, vol. 69, p. 066133, 2004. [Online]. Available: http://www.citebase.org/abstract?id=oai:arXiv.org:condmat/0309508
10. U. Brandes, D. Delling, M. Gaertler, R. Goerke, M. Hoefer, Z. Nikoloski, and D. Wagner, "Maximizing modularity is hard," 2006. [Online]. Available: http://www.citebase.org/abstract?id=oai:arXiv.org:physics/0608255
11. L. Danon, J. Duch, A. Diaz-Guilera, and A. Arenas, "Comparing community structure identification," Oct. 2005. [Online]. Available: http://arxiv.org/abs/cond-mat/0505245
12. S. White and P. Smyth, "A spectral clustering approach to finding communities in graph." in SDM, 2005.
13. R. Guimera, M. Sales-Pardo, and L. A. N. Amaral, "Modularity from fluctuations in random graphs and complex networks," Physical Review E, vol. 70, p. 025101, 2004. [Online]. Available: http://www.citebase.org/ abstract?id=oai:arXiv.org:cond-mat/0403660
14. J. Reichardt and S. Bornholdt, "Statistical mechanics of community detection," Physical Review E, vol. 74, p. 016110, 2006. [Online]. Available: http://www.citebase.org/abstract?id=oai:arXiv.org:condmat/0603718
15. J. Duch and A. Arenas, "Community detection in complex networks using extremal optimization," Physical Review E, vol. 72, p. 027104, 2005. [Online]. Available: http://www.citebase.org/abstract?id=oai:arXiv.org: cond-mat/0501368
16. G. W. Flake, S. Lawrence, and C. L. Giles, "Efficient identification of web communities," in KDD'00: Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining. New York, NY, USA: ACM Press, 2000, pp. 150-160.
17. B. Hendrickson and R. Leland, "A multilevel algorithm for partitioning graphs," in Supercomputing'95: Proceedings of the 1995 ACM/IEEE conference on Supercomputing (CDROM). New York, NY, USA: ACM Press, 1995, p. 28.
18. Walshaw and Cross, "Mesh partitioning: A multilevel balancing and refinement algorithm," SIJSSC: SIAM Journal on Scientific and Statistical Computing, apparently renamed SIAM Journal on Scientific Computing, vol. 22, 2000. [Online]. Available: citeseer.ist.psu.edu/ walshaw00mesh.html
19. G. Karypis and V. Kumar, "A fast and high quality multilevel scheme for partitioning irregular graphs," SIAM J. Sci. Comput., vol. 20, no. 1, pp. 359-392, 1998.
20. _, MeTis 4.0: Unstrctured Graph Partitioning and Sparse Matrix Ordering System, 1998. [Online]. Available: http://www.cs.umn.edu/?metis
21. A. Abou-Rjeili and G. Karypis, "Multilevel algorithms for partitioning power-law graphs," 2006.
22. B. W Kernighan and S. Lin, "An efficient heuristic procedure for partitioning graphs," Bell Sys. Tech. J., vol. 49, no. 2, pp. 291-308, 1970.
23. C. M. Fiduccia and R. M. Mattheyses, "A linear-time heuristic for improving network partitions," in 25 years of DAC: Papers on Twentyfive years of electronic design automation. New York, NY, USA: ACM Press, 1988, pp. 241-247.