Advertisement

A Novel Method for Community Detection in Complex Network Using New Representation for Communities

  • Wang Yiwen
  • Yao Min
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7104)

Abstract

During the recent years, community detection in complex network has become a hot research topic in various research fields including mathematics, physics and biology. Identifying communities in complex networks can help us to understand and exploit the networks more clearly and efficiently. In this paper, we investigate the topological structure of complex networks and propose a novel method for community detection in complex network, which owns several outstanding properties, such as efficiency, robustness, broad applicability and semantic. The method is based on partitioning vertex and degree entropy, which are both proposed in this paper. Partitioning vertex is a novel efficient representation for communities and degree entropy is a new measure for the results of community detection. We apply our method to several large-scale data-sets which are up to millions of edges, and the experimental results show that our method has good performance and can find the community structure hidden in complex networks.

Keywords

community detection complex network adjacency matrix 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell Syst. Tech. J. 49, 291–307 (1970)CrossRefzbMATHGoogle Scholar
  2. 2.
    Hastie, T., Tibshirani, R., Friedman, J.H.: The Elements of Statistical Learning. Springer, Berlin (2001)CrossRefzbMATHGoogle Scholar
  3. 3.
    Donath, W., Hoffman, A.: Lower bounds for the partitioning of graphs. IBM J. Res. Dev. 17(5), 420–425 (1973)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Cao, L.: In-depth Behavior Understanding and Use: the Behavior Informatics Approach. Information Science 180(17), 3067–3085 (2010)CrossRefGoogle Scholar
  5. 5.
    Girvan, M., Newman, M.E.J.: Community structure in social and biological networks. Proc. Natl Acad. 99, 7821–7826 (2002)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Girvan, M., Newman, M.E.J.: Community Structure in Social and Biological Networks. PNAS 99, 7821–7826Google Scholar
  7. 7.
    Fortunato, S.: Community detection in graphs. ArXiv:0906.0612v2 physics.soc-ph (January 25, 2010)Google Scholar
  8. 8.
    Garofalakis, J., Giannakoudi, T., Vopi, A.: Personalized Web Search by Constructing Semantic Clusters of User Profiles. In: Lovrek, I., Howlett, R.J., Jain, L.C. (eds.) KES 2008, Part II. LNCS (LNAI), vol. 5178, pp. 238–247. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  9. 9.
    Porter, M.A., Onnela, J.-P., Mucha, P.J.: Communities in networks. Notices of the American Mathematical Society 56, 1082–1097, 1164-1166 (2009)MathSciNetzbMATHGoogle Scholar
  10. 10.
  11. 11.
    Zachary, W.: An information flow model for conflict and fission in small groups. Journal of Anthropological Research 33, 452–473 (1977)CrossRefGoogle Scholar
  12. 12.
  13. 13.
  14. 14.
    Kamvar, S.D., Haveliwala, T.H., Manning, C.D., Golub, G.H.: Exploiting the Block Structure of the Web for Computing PageRank. Preprint (March 2003)Google Scholar
  15. 15.
    Newman, M.E.J.: Fast algorithm for detecting community structure in networks. Physical Review E 69, 066133 (2004)CrossRefGoogle Scholar
  16. 16.
    Fortunato, S.: Community detection in graphs. Physics Reports 486, 75–174 (2010)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Wang Yiwen
    • 1
  • Yao Min
    • 1
  1. 1.College of Computer ScienceZhejiang UniversityHangzhouChina

Personalised recommendations