Cited by 188Advanced Graph Neural NetworksComplex Network Analysis TechniquesGraph Theory and Algorithms

Learning Deep Network Representations with Adversarially Regularized Autoencoders

Open access
Yu, Wenchao, Zheng, Cheng, Cheng, Wei, Aggarwal, Charu C., Song, Dongjin, Zong, Bo, Chen, Haifeng, Wang, Wei·2018·Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining

Abstract

The problem of network representation learning, also known as network embedding, arises in many machine learning tasks assuming that there exist a small number of variabilities in the vertex representations which can capture the "semantics" of the original network structure. Most existing network embedding models, with shallow or deep architectures, learn vertex representations from the sampled vertex sequences such that the low-dimensional embeddings preserve the locality property and/or global reconstruction capability. The resultant representations, however, are difficult for model generalization due to the intrinsic sparsity of sampled sequences from the input network. As such, an ideal approach to address the problem is to generate vertex representations by learning a probability density function over the sampled sequences. However, in many cases, such a distribution in a low-dimensional manifold may not always have an analytic form. In this study, we propose to learn the network representations with adversarially regularized autoencoders (NetRA). NetRA learns smoothly regularized vertex representations that well capture the network structure through jointly considering both locality-preserving and global reconstruction constraints. The joint inference is encapsulated in a generative adversarial training process to circumvent the requirement of an explicit prior distribution, and thus obtains better generalization performance. We demonstrate empirically how well key properties of the network structure are captured and the effectiveness of NetRA on a variety of tasks, including network reconstruction, link prediction, and multi-label classification.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/3219819.3220000

Cites

44 of 44 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 5

  1. Martin Arjovsky, Soumith Chintala, and Léon Bottou. 2017. Wasserstein genera- tive adversarial networks. In ICML. 214-223.
  2. Michaël Defferrard, Xavier Bresson, and Pierre Vandergheynst. 2016. Convolu- tional neural networks on graphs with fast localized spectral filtering. In NIPS. 3844-3852.
  3. Ian Goodfellow, Jean Pouget-Abadie, Mehdi Mirza, Bing Xu, David Warde-Farley, Sherjil Ozair, Aaron Courville, and Yoshua Bengio. 2014. Generative adversarial nets. In NIPS. 2672-2680.
  4. Leonardo F.R. Ribeiro, Pedro H.P. Saverese, and Daniel R. Figueiredo. 2017. Struc2Vec: Learning Node Representations from Structural Identity. In KDD. ACM, 385-394.
  5. Daixin Wang, Peng Cui, and Wenwu Zhu. 2016. Structural deep network embed- ding. In KDD. ACM, 1225-1234.

Cited by

Sorted by citations

Authors
Yu, W., Zheng, C., Cheng, W., Aggarwal, C. C., Song, D., Zong, B., Chen, H., & Wang, W.
Affiliations
  • University of California, Los Angeles (US)
  • NEC Laboratories America, Princeton, NJ, USA
  • IBM Research AI, Yorktown Height, NY, USA
Venue
Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining
Publisher
ACM
Published
2018-07-19
Pages
2663-2671
OpenAlex
W2808987817
Cited by
188
References
40
Citations by year
2026: 6 · 2025: 8 · 2024: 15 · 2023: 19 · 2022: 30 · 2021: 42 · 2020: 38 · 2019: 26 · 2018: 4
FWCI
11.23
Type
conference paper
Language
en
Open access
Locations
ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) (publishedVersion)
Funders
  • National Institutes of Health (U01HG008488, R01GM115833, U54GM114833)
  • National Science Foundation (IIS-1313606)
  • Army Research Laboratory (W911NF-09-2-0053)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Advanced Graph Neural Networks
  • Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Complex Network Analysis Techniques
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Graph Theory and Algorithms
Keywords
graph embedding, network representation learning, adversarial regularization, autoencoder, generative adversarial training, local structure preservation, global reconstruction, vertex representation, link prediction, network inference, multi-label classification

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