Abstract
Recently, topology structures of many social, biological and technological networks have been discovered to display a scale-free property. For a network, a community is a natural division of network nodes into groups in which there are more links between nodes within the groups than to nodes outside of it. Many methods of community finding have been proposed to seek a fast, feasible and reasonable partition algorithm for the whole network nodes. In this chapter, we introduce the topology of the network to evaluate the feasibility and correctness of a community finding algorithm. A relationship between the rough number of communities and the magnitude of the number of hub nodes in the network is given in detail firstly. Then, an algorithm based on Laplace matrix spectral decomposition is proposed and its key technology, threshold selection of Euclidean distance between nodes, is discussed. Based on the scale-free topology of complex network, the evaluation criterion of community finding algorithm including three conditions is obtained. Numerical results show that the algorithm of community finding is an effective one and the evaluation criterion is feasible, fast and easy to operate.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Han, J., Kamber, M.: Data Mining: Concepts and Techniques, 2nd edn. Morgan Kaufmann Publishers, New York (2006)
Newman, M.E.J.: The structure and function of complex networks. SIAM Review 45(2), 167–256 (2003)
Barabási, A.L., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509–512 (1999)
Albert, R., Barabási, A.L.: Statistical mechanics of complex networks. Rev. Mod. Phys. 71(1), 47–97 (2002)
Dorogovtsev, S.N., Mendes, J.F.F.: Evolution of Network: From biological nets to the Internet and WWW, 1st edn. Oxford University Press, London (2003)
Barabási, A.L., Albert, R., Jeong, H.: Mean-field theory for scale-free random networks. Physica A 272, 173–187 (1999)
Wang, X.F., Chen, G.R.: Complex networks: small-world, scale-free and beyond. IEEE Circuits and Systems Magazine 3(1), 6–20 (2003)
Dai, G.Z., Wang, L., Qin, S.: Scale-free property of complex systems and its macro-control. Science and Technology Review 24(5), 11–16 (2006) (in Chinese)
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.: Detecting community structure in networks. The European Physics Journal B 38, 321–330 (2004)
Girvan, M., Newman, M.E.J.: Community structure in social and biological networks. Proc. Natl. Acad. Sci. 99(12), 7821–8726 (2001)
Barthélemy, M.: Betweenness centrality in large complex networks. The European Physical Journal B 38, 163–168 (2004)
Clauset, A.: Finding local community structure in networks. Phys. Rev. E 72, 026132 (2005)
Newman, M.E.J., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. E 69, 026113 (2004)
Capocci, A., Servedio, V.D.P., Caldarelli, G., Colaiori, F.: Detecting community in large networks. Physica A 352, 669–676 (2005)
Qin, S., Dai, G.Z., Li, Y.L.: Mining system for community finding and centrality of virtual user network on the internet. In: Sixth IEEE Conference on Data Mining-Workshops (ICDMW 2006), pp. 284–289. IEEE Press, New York (2006)
Newman, M.E.J.: Fast algorithm for detecting community structure in networks. Phys. Rev. E 69, 066113 (2004)
Dorogovtsev, S.N., Mendes, J.F.F.: Evolution of networks. Advances in Physics 51, 1079–1187 (2002)
Erdös, P., Rényi, A.: On the evolution of random graphs. Publ. Math. Inst. Hung. Acad. Sci. 5, 17–61 (1960)
Newman, M.E.J., Park, J.: Why social networks are different from other types of networks. Phys. Rev. E 68(3), 036122 (2003)
Freeman, L.C.: Centrality in social networks conceptual clarification. Social Networks 1(3), 215–239 (1979)
Flake, G., Lawrence, S., Giles, C.: Efficient identification of Web communities. In: Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 150–160. ACM, Boston (2000)
Lehmann, K.A., Kaufmann, M.: Decentralized algorithms for evaluating centrality in complex networks. Technical report of the Wilhelm- Schickard- Institut. WSI 2003-10, ISSN 0946-3852 (2003)
Wang, L., Dai, G.Z.: On degree distribution of complex network. Journal of Northwestern Polytechnical University 24(4), 405–409 (2006) (in Chinese)
Kuo, Z.B., Zhang, C.S.: Reply networks on a bulletin board system. Phys. Rev. E. 67(3), 036117 (2003)
Watts, D.J., Strogatz, S.H.: Collective dynamics of ‘small-world’ networks. Nature 393, 440–442 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Qin, S., Dai, G. (2009). Community Finding of Scale-Free Network: Algorithm and Evaluation Criterion. In: Zighed, D.A., Tsumoto, S., Ras, Z.W., Hacid, H. (eds) Mining Complex Data. Studies in Computational Intelligence, vol 165. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88067-7_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-88067-7_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-88066-0
Online ISBN: 978-3-540-88067-7
eBook Packages: EngineeringEngineering (R0)