Skip to main content

Large-Scale Network Representation Learning Based on Improved Louvain Algorithm and Deep Autoencoder

  • Conference paper
  • First Online:
Pattern Recognition and Computer Vision (PRCV 2020)

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 12307))

Included in the following conference series:

Abstract

In recent years, feature learning of nodes in network has become a research hot spot. However, with the growth of the network scale, network structure has become more and more complicated, which makes it extremely difficult for network representation learning in large and complex networks. This paper proposes a fast large-scale network representation learning method based on improved Louvain algorithm and deep autoencoder. First, it quickly folds large and complex network into corresponding small network kernel through effective improved Louvain strategy. Then based on network kernel, a deep autoencoder method is conducted to represent nodes in kernel. Finally, the representations of the original network nodes are obtained by a coarse-to-refining procedure. Extensive experiments show that the proposed method perform well on large and complex real networks and its performance is better than most network representation learning methods.

The first author is a student. Thanks to NSFC Key Project of International (Regional) Cooperation and Exchanges (No. 61860206004), National NSFC (No. 61976004) and Collegiate Natural Science Fund of Anhui Province (No. KJ2017A014) for funding.

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 EPUB and 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

References

  1. Agarwal, N., Liu, H., Murthy, S., Sen, A., Wang, X.: A social identity approach to identify familiar strangers in a social network. In: Third International AAAI Conference on Weblogs and Social Media (2009)

    Google Scholar 

  2. Ahmed, N.K., et al.: A framework for generalizing graph-based representation learning methods. arXiv preprint arXiv:1709.04596 (2017)

  3. Blondel, V.D., et al.: Fast unfolding of communities in large networks. J. Stat. Mech.: Theory Exp. 2008(10), P10008 (2008)

    Google Scholar 

  4. Cao, S., Lu, W., Xu, Q.: Grarep: learning graph representations with global structural information. In: International Conference on Information and Knowledge Management, pp. 891–900. ACM (2015)

    Google Scholar 

  5. Dong, Y., Chawla, N.V., Swami, A.: metapath2vec: scalable representation learning for heterogeneous networks. In: Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 135–144. ACM (2017)

    Google Scholar 

  6. Grover, A., Leskovec, J.: node2vec: scalable feature learning for networks. In: Proceedings of the 22nd ACM SIGKDD, pp. 855–864. ACM (2016)

    Google Scholar 

  7. Hendrickson, B.: A multi-level algorithm for partitioning graphs. SC 95(28), 1–14 (1995)

    Google Scholar 

  8. Karypis, G., Kumar, V.: A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput. 20(1), 359–392 (1998)

    Article  MathSciNet  Google Scholar 

  9. Liang, J., Gurukar, S., Parthasarathy, S. Mile: A multi-level framework for scalable graph embedding. arXiv preprint arXiv:1802.09612 (2018)

  10. Mikolov, T., Chen, K., Corrado, G., Dean, J.: Efficient estimation of word representations in vector space. arXiv preprint arXiv:1301.3781 (2013)

  11. Mikolov, T., Sutskever, I., Chen, K., Corrado, G.S., Dean, J.: Distributed representations of words and phrases and their compositionality. In: Advances in Neural Information Processing Systems, pp. 3111–3119 (2013)

    Google Scholar 

  12. Mikolov, T., et al.: Linguistic regularities in continuous space word representations. In: Proceedings of the 2013 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, pp. 746–751 (2013)

    Google Scholar 

  13. Newman, M.E., Girvan, M.: Finding and evaluating community structure in networks. Phys. Rev. E 69(2), 026113 (2004)

    Article  Google Scholar 

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

    Article  Google Scholar 

  15. Palla, G., et al.: Uncovering the overlapping community structure of complex networks in nature and society. Nature 435(7043), 814 (2005)

    Article  Google Scholar 

  16. Perozzi, B., Al-Rfou, R., Skiena, S.: Deepwalk: online learning of social representations. In: Proceedings of the 20th ACM SIGKDD, pp. 701–710. ACM (2014)

    Google Scholar 

  17. Qiu, J., et al.: Network embedding as matrix factorization: unifying deepwalk, line, pte, and node2vec. In Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining, pp. 459–467. ACM (2018)

    Google Scholar 

  18. Shaw B, Jebara T.: Structure preserving embedding. In Proceedings of the 26th Annual International Conference on Machine Learning, pp. 937–944. ACM (2009)

    Google Scholar 

  19. Stark, C., et al.: The biogrid interaction database: 2011 update. Nucleic Acids Res. 39(suppl-1), D698–D704 (2010)

    Google Scholar 

  20. Tang, J., et al.: Line: large-scale information network embedding. In: Proceedings of the 24th International Conference on World Wide Web, International World Wide Web Conferences Steering Committee, pp. 1067–1077 (2015)

    Google Scholar 

  21. Tang, L., Liu, H.: Relational learning via latent social dimensions. In: Proceedings of the 15th ACM SIGKDD, pp. 817–826. ACM (2009)

    Google Scholar 

  22. Wang, D., Cui, P., Zhu, W.: Structural deep network embedding. In: Proceedings of the 22nd ACM SIGKDD, pp. 1225–1234. ACM (2016)

    Google Scholar 

  23. Xie, Y., Wang, X., Jiang, D., et al.: High-performance community detection in social networks using a deep transitive autoencoder. Inf. Sci. 493, 75–90 (2019)

    Article  MathSciNet  Google Scholar 

  24. Yang, C., Sun, M., Liu, Z., Tu, C.: Fast network embedding enhancement via high order proximity approximation. In: IJCAI, pp. 3894–3900 (2017)

    Google Scholar 

  25. You, X., Yin, B.: Community discovery research based on Louvain algorithm. In: 2017 4th International Conference on Machinery, Materials and Computer (MACMC 2017). Atlantis Press (2018)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Si-Bao Chen .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Xiong, SJ., Chen, SB., Ding, C.H.Q., Luo, B. (2020). Large-Scale Network Representation Learning Based on Improved Louvain Algorithm and Deep Autoencoder. In: Peng, Y., et al. Pattern Recognition and Computer Vision. PRCV 2020. Lecture Notes in Computer Science(), vol 12307. Springer, Cham. https://doi.org/10.1007/978-3-030-60636-7_37

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-60636-7_37

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-60635-0

  • Online ISBN: 978-3-030-60636-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics