The DOI matches its Crossref record; 66 of the 66 references it cites were found in a registry or an index.
Learning Graph Embedding With Adversarial Training Methods
Open accessAbstract
Graph embedding aims to transfer a graph into vectors to facilitate subsequent graph-analytics tasks like link prediction and graph clustering. Most approaches on graph embedding focus on preserving the graph structure or minimizing the reconstruction errors for graph data. They have mostly overlooked the embedding distribution of the latent codes, which unfortunately may lead to inferior representation in many cases. In this article, we present a novel adversarially regularized framework for graph embedding. By employing the graph convolutional network as an encoder, our framework embeds the topological information and node content into a vector representation, from which a graph decoder is further built to reconstruct the input graph. The adversarial training principle is applied to enforce our latent codes to match a prior Gaussian or uniform distribution. Based on this framework, we derive two variants of the adversarial models, the adversarially regularized graph autoencoder (ARGA) and its variational version, and adversarially regularized variational graph autoencoder (ARVGA), to learn the graph embedding effectively. We also exploit other potential variations of ARGA and ARVGA to get a deeper understanding of our designs. Experimental results that compared 12 algorithms for link prediction and 20 algorithms for graph clustering validate our solutions.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Efficient Estimation of Word Representations in Vector Space
Mikolov, T., Chen, K., Corrado, G., & Dean, J. (2013) · arXiv · doi:10.48550/arxiv.1301.3781 · Cited by 26,568
Auto-Encoding Variational Bayes
Kingma, D. P., & Welling, M. (2013) · arXiv · doi:10.48550/arxiv.1312.6114 · Cited by 20,067
Labaca-Castro, R. (2023) · Machine Learning under Malware Attack · doi:10.1007/978-3-658-40442-0_9 · Cited by 19,272
GAN(Generative Adversarial Nets)
(2017) · Journal of Japan Society for Fuzzy Theory and Intelligent Informatics · doi:10.3156/jsoft.29.5_177_2 · Cited by 19,270
Unsupervised representation learning with deep convolutional generative adversarial networks
Radford, A., Metz, L., & Chintala, S. (2015) · arXiv · doi:10.48550/arxiv.1511.06434 · Cited by 12,235
A Comprehensive Survey on Graph Neural Networks
Wu, Z., Pan, S., Chen, F., Long, G., Zhang, C., & Yu, P. S. (2021) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2020.2978386 · Cited by 11,000 · cited 1×
“Deep-learning approaches, especially the autoencoder-based methods, are also studied for graph embedding (a most upto-date survey on the graph neural networks can be found here [22]).”
MethodSelf-citationnode2vec: Scalable Feature Learning for Networks
Grover, A., & Leskovec, J. (2016) · Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2939672.2939754 · Cited by 10,926 · cited 3×
“Specifically, Grover and Leskovec [15] proposed a biased random walks approach, node2vec, which employs both breadth-first sampling (BFS) and depth-first sampling (DFS) strategies to generate random walk sequences for network embedding.”
BackgroundMethodDeepWalk: online learning of social representations
Perozzi, B., Al-Rfou, R., & Skiena, S. (2014) · Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2623330.2623732 · Cited by 10,123
LINE: Large-scale Information Network Embedding
Tang, J., Qu, M., Wang, M., Zhang, M., Yan, J., & Mei, Q. (2015) · Proceedings of the 24th International Conference on World Wide Web · doi:10.1145/2736277.2741093 · Cited by 5,416 · cited 6×
“It has been recently shown that many probabilistic algorithms including DeepWalk [14], LINE [16], node2vec [15], are equivalent to matrix factorization approaches [21], and Qiu et al.”
MethodInfluentialCollective Classification in Network Data
Sen, P., Namata, G., Bilgic, M., Getoor, L., Gallagher, B., & Eliassi‐Rad, T. (2008) · AI Magazine · doi:10.1609/aimag.v29i3.2157 · Cited by 3,293
Heterogeneous Graph Attention Network
Wang, X., Ji, H., Shi, C., Wang, B., Ye, Y., Cui, P., & Yu, P. S. (2019) · The World Wide Web Conference · doi:10.1145/3308558.3313562 · Cited by 3,191
A Comprehensive Survey on Graph Neural Networks
Wu, Z., Pan, S., Chen, F., Long, G., Zhang, C., & Yu, P. (2020) · UTS ePRESS (University of Technology Sydney) · Cited by 3,174
Self-citationStructural Deep Network Embedding
Wang, D., Cui, P., & Zhu, W. (2016) · Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2939672.2939753 · Cited by 2,845
Learning to Discover Social Circles in Ego Networks
Leskovec, J., & McAuley, J. (2012) · neural information processing systems · Cited by 2,492
A Comprehensive Survey of Graph Embedding: Problems, Techniques, and Applications
Cai, H., Zheng, V. W., & Chang, K. C.-C. (2018) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2018.2807452 · Cited by 2,034
Graph embedding techniques, applications, and performance: A survey
Goyal, P., & Ferrara, E. (2018) · Knowledge-Based Systems · doi:10.1016/j.knosys.2018.03.022 · Cited by 1,801
GraRep: Learning Graph Representations with Global Structural Information
Cao, S., Lu, W., & Xu, Q. (2015) · Proceedings of the 24th ACM International on Conference on Information and Knowledge Management · doi:10.1145/2806416.2806512 · Cited by 1,571
Identifying Resilient Communities in Road Networks: A Path-Based Embedding Approach
Wagner, C., Dodge, S., & Alizadeh, D. (2025) · Leibniz international proceedings in informatics · doi:10.4230/lipics.giscience.2025.9 · Cited by 1,543
Cui, P., Wang, X., Pei, J., & Zhu, W. (2019) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2018.2849727 · Cited by 1,274
Asymmetric Transitivity Preserving Graph Embedding
Ou, M., Cui, P., Pei, J., Zhang, Z., & Zhu, W. (2016) · Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2939672.2939751 · Cited by 1,248
Network representation learning with rich text information
Yang, C. H., Liu, Z., Zhao, D., Sun, M., & Chang, E. Y. (2015) · International Conference on Artificial Intelligence · Cited by 1,246
Heterogeneous Information Network Embedding for Recommendation
Shi, C., Hu, B., Zhao, W. X., & Yu, P. S. (2019) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2018.2833443 · Cited by 1,204
A survey of heterogeneous information network analysis
Shi, C., Li, Y., Zhang, J., Sun, Y., & Yu, P. S. (2017) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2016.2598561 · Cited by 1,112
Deep Neural Networks for Learning Graph Representations
Cao, S., Lu, W., & Xu, Q. (2016) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v30i1.10179 · Cited by 1,014
Adversarially Regularized Graph Autoencoder for Graph Embedding
Pan, S., Hu, R., Long, G., Jiang, J., Yao, L., & Zhang, C. (2018) · Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2018/362 · Cited by 929
Self-citationEnergy-based Generative Adversarial Network
Zhao, J., Mathieu, M., & LeCun, Y. (2016) · arXiv · doi:10.48550/arxiv.1609.03126 · Cited by 912 · cited 3×
“To implement the adversarial structure in learning data embedding, existing works like BiGAN [22], EBGAN [23] and ALI [24] arrive at extending the original adversarial framework with exter-nal structures for the inference, which have achieved non-negligible performance in applications, such as document retrieval [41]…”
BackgroundMethodCommunity Preserving Network Embedding
Wang, X., Cui, P., Wang, J., Pei, J., Zhu, W., & Yang, S. (2017) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v31i1.10488 · Cited by 883
Variational Graph Auto-Encoders
Kipf, T., & Welling, M. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1611.07308 · Cited by 772
Network Embedding as Matrix Factorization: Unifying DeepWalk, LINE, PTE, and node2vec
Qiu, J., Dong, Y., Ma, H., Li, J., Wang, K., & Tang, J. (2018) · Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining · doi:10.1145/3159652.3159706 · Cited by 717
Network Representation Learning: A Survey
Zhang, D., Yin, J., Zhu, X., & Zhang, C. (2020) · IEEE Transactions on Big Data · doi:10.1109/tbdata.2018.2850013 · Cited by 714
Robust Multi-View Spectral Clustering via Low-Rank and Sparse Decomposition
Xia, R., Pan, Y., Du, L., & Yin, J. (2014) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v28i1.8950 · Cited by 713
Learning Deep Representations for Graph Clustering
Tian, F., Gao, B., Cui, Q., Chen, E., & Liu, T.-Y. (2014) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v28i1.8916 · Cited by 657
GraphGAN: Graph Representation Learning With Generative Adversarial Nets
Wang, H., Wang, J., Wang, J., Zhao, M., Zhang, W., Zhang, F., Xie, X., & Guo, M. (2018) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v32i1.11872 · Cited by 653
Getoor, L. (2006) · Advanced Information and Knowledge Processing · doi:10.1007/1-84628-284-5_7 · Cited by 612
Query-driven active surveying for collective classification
Namata, G. M. S., London, B., Getoor, L. C., & Huang, B. (2012) · Mining and Learning with Graphs · Cited by 590
Adversarially Learned Inference
Dumoulin, V., Belghazi, M. I., Poole, B., Mastropietro, O., Lamb, A., Arjovsky, M., & Courville, A. C. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1606.00704 · Cited by 579
Relational Topic Models for Document Networks
Chang, J., & Blei, D. M. (2009) · Cited by 507
Label Informed Attributed Network Embedding
Huang, X., Li, J., & Hu, X. (2017) · Proceedings of the Tenth ACM International Conference on Web Search and Data Mining · doi:10.1145/3018661.3018667 · Cited by 487
Tri-party deep network representation
Pan, S., Wu, J. X., Xingquan Zhu, A., Chengqi Zhang, B., & Wang, Y. (2016) · Griffith Research Online · Cited by 479
Self-citationGraphRNN: Generating Realistic Graphs with Deep Auto-regressive Models
You, J., Ying, R., Ren, X., Hamilton, W. L., & Leskovec, J. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1802.08773 · Cited by 443
Attributed Social Network Embedding
Liao, L., He, X., Zhang, H., & Chua, T.-S. (2018) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2018.2819980 · Cited by 440
MGAE: Marginalized Graph Autoencoder for Graph Clustering
Wang, C., Pan, S., Long, G., Zhu, X., & Jiang, J. (2017) · Proceedings of the 2017 ACM on Conference on Information and Knowledge Management · doi:10.1145/3132847.3132967 · Cited by 420
Self-citationLeveraging social media networks for classification
Tang, L., & Liu, H. (2011) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-010-0210-x · Cited by 360
Attributed Network Embedding for Learning in a Dynamic Environment
Li, J., Dani, H., Hu, X., Tang, J., Chang, Y., & Liu, H. (2017) · Proceedings of the 2017 ACM on Conference on Information and Knowledge Management · doi:10.1145/3132847.3132919 · Cited by 352
HARP: Hierarchical Representation Learning for Networks
Chen, H., Perozzi, B., Hu, Y., & Skiena, S. (2018) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v32i1.11849 · Cited by 349
Adversarial Learning on Heterogeneous Information Networks
Hu, B., Fang, Y., & Shi, C. (2019) · Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining · doi:10.1145/3292500.3330970 · Cited by 230
Dai, Q., Li, Q., Tang, J., & Wang, D. (2018) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v32i1.11865 · Cited by 210
Learning Deep Network Representations with Adversarially Regularized Autoencoders
Yu, W., Zheng, C., Cheng, W., Aggarwal, C. C., Song, D., Zong, B., Chen, H., & Wang, W. (2018) · Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining · doi:10.1145/3219819.3220000 · Cited by 188 · cited 2×
“Recently, there are some studies on applying the adversarial mechanism to graphs, such as AIDW [48] and NetRA [49].”
BackgroundHigh-order Proximity Preserved Embedding For Dynamic Networks
Zhu, D., Cui, P., Zhang, Z., Pei, J., & Zhu, W. (2018) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2018.2822283 · Cited by 166
Discriminative Deep Random Walk for Network Classification
Li, J., Zhu, J., & Zhang, B. (2016) · Proceedings of the conference - Association for Computational Linguistics. Meeting · doi:10.18653/v1/p16-1095 · Cited by 165
Graph Convolutional Network Hashing
Zhou, X. S., Shen, F., Liu, L., Liu, W., Nie, L., Yang, Y., & Shen, H. T. (2018) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2018.2883970 · Cited by 148
Semi-supervised Learning on Graphs with Generative Adversarial Nets
Ding, M., Tang, J., & Zhang, J. (2018) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/3269206.3271768 · Cited by 144
Energy-based Generative Adversarial Networks
Zhao, J., Mathieu, M., & LeCun, Y. (2017) · International Conference on Learning Representations · Cited by 121
Deep Network Embedding for Graph Representation Learning in Signed Networks
Shen, X. X., & Chung, F.-L. (2018) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2018.2871503 · Cited by 116
User Profile Preserving Social Network Embedding
Zhang, D., Yin, J., Xingquan Zhu, A., & Chengqi Zhang, B. (2017) · International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2017/472 · Cited by 104
Binarized attributed network embedding
Yang, H., Pan, S., Zhang, P., Chen, L., Lian, D., & Zhang, C. (2018) · 2018 IEEE International Conference on Data Mining (ICDM) · doi:10.1109/icdm.2018.8626170 · Cited by 102
Self-citationSocial Recommendation With Evolutionary Opinion Dynamics
Xiong, F., Wang, X., Pan, S., Yang, H. T., Wang, H., & Chengqi Zhang, B. (2018) · IEEE Transactions on Systems Man and Cybernetics Systems · doi:10.1109/tsmc.2018.2854000 · Cited by 90
Self-citationAlhajj, R., & Rokne, J. G. (2014) · Springer eBooks · doi:10.1007/978-1-4614-6170-8_100636 · Cited by 72
Walklets: Multiscale Graph Embeddings for Interpretable Network Classification.Preprint
Perozzi, B., Kulkarni, V., & Skiena, S. (2016) · arXiv (Cornell University) · Cited by 70
Embedding Learning with Events in Heterogeneous Information Networks
Gui, H., Liu, J., Tao, F., Jiang, M., Norick, B., Kaplan, L., & Han, J. (2017) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2017.2733530 · Cited by 65
Shen, X., Pan, S., Liu, W., Ong, Y.-S., & Sun, Q.-S. (2018) · Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2018/493 · Cited by 57
Self-citationJoint Structure Feature Exploration and Regularization for Multi-Task Graph Classification
Pan, S., Wu, J. X., Xingquan Zhu, A., Chengqi Zhang, B., & Yu, P. S. (2015) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2015.2492567 · Cited by 53
Self-citationCogBoost: Boosting for Fast Cost-Sensitive Graph Classification
Pan, S., Wu, J. X., & Xingquan Zhu, A. (2015) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2015.2391115 · Cited by 48
Self-citationModeling documents with Generative Adversarial NetworksPreprint
Glover, J. D. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1612.09122 · Cited by 29
Joint structure feature exploration and regularization for multi-task graph classification
Pan, S., Wu, J. X., Zhuy, X., Chengqi Zhang, B., & Yuz, P. S. (2016) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2016.7498381 · Cited by 11
Self-citationChen, T., Wang, Z., Li, L., Li, D., Li, Z., Chang, X., Bian, P., Liang, G., Wang, Q., & Xie, T. (2025) · Schloss Dagstuhl – Leibniz-Zentrum für Informatik · doi:10.4230/lipics.ecoop.2025.6
Cited by
A Comprehensive Survey on Graph Neural Networks
Wu, Z., Pan, S., Chen, F., Long, G., Zhang, C., & Yu, P. S. (2021) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2020.2978386 · Cited by 11,000
“To further enforce the empirical distribution q ( Z | X , A ) approximate the prior distribution p ( Z ) , Adversarially Regularized Variational Graph Autoencoder (ARVGA) [62], [109] employs the training scheme of a generative adversarial networks (GAN) [110].”
MethodSelf-citationGraph WaveNet for Deep Spatial-Temporal Graph Modeling
Wu, Z., Pan, S., Long, G., Jiang, J., & Zhang, C. (2019) · Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2019/264 · Cited by 2,948
Self-citationA Survey on Deep Semi-Supervised Learning
Yang, X., Song, Z., King, I., & Xu, Z. (2023) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2022.3220219 · Cited by 923
Attributed Graph Clustering: A Deep Attentional Embedding Approach
Wang, C., Pan, S., Hu, R., Long, G., Jiang, J., & Zhang, C. (2019) · Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2019/509 · Cited by 573
Self-citationAnomaly Detection on Attributed Networks via Contrastive Self-Supervised Learning
Liu, Y., Li, Z., Pan, S., Gong, C., Zhou, C., & Karypis, G. (2022) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2021.3068344 · Cited by 492
Self-citation
Metadata
- Authors
- Pan, S., Hu, R., Fung, S.-F., Long, G., Jiang, J., & Zhang, C.
- Venue
- IEEE Transactions on Cybernetics
- Published
- 2020-06
- Volume
- 50
- Issue
- 6
- Pages
- 2475-2487
- ISSN
- 2168-2267 (ISSN-L)
- 2168-2275
- OpenAlex
- W2972209102
- Cited by
- 363
- References
- 66
- FWCI
- 17.96
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.