Abstract
Overlapped communities detection in complex networks is one of the most intensively investigated problems in recent years. In order to accurately detect the overlapped communities in these networks, an algorithm using edge features, namely SAEC, is proposed. The algorithm transforms topology graph of nodes into line graph of edges and calculates the similarity matrix between nodes, then the edges are clustered using spectral analysis, thus we classify the edges into corresponding communities. According to the attached communities of edges, we cluster the nodes incident with the edges again to find the overlapped nodes among the communities. Experiments on randomly generated and real networks validate the algorithm.
This is a preview of subscription content, log in via an institution to check access.
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
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)
Newman, M.E.J.: Communities, modules and large-scale structure in networks. Nature Physics 8, 25–31 (2011)
Newman, M.E.J.: Fast algorithm for detecting community structure in networks. Physical Review EÂ 69, 066133 (2004)
Clauset, A., Newman, M.E.J., Moore, C.: Finding community structure in very large networks. Phys. Rev. EÂ 70, 066111 (2004)
Tsuchiura, H., Ogata, M., Tanaka, Y., et al.: Electronic states around a vortex core in high-Tc superconductors based on the t-J model. Phy. Rev. BÂ 68(1), 012509 (2003)
Newman, M.E.J.: The structure and function of complex networks. SIAM Review 45(2), 167–256 (2003)
Pujol, J.M., Bejar, J., Delgado, J.: Clustering algorithm for determining community structure in large networks. Phys. Rev. EÂ 77(9), 016107 (2006)
White, S., Smyth, P.: A spectral clustering approach to finding communities in graphs. In: Proceedings of the Fifth SIAM International Conference (2005)
Luxburg, U.: A tutorial on Spectral clustering. Statistics and Computing 17(4), 395–416 (2007)
Meila, M., Shi, J.: A random walks view of Spectral segmentation. AISTATS (2001)
Azran, A., Ghahramani, Z.: Spectral Methods for Automatic Multiscale Data Clustering. In: IEEE Conference on Computer Vision and Pattern Recognition, CVPR (2006)
Yan, X., Zhu, Y., Rouquier, J.-B., Moore, C.: Active learning for node classification in assortative and disassortative networks. In: Proc. 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (Association of Computing Machinery) (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, Z., Zhang, Z., Yang, W., Wu, X. (2013). An Overlapped Community Partition Algorithm Based on Line Graph. In: Wang, J., Xiong, H., Ishikawa, Y., Xu, J., Zhou, J. (eds) Web-Age Information Management. WAIM 2013. Lecture Notes in Computer Science, vol 7923. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38562-9_28
Download citation
DOI: https://doi.org/10.1007/978-3-642-38562-9_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38561-2
Online ISBN: 978-3-642-38562-9
eBook Packages: Computer ScienceComputer Science (R0)