skip to main content
research-article

Variational Graph Autoencoder with Adversarial Mutual Information Learning for Network Representation Learning

Published:20 March 2023Publication History
Skip Abstract Section

Abstract

With the success of Graph Neural Network (GNN) in network data, some GNN-based representation learning methods for networks have emerged recently. Variational Graph Autoencoder (VGAE) is a basic GNN framework for network representation. Its purpose is to well preserve the topology and node attribute information of the network to learn node representation, but it only reconstructs network topology, and does not consider the reconstruction of node features. This strategy will make node representation can not well reserve node features information, impairing the ability of the VGAE method to learn higher quality representations. To solve this problem, we arise a new network representation method to improve the VGAE method for well retaining both node features and network structure information. The method utilizes adversarial mutual information learning to maximize the mutual information (MI) of node features and node representations during the encoding process of the variational autoencoder, which forces the variational encoder to get the representation containing the most informative node features. The method consists of three parts: a variational graph autoencoder includes a variational encoder (MI generator (G)) and a decoder, a positive MI sample module (maximizing MI module), and an MI discriminator (D). Furthermore, we explain why maximizing MI between node features and node representation can reconstruct node attributes. Finally, we conduct experiments on seven public representative datasets for nodes classification, nodes clustering, and graph visualization tasks. Experimental results demonstrate that the proposed algorithm significantly outperforms current popular network representation algorithms on these tasks. The best improvement is 17.13% than the VGAE method.

