Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 510

The DOI matches its Crossref record; 161 of the 161 references it cites were found in a registry or an index.

Graph Self-Supervised Learning: A Survey

Open access
Liu, Yixin, Jin, Ming, Pan, Shirui, Zhou, Chuan, Zheng, Yu, Xia, Feng, Yu, Philip·2022·IEEE Transactions on Knowledge and Data Engineering

Abstract

Deep learning on graphs has attracted significant interests recently. However, most of the works have focused on (semi-) supervised learning, resulting in shortcomings including heavy label reliance, poor generalization, and weak robustness. To address these issues, self-supervised learning (SSL), which extracts informative knowledge through well-designed pretext tasks without relying on manual labels, has become a promising and trending learning paradigm for graph data. Different from SSL on other domains like computer vision and natural language processing, SSL on graphs has an exclusive background, design ideas, and taxonomies. Under the umbrella of graph self-supervised learning, we present a timely and comprehensive review of the existing approaches which employ SSL techniques for graph data. We construct a unified framework that mathematically formalizes the paradigm of graph SSL. According to the objectives of pretext tasks, we divide these approaches into four categories: generation-based, auxiliary property-based, contrast-based, and hybrid approaches. We further describe the applications of graph SSL across various research fields and summarize the commonly used datasets, evaluation benchmark, performance comparison and open-source codes of graph SSL. Finally, we discuss the remaining challenges and potential future directions in this research field.

Overview

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.1109/tkde.2022.3172903

Cites

161 of 161 references verified0 citation errors · 0 not checkable

Statistics

Verification

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.

Citations

Cites

Show all 161 references

Research works printed but not linked: 15

  1. karypis, 1995, Multilevel graph partitioning schemes, Proc Int Conf Parallel Process, 113
  2. 10.1109/ICCV.2019.00662 · DOI
  3. xu, 2019, How powerful are graph neural networks?, Proc Int Conf Learn Representations, 1
  4. 10.1609/aaai.v35i18.17986 · doi:10.1609/aaai.v35i18.17986
  5. jaiswal, 2021, A survey on contrastive self-supervised learning, Technol, 9
  6. sun, 2020, InfoGraph: Unsupervised and semi-supervised graph-level representation learning via mutual information maximization, Proc Int Conf Learn Representations, 1
  7. robinson, 2021, Contrastive learning with hard negative samples, Proc Int Conf Learn Representations, 1
  8. shchur, 2018, Pitfalls of graph neural network evaluation, Proc Int Conf Neural Inf Process Syst Workshop, 1
  9. wang, 2020, Haar graph pooling, Proc Int Conf Mach Learn, 9952
  10. verma, 2021, Towards domain-agnostic contrastive learning, Proc Int Conf Mach Learn, 10 530
  11. hu, 2020, Open Graph Benchmark: Datasets for machine learning on graphs, Proc Int Conf Neural Inf Process, 22 118
  12. kipf, 2017, Semi-supervised classification with graph convolutional networks, Proc Int Conf Learn Representations, 1
  13. 10.1109/IJCNN52387.2021.9533715 · doi:10.1109/ijcnn52387.2021.9533715
  14. ren, 2020, HDGI: An unsupervised graph neural network for representation learning in heterogeneous graph, Proc Conf Assoc Advance Artif Intell Workshop, 1
  15. 10.1109/TKDE.2021.3101227 · doi:10.1109/tkde.2021.3101227

Cited by

See all 510

Metadata

Authors
Liu, Y., Jin, M., Pan, S., Zhou, C., Zheng, Y., Xia, F., & Yu, P.
Venue
IEEE Transactions on Knowledge and Data Engineering
Published
2022
Pages
1-1
ISSN
  • 1041-4347 (ISSN-L)
  • 1558-2191
  • 2326-3865
OpenAlex
W3134210100
Cited by
510
References
161
FWCI
36.84
Type
journal article
Language
en
Open access
green
Funders
  • Australian Research Council (FT210100097)
  • National Science Foundation (III-1763325, III-1909323, III-2106758, SaTC-1930941)

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Graph Self-Supervised Learning: A Survey. https://app.cochat.ai/papers/10.1109/tkde.2022.3172903
The paper
Liu, Y., Jin, M., Pan, S., Zhou, C., Zheng, Y., Xia, F., & Yu, P. (2022). Graph Self-Supervised Learning: A Survey. IEEE Transactions on Knowledge and Data Engineering. https://doi.org/10.1109/tkde.2022.3172903

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.