Abstract
In order to find community structure that exists in complex network structure, this paper introduced K-means approach to the complex network community structure of the research. This paper studies the complex network of community structure detection algorithm, through the existing algorithm learn and study, proposed an improved algorithm based on K-means. Not know the premise of community structure for the complex networks division, the algorithm is simple and easy to understand, and the algorithm was used in karate network, through experimental verification, experimental results show that the algorithm is effective.
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
Xie, W., Chen, H., Yang, X., Xiongyong: The study on degree distribution property of complex network based on cooperative communication. Journal of Electronics (China) 3(27), 224–229 (2010)
Du, N., Wang, B., Wu, B.: Community Detection in Complex Networks. Journal of Computer Science & Technology 4, 672–683 (2008)
Moody, J.: Race: School integration, and friendship segregation in America. Am. J. Social 107(3), 679–716 (2001)
Wang, X.: Improved k-means clustering algorithm in societies divided. Qinghai Normal University (Natural Science Edition) 2, 22–24 (2009)
Wang, X., Li, X., Chen, G.-R.: Complex network theory and its applications. Tsinghua University Press, Beijing (2006)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag GmbH Berlin Heidelberg
About this paper
Cite this paper
Wang, Y. (2012). An Improved Complex Network Community Detection Algorithm Based on K-Means. In: Jin, D., Lin, S. (eds) Advances in Future Computer and Control Systems. Advances in Intelligent and Soft Computing, vol 160. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29390-0_40
Download citation
DOI: https://doi.org/10.1007/978-3-642-29390-0_40
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29389-4
Online ISBN: 978-3-642-29390-0
eBook Packages: EngineeringEngineering (R0)