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

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

Liang, Ke, Liu, Yue, Zhou, Sihang, Tu, Wenxuan, Wen, Yi, Yang, Xihong, Dong, Xiangjun, Liu, Xinwang · 2024 · IEEE Transactions on Knowledge and Data Engineering

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.

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

Integrity signals

Registry

Crossref · 10.1109/tkde.2023.3282989

Cites

15 of 15 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.

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.

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

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?

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 15 references

Research works printed but not linked: 65

  1. 10.1109/TKDE.2019.2893920 · DOI
  2. 10.1109/TKDE.2020.2981333 · DOI · Paper page
  3. 10.1609/aaai.v36i7.20700 · DOI · Paper page
  4. bordes, 2013, Translating embeddings for modeling multi-relational data, Proc Adv Neural Inf Process Syst, 2787
  5. zhu, 2020, Deep graph contrastive representation learning, Proc ICML Workshop Graph Representation Learn Beyond, 1
  6. 10.18653/v1/2022.findings-acl.276 · DOI
  7. 10.1609/aaai.v36i7.20726 · DOI · Paper page
  8. you, 2020, Graph contrastive learning with augmentations, Adv Neural Inf Process Syst, 33, 5812
  9. 10.1609/aaai.v35i8.16850 · DOI · Paper page
  10. zhang, 2019, Quaternion knowledge graph embeddings, Proc Adv Neural Inf Process Syst, 2735
  11. 10.1609/aaai.v34i03.5701 · DOI · Paper page
  12. shervashidze, 2011, Weisfeiler-lehman graph kernels, J Mach Learn Res, 12, 2539
  13. 10.1145/2254129.2254168 · DOI · Paper page
  14. hjelm, 2018, Learning deep representations by mutual information estimation and maximization, Proc Int Conf Learn Representations
  15. hassani, 2020, Contrastive multi-view representation learning on graphs, Proc Int Conf Mach Learn, 4116
  16. paszke, 2019, Pytorch: An imperative style, high-performance deep learning library, Proc Adv Neural Inf Process Syst, 8024
  17. 10.1007/978-3-642-40988-2_39 · DOI
  18. 10.1007/978-3-319-46547-0_20 · DOI
  19. 10.1109/TKDE.2023.3268215 · doi:10.1109/tkde.2023.3268215
  20. 10.1109/CVPR46437.2021.01505 · DOI
  21. 10.18653/v1/D17-1060 · DOI · Paper page
  22. 10.18653/v1/2021.acl-long.181 · DOI
  23. 10.18653/v1/D15-1174 · DOI · Paper page
  24. chen, 2020, A simple framework for contrastive learning of visual representations, Proc Int Conf Mach Learn, 1597
  25. 10.1007/978-3-642-30284-8_56 · DOI
  26. 10.1109/TKDE.2020.2968523 · doi:10.1109/tkde.2020.2968523
  27. 10.1007/978-3-540-76298-0_5 · DOI
  28. velickovic, 2019, Deep graph infomax, Proc Int Conf Learn Representations (Poster), 1
  29. 10.1155/2021/5294627 · DOI
  30. 10.18653/v1/2020.acl-main.712 · DOI
  31. 10.1007/s10044-023-01142-2 · DOI
  32. 10.1109/TKDE.2021.3060755 · DOI
  33. 10.1109/TKDE.2021.3059506 · DOI
  34. teru, 2020, Inductive relation prediction by subgraph reasoning, Proc Int Conf Mach Learn, 9448
  35. zhang, 2020, Duality-induced regularizer for tensor factorization based knowledge graph completion, Adv Neural Inf Process Syst, 33, 21604
  36. 10.3233/SW-180317 · DOI · Paper page
  37. 10.1145/3442381.3449925 · DOI
  38. 10.1609/aaai.v30i1.10089 · DOI · Paper page
  39. ermolov, 2021, Whitening for self-supervised representation learning, Proc Int Conf Mach Learn, 3015
  40. 10.1109/CVPR52688.2022.01612 · DOI
  41. 10.1145/3485447.3512104 · DOI · Paper page
  42. 10.1016/j.knosys.2021.107813 · DOI
  43. 10.1109/TKDE.2020.3028705 · DOI · Paper page
  44. chuang, 2020, Debiased contrastive learning, Adv Neural Inf Process Syst, 33, 8765
  45. 10.24963/ijcai.2021/473 · DOI · Paper page
  46. 10.24963/ijcai.2021/317 · DOI
  47. 10.1145/3503161.3548388 · DOI · Paper page
  48. 10.1145/3477495.3532009 · DOI · Paper page
  49. 10.1145/3178876.3186175 · DOI · Paper page
  50. ren, 2021, LEGO: Latent execution-guided reasoning for multi-hop question answering on knowledge graphs, Proc Int Conf Mach Learn, 8959
  51. 10.1609/aaai.v34i05.6508 · DOI · Paper page
  52. xia, 2022, Progcl: Rethinking hard negative mining in graph contrastive learning, Proc Int Conf Mach Learn, 24332
  53. 10.24963/ijcai.2021/473 · DOI · Paper page
  54. kalantidis, 2020, Hard negative mixing for contrastive learning, Adv Neural Inf Process Syst, 33, 21798
  55. 10.18653/v1/P19-1466 · DOI
  56. 10.1007/978-3-319-93417-4_38 · DOI · Paper page
  57. 10.1145/3485447.3512156 · DOI · Paper page
  58. 10.1109/TKDE.2020.3014089 · DOI
  59. nickel, 2011, A three-way model for collective learning on multi-relational data, Proc Int Conf Mach Learn, 809
  60. 10.1145/3442381.3449802 · DOI · Paper page
  61. 10.1007/s10489-021-03102-x · DOI
  62. 10.18653/v1/2022.acl-long.295 · DOI · Paper page
  63. 10.1609/aaai.v37i9.26285 · DOI
  64. you, 2021, Graph contrastive learning automated, Proc Int Conf Mach Learn, 12121
  65. suresh, 2021, Adversarial graph augmentation to improve graph contrastive learning, Adv Neural Inf Process Syst, 34, 15920

Cited by

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
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.