The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Knowledge Graph Contrastive Learning Based on Relation-Symmetrical Structure
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.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“However, most existing artificial intelligence (AI) models only imitate the learning procedure from experiences while ignoring the former [1], [2], [3], [4], thus making them less explainable and worse performances.”
From A Survey of Knowledge Graph Reasoning on Graph Types: Static, Dynamic, and Multi-Modal (2024) · cites this paper as [3]
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
Bootstrap Your Own Latent: A New Approach to Self-Supervised Learning
Grill, J.-B., Strub, F., Altché, F., Tallec, C., Richemond, P. H., Buchatskaya, E., Doersch, C., Pires, B. A., Guo, Z. D., Azar, M. G., et al. (2020) · arXiv · doi:10.48550/arxiv.2006.07733 · Cited by 3,846
Exploring Simple Siamese Representation Learning
Chen, X., & He, K. (2021) · 2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr46437.2021.01549 · Cited by 3,725
A Survey on Knowledge Graphs: Representation, Acquisition, and Applications
Ji, S., Pan, S., Cambria, E., Marttinen, P., & Yu, P. S. (2022) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2021.3070843 · Cited by 2,947
Knowledge Graph Embedding: A Survey of Approaches and Applications
Wang, Q., Mao, Z., Wang, B., & Guo, L. (2017) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2017.2754499 · Cited by 2,654
Convolutional 2D Knowledge Graph Embeddings
Dettmers, T., Minervini, P., Stenetorp, P., & Riedel, S. (2018) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v32i1.11573 · Cited by 2,486
Embedding Entities and Relations for Learning and Inference in Knowledge Bases
Yang, B., Yih, W.-T., He, X., Gao, J., & Deng, L. (2014) · arXiv · doi:10.48550/arxiv.1412.6575 · Cited by 2,252
Complex Embeddings for Simple Link Prediction
Trouillon, T., Welbl, J., Riedel, S., Gaussier, É., & Bouchard, G. (2016) · arXiv · doi:10.48550/arxiv.1606.06357 · Cited by 2,100
RotatE: Knowledge Graph Embedding by Relational Rotation in Complex Space
Sun, Z., Deng, Z.-H., Nie, J.-Y., & Tang, J. (2019) · arXiv · doi:10.48550/arxiv.1902.10197 · Cited by 1,414
End-to-End Structure-Aware Convolutional Networks for Knowledge Base Completion
Shang, C., Tang, Y., Huang, J., Bi, J., He, X., & Zhou, B. (2019) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v33i01.33013060 · Cited by 725
Composition-based Multi-Relational Graph Convolutional Networks
Vashishth, S., Sanyal, S., Nitin, V., & Talukdar, P. (2019) · arXiv · doi:10.48550/arxiv.1911.03082 · Cited by 581 · cited 9×
“COMPGCN [25] proposes various composition operations for triplet scoring.”
BackgroundMethodResultInfluentialA Survey of Knowledge Graph Reasoning on Graph Types: Static, Dynamic, and Multi-Modal
Liang, K., Meng, L., Liu, M., Liu, Y., Tu, W., Wang, S., Zhou, S., Liu, X., Sun, F., & He, K. (2024) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2024.3417451 · Cited by 553
Self-citationSimplE Embedding for Link Prediction in Knowledge Graphs
Kazemi, S. M., & Poole, D. (2018) · arXiv · doi:10.48550/arxiv.1802.04868 · Cited by 476
Modeling Relation Paths for Knowledge Graph Completion
Shen, Y., Ding, N., Zheng, H.-T., Li, Y., & Yang, M. (2021) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2020.2970044 · Cited by 153
Research works printed but not linked: 65
- 10.1109/TKDE.2019.2893920 · DOI
- 10.1109/TKDE.2020.2981333 · DOI · Paper page
- 10.1609/aaai.v36i7.20700 · DOI · Paper page
- bordes, 2013, Translating embeddings for modeling multi-relational data, Proc Adv Neural Inf Process Syst, 2787
- zhu, 2020, Deep graph contrastive representation learning, Proc ICML Workshop Graph Representation Learn Beyond, 1
- 10.18653/v1/2022.findings-acl.276 · DOI
- 10.1609/aaai.v36i7.20726 · DOI · Paper page
- you, 2020, Graph contrastive learning with augmentations, Adv Neural Inf Process Syst, 33, 5812
- 10.1609/aaai.v35i8.16850 · DOI · Paper page
- zhang, 2019, Quaternion knowledge graph embeddings, Proc Adv Neural Inf Process Syst, 2735
- 10.1609/aaai.v34i03.5701 · DOI · Paper page
- shervashidze, 2011, Weisfeiler-lehman graph kernels, J Mach Learn Res, 12, 2539
- 10.1145/2254129.2254168 · DOI · Paper page
- hjelm, 2018, Learning deep representations by mutual information estimation and maximization, Proc Int Conf Learn Representations
- hassani, 2020, Contrastive multi-view representation learning on graphs, Proc Int Conf Mach Learn, 4116
- paszke, 2019, Pytorch: An imperative style, high-performance deep learning library, Proc Adv Neural Inf Process Syst, 8024
- 10.1007/978-3-642-40988-2_39 · DOI
- 10.1007/978-3-319-46547-0_20 · DOI
- 10.1109/TKDE.2023.3268215 · doi:10.1109/tkde.2023.3268215
- 10.1109/CVPR46437.2021.01505 · DOI
- 10.18653/v1/D17-1060 · DOI · Paper page
- 10.18653/v1/2021.acl-long.181 · DOI
- 10.18653/v1/D15-1174 · DOI · Paper page
- chen, 2020, A simple framework for contrastive learning of visual representations, Proc Int Conf Mach Learn, 1597
- 10.1007/978-3-642-30284-8_56 · DOI
- 10.1109/TKDE.2020.2968523 · doi:10.1109/tkde.2020.2968523
- 10.1007/978-3-540-76298-0_5 · DOI
- velickovic, 2019, Deep graph infomax, Proc Int Conf Learn Representations (Poster), 1
- 10.1155/2021/5294627 · DOI
- 10.18653/v1/2020.acl-main.712 · DOI
- 10.1007/s10044-023-01142-2 · DOI
- 10.1109/TKDE.2021.3060755 · DOI
- 10.1109/TKDE.2021.3059506 · DOI
- teru, 2020, Inductive relation prediction by subgraph reasoning, Proc Int Conf Mach Learn, 9448
- zhang, 2020, Duality-induced regularizer for tensor factorization based knowledge graph completion, Adv Neural Inf Process Syst, 33, 21604
- 10.3233/SW-180317 · DOI · Paper page
- 10.1145/3442381.3449925 · DOI
- 10.1609/aaai.v30i1.10089 · DOI · Paper page
- ermolov, 2021, Whitening for self-supervised representation learning, Proc Int Conf Mach Learn, 3015
- 10.1109/CVPR52688.2022.01612 · DOI
- 10.1145/3485447.3512104 · DOI · Paper page
- 10.1016/j.knosys.2021.107813 · DOI
- 10.1109/TKDE.2020.3028705 · DOI · Paper page
- chuang, 2020, Debiased contrastive learning, Adv Neural Inf Process Syst, 33, 8765
- 10.24963/ijcai.2021/473 · DOI · Paper page
- 10.24963/ijcai.2021/317 · DOI
- 10.1145/3503161.3548388 · DOI · Paper page
- 10.1145/3477495.3532009 · DOI · Paper page
- 10.1145/3178876.3186175 · DOI · Paper page
- ren, 2021, LEGO: Latent execution-guided reasoning for multi-hop question answering on knowledge graphs, Proc Int Conf Mach Learn, 8959
- 10.1609/aaai.v34i05.6508 · DOI · Paper page
- xia, 2022, Progcl: Rethinking hard negative mining in graph contrastive learning, Proc Int Conf Mach Learn, 24332
- 10.24963/ijcai.2021/473 · DOI · Paper page
- kalantidis, 2020, Hard negative mixing for contrastive learning, Adv Neural Inf Process Syst, 33, 21798
- 10.18653/v1/P19-1466 · DOI
- 10.1007/978-3-319-93417-4_38 · DOI · Paper page
- 10.1145/3485447.3512156 · DOI · Paper page
- 10.1109/TKDE.2020.3014089 · DOI
- nickel, 2011, A three-way model for collective learning on multi-relational data, Proc Int Conf Mach Learn, 809
- 10.1145/3442381.3449802 · DOI · Paper page
- 10.1007/s10489-021-03102-x · DOI
- 10.18653/v1/2022.acl-long.295 · DOI · Paper page
- 10.1609/aaai.v37i9.26285 · DOI
- you, 2021, Graph contrastive learning automated, Proc Int Conf Mach Learn, 12121
- suresh, 2021, Adversarial graph augmentation to improve graph contrastive learning, Adv Neural Inf Process Syst, 34, 15920
Cited by
A Survey of Knowledge Graph Reasoning on Graph Types: Static, Dynamic, and Multi-Modal
Liang, K., Meng, L., Liu, M., Liu, Y., Tu, W., Wang, S., Zhou, S., Liu, X., Sun, F., & He, K. (2024) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2024.3417451 · Cited by 553
Self-citationLLMRec: Large Language Models with Graph Augmentation for Recommendation
Wei, W., Ren, X., Tang, J., Wang, Q., Su, L., Cheng, S., Wang, J., Yin, D., & Huang, C. (2024) · Proceedings of the 17th ACM International Conference on Web Search and Data Mining · doi:10.1145/3616855.3635853 · Cited by 268
Reasoning on Graphs: Faithful and Interpretable Large Language Model Reasoning
Luo, L., Li, Y.-F., Haffari, G., & Pan, S. (2023) · arXiv · doi:10.48550/arxiv.2310.01061 · Cited by 56
Metadata
- Authors
- Liang, K., Liu, Y., Zhou, S., Tu, W., Wen, Y., Yang, X., Dong, X., & Liu, X.
- Venue
- IEEE Transactions on Knowledge and Data Engineering
- Published
- 2024-01
- Volume
- 36
- Issue
- 1
- Pages
- 226-238
- ISSN
- 1041-4347
- 1558-2191
- 2326-3865
- Cited by
- 139
- References
- 15
- Licence
- Funders
- National Key R&D Program of China (2020AAA0107100)
- National Natural Science Foundation of China (62276271)
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.