Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Detecting community structure in networks by representative energy

  • Research Article
  • Published:
Frontiers of Computer Science in China Aims and scope Submit manuscript

Abstract

Network community has attractedmuch attention recently, but the accuracy and efficiency in finding a community structure is limited by the lower resolution of modularity. This paper presents a new method of detecting community based on representative energy. The method can divide the communities and find the representative of community simultaneously. The communities of network emerges during competing for the representative among nodes in network, thus we can sketch structure of the whole network. Without the optimizing by modularity, the community of network emerges with competing for representative among those nodes. To obtain the proximate relationships among nodes, we map the nodes into a spectral matrix. Then the top eigenvectors are weighted according to their contributions to find the representative node of a community. Experimental results show that the method is effective in detecting communities of networks.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Watts D J, Strogatz S H. Collective dynamics of ’small world’ networks. Nature, 1998, 393: 440–442

    Article  Google Scholar 

  2. Barabasi A L, Albert R. Emergence of scaling in random network. Science, 1999, 286: 509–512

    Article  MathSciNet  Google Scholar 

  3. Zhang Z Z, Rong L L, Comellas F. Evolving smallworld networks with geographical attachment preference. Journal of Physics A: Mathematical and General, 2006, 39(13): 3253–3261

    Article  MATH  MathSciNet  Google Scholar 

  4. Zhang Z Z, Rong L L, Comellas F. High dimensional random apollonian networks. Physica A, 2006, 364: 610–618

    Article  Google Scholar 

  5. Palla G, Derenyi I, Farkas I, Vicsek T. Uncovering the overlapping community structure of complex networks in nature and society. Nature, 2005, 435: 814–818

    Article  Google Scholar 

  6. Palla G, Barabasi A L, Vicsek T. Quantifying social group evolution. Nature, 2007, 446: 664–667

    Article  Google Scholar 

  7. Newman M E J. Detecting community structure in networks. European Physical Journal B, 2004, 38: 321–330

    Article  Google Scholar 

  8. Clauset A. Finding local community structure in networks. Physical Review E, 2005, 72: 026132

    Article  Google Scholar 

  9. Kernighan B, Lin S. An efficient heuristic procedure for partitioning graphs. Bell System Technical Journal, 1970, 49: 291–307

    Google Scholar 

  10. Pothen A, Simon H, Liou K P. Partitioning sparse matrices with eigenvectors of graphs. SIAM Journal on Matrix Analysis and Applications, 1990, 11(3): 430–452

    Article  MATH  MathSciNet  Google Scholar 

  11. Fiedler M. Algebraic connectivity of graphs. SIAM Journal on Matrix Analysis and Applications, 1973, 23: 430–452

    MathSciNet  Google Scholar 

  12. Newman ME J, Girvan M. Finding and evaluating community structure in networks. Physical Review E, 2004, 69: 026113

    Article  Google Scholar 

  13. Newman M E J. Finding community structure in networks using the eigenvectors of matrices. Physical Review E, 2006, 74(3): 036104

    Article  MathSciNet  Google Scholar 

  14. Capocci A, Servedio V D P, Caldarelli G, et al. Detecting communities in large networks. In: Proceedings of the 3rd Workshop on algorithms and models for the web graph, number 3243 in Lecture Notes in Computer Science, Springer, Berlin, 2004

    Google Scholar 

  15. Estrada E, Rodriguez-Velazquez J A. Spectral measures of biparitivity in complex networks. Physical Review E, 2005, 72: 046105

    Article  MathSciNet  Google Scholar 

  16. White S, Smyth P. A spectral clustering approach to finding communities in graphs. In: Proceedings of the 5th SIAM International conference on data Mining. Society for industrial and applied Mathematics, Philadiphia, 2005

    Google Scholar 

  17. Zhang S H, Wang R S, Zhang X Z, et al. Identification of overlapping community structure in complex networks using fuzzy c-means clustering. Physica A, 2007, 374: 483–490

    Article  Google Scholar 

  18. Kumpula J M, Saramaki J, Kaski K, et al. Limited resolution in complex network community detection with Potts model approach. European Physical Journal B, 2007, 56: 41–45

    Article  Google Scholar 

  19. Li Z P, Zhang S H, Wan R S. Quantitative function for community detection. Physical Review E, 2008, 77: 036109

    Article  Google Scholar 

  20. Arenas A, Fernandez A, Gomez S. Multiple resolution of the modular structure of complex networks. Arxiv:physics/0703218, 2007

  21. Reichardt J, Bornholdt S. Statistical mechanics of community detection. Physical Review E, 2006, 74: 016110

    Article  MathSciNet  Google Scholar 

  22. Frey B J, Dueck D. Clustering by passing message between data points. Science, 2007, 315: 972–976

    Article  MathSciNet  Google Scholar 

  23. Zachary W W. An information flow model for conflict and fission in small groups. Journal of Anthropological Research, 1977, 33: 452–473

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of System Engineering, Dalian University of Technology, Dalian, 116023, China

    Ji Liu & Guishi Deng

  2. College of Statistics and Information, Xinjiang University of Finance and Economics, Urumqi, 830012, China

    Ji Liu

Authors
  1. Ji Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Guishi Deng
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ji Liu.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Liu, J., Deng, G. Detecting community structure in networks by representative energy. Front. Comput. Sci. China 3, 366–372 (2009). https://doi.org/10.1007/s11704-009-0042-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11704-009-0042-2

Keywords

Search

Navigation