Enhancing Modularity Optimization via Local Close-Knit Structures
Pages 346 - 358
Abstract
Discovering communities is crucial for studying the structure and dynamics of networks. Groups of related nodes in the community often correspond to functional subunits such as protein complexes or social spheres. The modularity optimization method is typically an effective algorithm with global objective function. In this paper, we attempt to further enhance the quality of modularity optimization by mining local close-knit structures. First, both periphery and core close-knit structures are defined, and several fast mining and merging algorithms are presented. Second, a novel Fast Newman (FN) algorithm named NFN incorporating local structures into global optimization is proposed. Experimental results in terms of both internal and external on six real-world social networks have demonstrated the effectiveness of NFN on community detection.
References
[1]
Fortunato S. Community detection in graphs Phys. Rep. 2010 486 75-174
[2]
Yang B., Liu J., and Feng J. On the spectral characterization and scalable mining of network communities IEEE Transactions on Knowledge and Data Engineering 2012 24 2 326-337
[3]
Newman M. Fast algorithm for detecting community structure in networks Phys. Rev. E 2004 69 6 66113
[4]
Newman M.E. and Girvan M. Finding and evaluating community structure in networks Physical review E 2004 69 2 26113
[5]
Tang L. and Liu H. Community Detection and Mining in Social Media 2010 California Morgan & Claypool Publishers
[6]
Palla G., Derenyi I., Farkas I., and Vicsek T. Uncovering the overlapping community structure of complex networks in nature and society Nature 2005 435 814-818
[7]
Wasserman, S., Faust, K.: Social Network Analysis: methods and applications. Cambridge University Press (1994)
[8]
Xu, X., Yuruk, N., Feng, Z., Schweiger, T.A.: Scan: a structural clustering algorithm for networks. In: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 824–833. ACM (2007)
[9]
Lewis, T.G.: Network science: Theory and applications. John Wiley & Sons (2011)
[10]
Papadopoulos S., Kompatsiaris Y., Vakali A., and Spyridonos P. Community detection in social media Data Mining and Knowledge Discovery 2012 24 3 515-554
[11]
Everett M.G. and Borgatti S.P. Peripheries of cohesive subsets Social Networks 2000 21 4 397-407
[12]
Zachary W.W. An information flow model for conflict and fission in small groups J. Anthropol. Res. 1977 33 452-473
[13]
Zhao Y., Levina E., and Zhu J. Community extraction for social networks Proc. Natl. Acad. Sci. 2011 108 18 7321-7326
[14]
Newman M.E.J. Finding community structure in networks using the eigenvectors of matrices Phys. Rev. E 2006 74 036104
[15]
Girvan M. and Newman M.E. Community structure in social and biological networks Proceedings of the National Academy of Sciences 2002 99 12 7821-7826
[16]
Newman M.E.J. The structure of scientific collaboration networks Proc. Natl. Acad. Sci. 2001 98 2 404-409
[17]
Leskovec J., Lang K., Dasgupta A., and Mahoney M. Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters Internet Math. 2009 6 1 29-123
[18]
Borgatti, S.P., Everett, M.G., Freeman, L.C.: Ucinet for windows: Software for social network analysis (2002)
[19]
Cao J., Wu Z., Wu J., and Xiong H. SAIL: Summation-based incremental learning for information-theoretic text clustering IEEE Transactions on Cybernetics 2013 43 2 570-584
Index Terms
- Enhancing Modularity Optimization via Local Close-Knit Structures
Index terms have been assigned to the content through auto-classification.
Recommendations
KO: Modularity optimization in community detection
AbstractMany algorithms have been developed to detect communities in networks. The success of these developed algorithms varies according to the types of networks. A community detection algorithm cannot always guarantee the best results on all networks. ...
AFSMA: An Enhanced Artificial Fish Swarm Algorithm Based on Mutuality for Community Detection
ICBDR '18: Proceedings of the 2nd International Conference on Big Data ResearchCommunity structure is an important property of complex networks. Detecting these communities is of great significance to a wide range of applications. Community detection is an NP-hard problem having received great attentions in recent years. ...
A framework of mapping undirected to directed graphs for community detection
Community detection gives us a new way to understand the organization characteristics of complex systems. However, for simplicity, most methods for community detection always model the systems as an undirected graph. In this paper, we propose a new ...
Comments
Information & Contributors
Information
Published In
Oct 2013
439 pages
ISBN:978-3-642-54369-2
DOI:10.1007/978-3-642-54370-8
- Editors:
- Zhisheng Huang,
- Chengfei Liu,
- Jing He,
- Guangyan Huang
© Springer-Verlag Berlin Heidelberg 2014.
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Published: 07 March 2023
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 14 Oct 2024
Other Metrics
Citations
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in