Abstract
Community detection problem has been studied for years, but no common definition of community has been agreed upon till now. Former modularity based methods may lose the information among communities, and blockmodel based methods arbitrarily assume the connection probability inside a community is the same. In order to solve these problems, we present an energy model for community detection, which considers the information of the whole network. It does the community detection without knowing the type of network structure in advance. The energy model defines positive energy produced by attraction between two vertices, and negative energy produced by the attraction from other vertices which weakens the attraction between the two vertices. Energy between two vertices is the sum of their positive energy and negative energy. Computing the energy of each community, we may find the community structure when maximizing the sum of these communities energy. Finally, we apply the model to find community structure in real-world networks and artificial networks. The results show that the energy model is applicable to both unipartite networks and bipartite networks, and is able to find community structure successfully without knowing the network structure type.
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
Ahn, Y.Y., Bagrow, J.P., Lehmann, S.: Link communities reveal multiscale complexity in networks. Nature 466, U761-U711 (2010)
Newman, M.E.J.: Communities, modules and large-scale structure in networks. Nature Physics 8, 25–31 (2012)
Spirin, V., Mirny, L.A.: Protein complexes and functional modules in molecular networks. Proceedings of the National Academy of Sciences of the United States of America 100, 12123–12128 (2003)
Flake, G.W., Lawrence, S., Giles, C.L., Coetzee, F.M.: Self-organization and identification of web communities. Computer 35, 66 (2002)
Dourisboure, Y., Geraci, F., Pellegrini, M.: Extraction and Classification of Dense Implicit Communities in the Web Graph. ACM Transactions on the Web 3 (2009)
Moody, J., White, D.R.: Structural cohesion and embeddedness: A hierarchical concept of social groups. American Sociological Review 68, 103–127 (2003)
Wellman, B.: The development of social network analysis: A study in the sociology of science. Contemporary Sociology-A Journal of Reviews 37, 221–222 (2008)
Barnes, E.R.: An Algorithm for Partitioning the Nodes of a Graph. Siam Journal on Algebraic and Discrete Methods 3, 541–550 (1982)
Doreian, P., Batagelj, V., Ferligoj, A.: Generalized blockmodeling of two-mode network data. Social Networks 26, 29–53 (2004)
Reichardt, J., Bornholdt, S.: Statistical mechanics of community detection. Physical Review EÂ 74, 14 (2006)
Newman, M.E.J.: Finding community structure in networks using the eigenvectors of matrices. Physical Review EÂ 74 (2006)
Karrer, B., Newman, M.E.J.: Stochastic blockmodels and community structure in networks. Physical Review EÂ 83 (2011)
Rosvall, M., Bergstrom, C.T.: An information-theoretic framework for resolving community structure in complex networks. Proceedings of the National Academy of Sciences of the United States of America 104, 7327–7331 (2007)
Barber, M.J.: Modularity and community detection in bipartite networks. Physical Review EÂ 76 (2007)
Barber, M.J., Clark, J.W.: Detecting network communities by propagating labels under constraints. Physical Review EÂ 80 (2009)
Newman, M.E.J., Girvan, M.: Finding and evaluating community structure in networks. Physical Review EÂ 69 (2004)
Clauset, A., Moore, C., Newman, M.E.J.: Hierarchical structure and the prediction of missing links in networks. Nature 453, 98–101 (2008)
Guimera, R., Sales-Pardo, M.: Missing and spurious interactions and the reconstruction of complex networks. Proceedings of the National Academy of Sciences of the United States of America 106, 22073–22078 (2009)
Karrer, B., Newman, M.E.J.: Stochastic blockmodels and community structure in networks. Physical Review EÂ 83 (2011)
Lancichinetti, A., Fortunato, S., Radicchi, F.: Benchmark graphs for testing community detection algorithms. Physical Review EÂ 78 (2008)
Danon, L., Diaz-Guilera, A., Arenas, A.: The effect of size heterogeneity on community identification in complex networks. Journal of Statistical Mechanics-Theory and Experiment (2006)
Lusseau, D., Schneider, K., Boisseau, O.J., Haase, P., Slooten, E., Dawson, S.M.: The bottlenose dolphin community of Doubtful Sound features a large proportion of long-lasting associations - Can geographic isolation explain this unique trait? Behavioral Ecology and Sociobiology 54, 396–405 (2003)
Zachary, W.W.: An information flow model for conflict and fission in small groups. Journal of Anthropological Research 33, 452–473 (1977)
Girvan, M., Newman, M.E.J.: Community structure in social and biological networks. Proceedings of the National Academy of Sciences of the United States of America 99, 7821–7826 (2002)
Adamic, L.A., Adar, E.: Friends and neighbors on the Web. Social Networks 25, 211–230 (2003)
Davis, B.B., Garder, M.R.: Deep South. University of Chicago Press, USA (1941)
Scott, J., Hughes, M.: The anatomy of Scottish capital: Scottish companies and Scottish capital. The anatomy of Scottish capital: Scottish companies and Scottish capital (1980)
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
Pang, Y., Li, K. (2013). An Energy Model for Network Community Structure Detection. In: Motoda, H., Wu, Z., Cao, L., Zaiane, O., Yao, M., Wang, W. (eds) Advanced Data Mining and Applications. ADMA 2013. Lecture Notes in Computer Science(), vol 8346. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-53914-5_35
Download citation
DOI: https://doi.org/10.1007/978-3-642-53914-5_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-53913-8
Online ISBN: 978-3-642-53914-5
eBook Packages: Computer ScienceComputer Science (R0)