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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Fortunato, S.: Community detection in graphs. Phys. Rep. 486, 75–174 (2010)
Yang, B., Liu, J., Feng, J.: On the spectral characterization and scalable mining of network communities. IEEE Transactions on Knowledge and Data Engineering 24(2), 326–337 (2012)
Newman, M.: Fast algorithm for detecting community structure in networks. Phys. Rev. E 69(6), 66113 (2004)
Newman, M.E., Girvan, M.: Finding and evaluating community structure in networks. Physical review E 69(2), 26113 (2004)
Tang, L., Liu, H.: Community Detection and Mining in Social Media. Morgan & Claypool Publishers, California (2010)
Palla, G., Derenyi, I., Farkas, I., Vicsek, T.: Uncovering the overlapping community structure of complex networks in nature and society. Nature 435, 814–818 (2005)
Wasserman, S., Faust, K.: Social Network Analysis: methods and applications. Cambridge University Press (1994)
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)
Lewis, T.G.: Network science: Theory and applications. John Wiley & Sons (2011)
Papadopoulos, S., Kompatsiaris, Y., Vakali, A., Spyridonos, P.: Community detection in social media. Data Mining and Knowledge Discovery 24(3), 515–554 (2012)
Everett, M.G., Borgatti, S.P.: Peripheries of cohesive subsets. Social Networks 21(4), 397–407 (2000)
Zachary, W.W.: An information flow model for conflict and fission in small groups. J. Anthropol. Res. 33, 452–473 (1977)
Zhao, Y., Levina, E., Zhu, J.: Community extraction for social networks. Proc. Natl. Acad. Sci. 108(18), 7321–7326 (2011)
Newman, M.E.J.: Finding community structure in networks using the eigenvectors of matrices. Phys. Rev. E 74, 036104 (2006)
Girvan, M., Newman, M.E.: Community structure in social and biological networks. Proceedings of the National Academy of Sciences 99(12), 7821–7826 (2002)
Newman, M.E.J.: The structure of scientific collaboration networks. Proc. Natl. Acad. Sci. 98(2), 404–409 (2001)
Leskovec, J., Lang, K., Dasgupta, A., Mahoney, M.: Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters. Internet Math. 6(1), 29–123 (2009)
Borgatti, S.P., Everett, M.G., Freeman, L.C.: Ucinet for windows: Software for social network analysis (2002)
Cao, J., Wu, Z., Wu, J., Xiong, H.: SAIL: Summation-based incremental learning for information-theoretic text clustering. IEEE Transactions on Cybernetics 43(2), 570–584 (2013)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, H., Wang, Y., Fang, C., Wu, Z. (2014). Enhancing Modularity Optimization via Local Close-Knit Structures. In: Huang, Z., Liu, C., He, J., Huang, G. (eds) Web Information Systems Engineering – WISE 2013 Workshops. WISE 2013. Lecture Notes in Computer Science, vol 8182. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-54370-8_30
Download citation
DOI: https://doi.org/10.1007/978-3-642-54370-8_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-54369-2
Online ISBN: 978-3-642-54370-8
eBook Packages: Computer ScienceComputer Science (R0)