skip to main content
research-article

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

Published: 20 March 2023 Publication History

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

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

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

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 for this article.

Check for updates

Author Tags

  1. Network representation
  2. variational graph auto-encoder
  3. adversarial learning
  4. mutual information maximization

Qualifiers

  • Research-article

Funding Sources

  • Natural Science Foundation of Guangdong Province
  • Science and Technology Program of Guangzhou City

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)287
  • Downloads (Last 6 weeks)18
Reflects downloads up to 03 Feb 2025

Other Metrics

Citations

Cited By

View all

View Options

Login options

Full Access

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Full Text

View this article in Full Text.

Full Text

HTML Format

View this article in HTML Format.

HTML Format

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media