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 accessAbstract
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.
Integrity signals
Registry
Cites
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.
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
BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding
Devlin, J., Chang, M.-W., Lee, K., & Toutanova, K. (2018) · arXiv · doi:10.48550/arxiv.1810.04805 · Cited by 73,173
BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding
Devlin, J., Chang, M.-W., Lee, K., & Toutanova, K. (2019) · Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long and Short Papers) · doi:10.18653/v1/n19-1423 · Cited by 54,325
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
Distributed Representations of Words and Phrases and their Compositionality
Mikolov, T., Sutskever, I., Chen, K., Corrado, G., & Dean, J. (2013) · arXiv · doi:10.48550/arxiv.1310.4546 · Cited by 24,533
Reducing the dimensionality of data with neural networks
Hinton, G. E., & Salakhutdinov, R. R. (2006) · Science · doi:10.1126/science.1127647 · Cited by 20,928
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
Birds of a Feather: Homophily in Social Networks
McPherson, M., Smith-Lovin, L., & Cook, J. M. (2001) · Annual Review of Sociology · doi:10.1146/annurev.soc.27.1.415 · Cited by 18,567
Communication-Efficient Learning of Deep Networks from Decentralized Data
McMahan, H. B., Moore, E., Ramage, D., Hampson, S., & Arcas, B. A. Y. (2016) · arXiv · doi:10.48550/arxiv.1602.05629 · Cited by 14,215
Research works printed but not linked: 15
- karypis, 1995, Multilevel graph partitioning schemes, Proc Int Conf Parallel Process, 113
- 10.1109/ICCV.2019.00662 · DOI
- xu, 2019, How powerful are graph neural networks?, Proc Int Conf Learn Representations, 1
- 10.1609/aaai.v35i18.17986 · doi:10.1609/aaai.v35i18.17986
- jaiswal, 2021, A survey on contrastive self-supervised learning, Technol, 9
- sun, 2020, InfoGraph: Unsupervised and semi-supervised graph-level representation learning via mutual information maximization, Proc Int Conf Learn Representations, 1
- robinson, 2021, Contrastive learning with hard negative samples, Proc Int Conf Learn Representations, 1
- shchur, 2018, Pitfalls of graph neural network evaluation, Proc Int Conf Neural Inf Process Syst Workshop, 1
- wang, 2020, Haar graph pooling, Proc Int Conf Mach Learn, 9952
- verma, 2021, Towards domain-agnostic contrastive learning, Proc Int Conf Mach Learn, 10 530
- hu, 2020, Open Graph Benchmark: Datasets for machine learning on graphs, Proc Int Conf Neural Inf Process, 22 118
- kipf, 2017, Semi-supervised classification with graph convolutional networks, Proc Int Conf Learn Representations, 1
- 10.1109/IJCNN52387.2021.9533715 · doi:10.1109/ijcnn52387.2021.9533715
- ren, 2020, HDGI: An unsupervised graph neural network for representation learning in heterogeneous graph, Proc Conf Assoc Advance Artif Intell Workshop, 1
- 10.1109/TKDE.2021.3101227 · doi:10.1109/tkde.2021.3101227
Cited by
Improving Graph Collaborative Filtering with Neighborhood-enriched Contrastive Learning
Lin, Z., Tian, C., Hou, Y., & Zhao, W. X. (2022) · Proceedings of the ACM Web Conference 2022 · doi:10.1145/3485447.3512104 · Cited by 572
Jin, M., Koh, H. Y., Wen, Q., Zambon, D., Alippi, C., Webb, G. I., King, I., & Pan, S. (2024) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2024.3443141 · Cited by 567
Self-citationA Survey on Self-Supervised Learning: Algorithms, Applications, and Future Trends
Gui, J., Chen, T., Zhang, J., Cao, Q., Sun, Z., Luo, H., & Tao, D. (2024) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2024.3415112 · Cited by 552
Self-supervised learning for recommender systems: A survey
Yu, J., Yin, H., Xia, X., Chen, T., Li, J., & Huang, Z. (2024) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2023.3282907 · Cited by 413
Self-Supervised Learning of Graph Neural Networks: A Unified Review
Xie, Y., Xu, Z., Zhang, J., Wang, Z., & Ji, S. (2023) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2022.3170559 · Cited by 389
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
- Licence
- 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.