Skip to main content

Enhancing Modularity Optimization via Local Close-Knit Structures

  • Conference paper
Book cover Web Information Systems Engineering – WISE 2013 Workshops (WISE 2013)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 8182))

Included in the following conference series:

  • 1479 Accesses

Abstract

Discovering communities is crucial for studying the structure and dynamics of networks. Groups of related nodes in the community often correspond to functional subunits such as protein complexes or social spheres. The modularity optimization method is typically an effective algorithm with global objective function. In this paper, we attempt to further enhance the quality of modularity optimization by mining local close-knit structures. First, both periphery and core close-knit structures are defined, and several fast mining and merging algorithms are presented. Second, a novel Fast Newman (FN) algorithm named NFN incorporating local structures into global optimization is proposed. Experimental results in terms of both internal and external on six real-world social networks have demonstrated the effectiveness of NFN on community detection.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Fortunato, S.: Community detection in graphs. Phys. Rep. 486, 75–174 (2010)

    Article  MathSciNet  Google Scholar 

  2. Yang, B., Liu, J., Feng, J.: On the spectral characterization and scalable mining of network communities. IEEE Transactions on Knowledge and Data Engineering 24(2), 326–337 (2012)

    Article  MathSciNet  Google Scholar 

  3. Newman, M.: Fast algorithm for detecting community structure in networks. Phys. Rev. E 69(6), 66113 (2004)

    Article  Google Scholar 

  4. Newman, M.E., Girvan, M.: Finding and evaluating community structure in networks. Physical review E 69(2), 26113 (2004)

    Article  Google Scholar 

  5. Tang, L., Liu, H.: Community Detection and Mining in Social Media. Morgan & Claypool Publishers, California (2010)

    Google Scholar 

  6. 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)

    Article  Google Scholar 

  7. Wasserman, S., Faust, K.: Social Network Analysis: methods and applications. Cambridge University Press (1994)

    Google Scholar 

  8. Xu, X., Yuruk, N., Feng, Z., Schweiger, T.A.: Scan: a structural clustering algorithm for networks. In: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 824–833. ACM (2007)

    Google Scholar 

  9. Lewis, T.G.: Network science: Theory and applications. John Wiley & Sons (2011)

    Google Scholar 

  10. Papadopoulos, S., Kompatsiaris, Y., Vakali, A., Spyridonos, P.: Community detection in social media. Data Mining and Knowledge Discovery 24(3), 515–554 (2012)

    Article  Google Scholar 

  11. Everett, M.G., Borgatti, S.P.: Peripheries of cohesive subsets. Social Networks 21(4), 397–407 (2000)

    Article  Google Scholar 

  12. Zachary, W.W.: An information flow model for conflict and fission in small groups. J. Anthropol. Res. 33, 452–473 (1977)

    Google Scholar 

  13. Zhao, Y., Levina, E., Zhu, J.: Community extraction for social networks. Proc. Natl. Acad. Sci. 108(18), 7321–7326 (2011)

    Article  Google Scholar 

  14. Newman, M.E.J.: Finding community structure in networks using the eigenvectors of matrices. Phys. Rev. E 74, 036104 (2006)

    Google Scholar 

  15. Girvan, M., Newman, M.E.: Community structure in social and biological networks. Proceedings of the National Academy of Sciences 99(12), 7821–7826 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  16. Newman, M.E.J.: The structure of scientific collaboration networks. Proc. Natl. Acad. Sci. 98(2), 404–409 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  17. Leskovec, J., Lang, K., Dasgupta, A., Mahoney, M.: Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters. Internet Math. 6(1), 29–123 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  18. Borgatti, S.P., Everett, M.G., Freeman, L.C.: Ucinet for windows: Software for social network analysis (2002)

    Google Scholar 

  19. Cao, J., Wu, Z., Wu, J., Xiong, H.: SAIL: Summation-based incremental learning for information-theoretic text clustering. IEEE Transactions on Cybernetics 43(2), 570–584 (2013)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhang, H., Wang, Y., Fang, C., Wu, Z. (2014). Enhancing Modularity Optimization via Local Close-Knit Structures. In: Huang, Z., Liu, C., He, J., Huang, G. (eds) Web Information Systems Engineering – WISE 2013 Workshops. WISE 2013. Lecture Notes in Computer Science, vol 8182. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-54370-8_30

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-54370-8_30

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-54369-2

  • Online ISBN: 978-3-642-54370-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics