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

Network Representation Learning: A Survey

Open access
Zhang, Daokun, Yin, Jie, Zhu, Xingquan, Zhang, Chengqi·2020·IEEE Transactions on Big Data

Abstract

With the widespread use of information technologies, information networks are becoming increasingly popular to capture complex relationships across various disciplines, such as social networks, citation networks, telecommunication networks, and biological networks. Analyzing these networks sheds light on different aspects of social life such as the structure of societies, information diffusion, and communication patterns. In reality, however, the large scale of information networks often makes network analytic tasks computationally expensive or intractable. Network representation learning has been recently proposed as a new learning paradigm to embed network vertices into a low-dimensional vector space, by preserving network topology structure, vertex content, and other side information. This facilitates the original network to be easily handled in the new vector space for further analysis. In this survey, we perform a comprehensive review of the current literature on network representation learning in the data mining and machine learning field. We propose new taxonomies to categorize and summarize the state-of-the-art network representation learning techniques according to the underlying learning mechanisms, the network information intended to preserve, as well as the algorithmic designs and methodologies. We summarize evaluation protocols used for validating network representation learning including published benchmark datasets, evaluation methods, and open source algorithms. We also perform empirical studies to compare the performance of representative algorithms on common datasets, and analyze their computational complexity. Finally, we suggest promising research directions to facilitate future study.

Integrity signals

Registry

Crossref · 10.1109/tbdata.2018.2850013

Cites

130 of 130 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Zhang, D., Yin, J., Zhu, X., & Zhang, C.
Affiliations
  • University of Technology Sydney (AU)
  • The University of Sydney (AU)
Venue
IEEE Transactions on Big Data
Published
2020-03-01
Volume
6
Issue
1
Pages
3-28
ISSN
  • 2332-7790 (ISSN-L)
  • 2372-2096
OpenAlex
W2963512530
Cited by
714
References
130
Citations by year
2026: 33 · 2025: 72 · 2024: 74 · 2023: 110 · 2022: 117 · 2021: 115 · 2020: 108 · 2019: 68 · 2018: 17
FWCI
43.39
Type
journal article
Language
en
Open access
Locations
  • IEEE Transactions on Big Data (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • UTS ePRESS (University of Technology Sydney) (submittedVersion)
  • arXiv (Cornell University)
Funders
  • National Science Foundation (IIS-1763452)
  • Australian Research Council (LP160100630, DP180100966)
  • China Scholarship Council (201506300082)
  • Data61
  • Commonwealth Scientific and Industrial Research Organisation
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
network representation learning, node embeddings, information networks, social networks, citation networks, biological networks, network topology preservation, side information, benchmark dataset, evaluation protocol, computational complexity

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