REFERENCES

  1. [1] Hastings M. B.. 2006. Community detection as an inference problem. Physical Review E74, 3 (2006), 035–102.Google ScholarGoogle Scholar
  2. [2] Kipf T. N. and Welling M.. 2017. Semi-supervised classification with graph convolutional networks. In Proceedings of the ICLR.Google ScholarGoogle Scholar
  3. [3] Ying R., He R. N., Chen K. F., et al. 2018. Graph convolutional neural networks for web-scale recommender systems. In Proceedings of the SIGKDD Graph Convolutional Neural Networks for Web-scale Recommender Systems. 974–983.Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. [4] Cao S. S., Lu W., and Xu Q. K.. 2015. GraRep: Learning graph representations with global structural information. In Proceedings of the GraRep: Learning Graph Representations with Global Structural Information. 891–900.Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. [5] Li Y., Sha C. F., Huang X., and Zhang Y. C.. 2018. Community detection in attributed graphs: An embedding approach. In Proceedings of the AAAIConference on Artificial Intelligence. 338–345.Google ScholarGoogle ScholarCross RefCross Ref
  6. [6] Yang C., Liu Z. Y., Zhao D. L., et al. 2015. Network representation learning with rich text information. In Proceedings of the 24th International Joint Conference on Artificial Intelligence. 2111–2117.Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. [7] Qiu J., Dong Y., Ma H., et al. 2019. Netsmf: Large-scale network embedding as sparse matrix factorization. In Proceedings of the 28th International Conference on World Wide Web. San Francisco. 1509–1520.Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. [8] Zhang J., Dong Y., Wang Y., et al. 2019. ProNE: fast and scalable network representation learning. In Proceedings of the 28th International Joint Conference on Artificial Intelligence, Macao. 4278–4284.Google ScholarGoogle ScholarCross RefCross Ref
  9. [9] Perozzi B., AlRfou R., and Skiena S.. 2014. Deep walk: Online learning of social representations. In Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 701–710.Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. [10] Grover A. and Leskovec J.. 2016. Node2vec: Scalable feature learning for networks. In Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 855–864.Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. [11] Tang J., Qu M., Wang M., et al. 2015. Line: Large scale information network embedding. In Proceedings of the 24th International Conference on World Wide Web. Florence, Italy. 1067–1077.Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. [12] Perozzi B., Kulkarni V., Chen H., and Skiena S.. 2017. Don’t walk, skip! Online learning of multi-scale network embeddings. In Proceedings of the 2017 IEEE/ACM International Conference.Google ScholarGoogle Scholar
  13. [13] Rozemberczki B. and Sarkar R.. 2018. Fast sequence-based embedding with diffusion graphs. In Proceedings of the International Workshop on Complex Networks. Springer (2018). 99–107.Google ScholarGoogle Scholar
  14. [14] Wang C., Pan S., Long G.g, et al. 2017. Mgae: Marginalized graph autoencoder for graph clustering. In Proceedings of the 2017 ACM on Conference on Information and Knowledge Management. 889–898.Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. [15] Ribeiro L., Saverese P., and Figueiredo D.. 2017. Struc2vec: Learning node representations from structural identity. In Proceedings of the International Conference on Knowledge Discovery and Data Mining. 385–394.Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. [16] Wang D., Cui P., and Zhu W.. 2016. Structural deep network embedding. In Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery \(and\) Data Mining. 1225–1234.Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. [17] Velickovič P., Cucurull G., Casanova A., Romero A., Ĺio P., and Bengio Y.. 2018. Graph attention networks. In Proceedings of the International Conference on Learning Representations.Google ScholarGoogle Scholar
  18. [18] Hamilton W., Ying Z., and Leskovec J.. 2017. Inductive representation learning on large graphs. In Proceedings of the Advances in Neural Information Processing Systems 1024–1034.Google ScholarGoogle Scholar
  19. [19] Kipf T. N. and Welling M.. 2016. Variational graph auto-encoders. In Proceedings of the NIPS Workshop on Bayesian Deep Learning.Google ScholarGoogle Scholar
  20. [20] Pan S., Hu R., Long G., et al. 2018. Adversarially regularized graph autoencoder for graph embedding. In Proceedings of the IJCAI. 2609–2615.Google ScholarGoogle ScholarCross RefCross Ref
  21. [21] Yu W. C., Zheng C., Cheng W., Song D. J., et al. 2018. Learning deep network representations with adversarially regularized autoencoders. In Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. London, United Kingdom 2663–2671.Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. [22] Kingma D. P. and Welling M.. 2014. Auto-Encoding Variational Bayes. arXiv:1312.6114v10. Retrieved from https://arxiv.org/abs/1312.6114v10Google ScholarGoogle Scholar
  23. [23] You J., Ying R., and Leskovec J.. 2019. Position-aware graph neural networks. In Proceedings of the International Conference on Machine Learning. 7134–7143.Google ScholarGoogle Scholar
  24. [24] Borgwardt K. M. and Kriegel H. P.. 2005. Shortest-path kernels on graphs. In Proceedings of the International Conference on Data Mining.Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. [25] Shervashidze N., Vishwanathan S., Petri T., et al. 2009. Efficient graphlet kernels for large graph comparison. In Proceedings of the Artificial Intelligence and Statistics. 488–495.Google ScholarGoogle Scholar
  26. [26] Shervashidze N., Schweitzer P., Leeuwen E. J., et al. 2011. Weisfeiler-lehman graph kernels. Journal of Machine Learning Research. 2539–2561.Google ScholarGoogle Scholar
  27. [27] Yanardag P. and Vishwana S.. 2015. Deep graph kernels. In Proceedings of the International Conference on Knowledge Discovery and Data Mining. 1365–1374.Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. [28] Kondor R. and Pan H.. 2016. The multiscale laplacian graph kernel. In Proceedings of the Advances in Neural Information Processing Systems. 2990–2998.Google ScholarGoogle Scholar
  29. [29] Park J., Lee M., Chang H. J., et al. 2019. Symmetric graph convolutional autoencoder for unsupervised graph representation learning. In Proceedings of the International Conference on Computer Vision. 6519–6528.Google ScholarGoogle ScholarCross RefCross Ref
  30. [30] Veli’ckovic P., Fedus W., et al. 2019. Deep graph infomax. In Proceedings of the International Conference on Learning Representations.Google ScholarGoogle Scholar
  31. [31] Sun F. Y., Hoffman J., Verma , et al. 2020. Infograph: Unsupervised and semi-supervised graph-level representation learning via mutual information maximization. In Proceedings of the International Conference on Learning Representations.Google ScholarGoogle Scholar
  32. [32] Hjelm R. D., Fedorov A., Lavoie-Marchildon , et al. 2019. Learning deep representations by mutual information estimation and maximization. In Proceedings of the International Conference on Learning Representations.Google ScholarGoogle Scholar
  33. [33] Goodfellow I., PougetAbadie J., Mirza M., et al. 2014. Generative adversarial nets. In Proceedings of the Advances in Neural Information Processing Systems. 2672–2680.Google ScholarGoogle Scholar
  34. [34] Sebastian N., Botond C. and Ryota T.. 2016. F-GAN: Training generative neural samplers using variational divergence minimization. In Proceedings of the 30th International Conference on Neural Information Processing Systems. 271–279.Google ScholarGoogle Scholar
  35. [35] Retrieved from https://spaces.ac.cn/archives/6088.Google ScholarGoogle Scholar
  36. [36] Defferrard M., Bresson X., and Vandergheynst P.. 2016. Convolutional neural networks on graphs with fast localized spectral filtering. In Proceedings of the Advances in Neural Information Processing Systems. 384–852.Google ScholarGoogle Scholar
  37. [37] Monti F., Boscaini D., Masci J., Rodola E., et al. 2017. Geometric deep learning on graphs and manifolds using mixture model cnns. In Proceedings of the Conference on Computer Vision and Pattern Recognition.Google ScholarGoogle ScholarCross RefCross Ref
  38. [38] Huang X., Li J. and Hu X.. 2017. Accelerated attributed network embedding. In Proceedings of the 2017 SIAM International Conference on Data Mining. Houston, Texas. 633–641.Google ScholarGoogle Scholar
  39. [39] Liao L., He X., Zhang H., et al. 2018. Attributed social network embedding. IEEE Transactions on Knowledge and Data Engineering. 2257–2270.Google ScholarGoogle Scholar
  40. [40] He D., Zhai L., Li Z., et al. 2020. Adversarial mutual information learning for network embedding. In Proceedings of the 29th International Joint Conference on Artificial Intelligence.Google ScholarGoogle ScholarCross RefCross Ref
  41. [41] Shu X., Qi G. J., Tang J., and Wang J.. 2015. Weekly-shared deep transfer networks for heterogeneous-domain knowledge propagation. ACM International Conference on Multimedia. 35–44.Google ScholarGoogle Scholar
  42. [42] Tang J., Shu X., Li Z., Qi G. J., et al. 2016. Generalized deep transfer networks for heterogeneous-domain knowledge propagation. ACM Transactions on Multimedia Computing, Communications, and Applications 12, 4s (2016), 68.Google ScholarGoogle ScholarDigital LibraryDigital Library
  43. [43] Huang W., Li Y., Fang Y., Fan J., et al. 2020. BiANE: Bipartite attributed network embedding. International ACM SIGIR Conference on Research and Development in Information Retrieval.Google ScholarGoogle Scholar
  44. [44] Liu Z., Huang C., Yu Y., and Dong J.. 2021. Motif-preserving dynamic attributed network embedding. International World Wide Web Conferences.Google ScholarGoogle Scholar
  45. [45] He T., Gao L., Song J., et al. 2020. SNEQ: Semi-supervised attributed network embedding with attention-based quantisation. In Proceedings of the AAAI Conference on Artificial Intelligence. 4091–4098.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Variational Graph Autoencoder with Adversarial Mutual Information Learning for Network Representation Learning

          Recommendations

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in

          Full Access

          • Published in

            cover image ACM Transactions on Knowledge Discovery from Data
            ACM Transactions on Knowledge Discovery from Data  Volume 17, Issue 3
            April 2023
            379 pages
            ISSN:1556-4681
            EISSN:1556-472X
            DOI:10.1145/3583064
            Issue’s Table of Contents

            Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

            Publisher

            Association for Computing Machinery

            New York, NY, United States

            Publication History

            • Published: 20 March 2023
            • Online AM: 22 August 2022
            • Accepted: 31 July 2022
            • Revised: 23 July 2022
            • Received: 29 January 2022
            Published in tkdd Volume 17, Issue 3

            Permissions

            Request permissions about this article.

            Request Permissions

            Check for updates

            Qualifiers

            • research-article

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader

          Full Text

          View this article in Full Text.

          View Full Text

          HTML Format

          View this article in HTML Format .

          View HTML Format