{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,14]],"date-time":"2026-07-14T04:23:16Z","timestamp":1784002996120,"version":"3.55.0"},"reference-count":94,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"National Key R&D Program of China","award":["2020AAA0107100"],"award-info":[{"award-number":["2020AAA0107100"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62276271"],"award-info":[{"award-number":["62276271"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2024,1]]},"DOI":"10.1109\/tkde.2023.3282989","type":"journal-article","created":{"date-parts":[[2023,6,12]],"date-time":"2023-06-12T18:23:39Z","timestamp":1686594219000},"page":"226-238","source":"Crossref","is-referenced-by-count":128,"title":["Knowledge Graph Contrastive Learning Based on Relation-Symmetrical Structure"],"prefix":"10.1109","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4837-455X","authenticated-orcid":false,"given":"Ke","family":"Liang","sequence":"first","affiliation":[{"name":"School of Computer, National University of Defense Technology, Changsha, Hunan, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9894-0062","authenticated-orcid":false,"given":"Yue","family":"Liu","sequence":"additional","affiliation":[{"name":"School of Computer, National University of Defense Technology, Changsha, Hunan, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1491-4594","authenticated-orcid":false,"given":"Sihang","family":"Zhou","sequence":"additional","affiliation":[{"name":"College of Intelligence Science and Technology, National University of Defense Technology, Changsha, Hunan, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1353-2968","authenticated-orcid":false,"given":"Wenxuan","family":"Tu","sequence":"additional","affiliation":[{"name":"School of Computer, National University of Defense Technology, Changsha, Hunan, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5924-1429","authenticated-orcid":false,"given":"Yi","family":"Wen","sequence":"additional","affiliation":[{"name":"School of Computer, National University of Defense Technology, Changsha, Hunan, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3260-869X","authenticated-orcid":false,"given":"Xihong","family":"Yang","sequence":"additional","affiliation":[{"name":"School of Computer, National University of Defense Technology, Changsha, Hunan, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5364-5844","authenticated-orcid":false,"given":"Xiangjun","family":"Dong","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Qilu University of Technology, Jinan, Shandong, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9066-1475","authenticated-orcid":false,"given":"Xinwang","family":"Liu","sequence":"additional","affiliation":[{"name":"School of Computer, National University of Defense Technology, Changsha, Hunan, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2019.2893920"},{"key":"ref57","article-title":"Graph barlow twins: A self-supervised representation learning framework for graphs","author":"bielak","year":"2021"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2020.2981333"},{"key":"ref56","article-title":"Improved dual correlation reduction network","author":"liu","year":"2022"},{"key":"ref15","first-page":"1","article-title":"Rotate: Knowledge graph embedding by relational rotation in complex space","author":"sun","year":"2019","journal-title":"Proc Int Conf Learn Representations"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i7.20700"},{"key":"ref14","first-page":"2787","article-title":"Translating embeddings for modeling multi-relational data","author":"bordes","year":"2013","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref58","article-title":"Large-scale representation learning on graphs via bootstrapping","author":"thakoor","year":"2021"},{"key":"ref53","first-page":"1","article-title":"Deep graph contrastive representation learning","author":"zhu","year":"2020","journal-title":"Proc ICML Workshop Graph Representation Learn Beyond"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2022.findings-acl.276"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2021.3070843"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i7.20726"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2754499"},{"key":"ref54","first-page":"5812","article-title":"Graph contrastive learning with augmentations","volume":"33","author":"you","year":"2020","journal-title":"Adv Neural Inf Process Syst"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i8.16850"},{"key":"ref16","first-page":"2735","article-title":"Quaternion knowledge graph embeddings","author":"zhang","year":"2019","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref19","first-page":"1","article-title":"Embedding entities and relations for learning and inference in knowledge bases","author":"yang","year":"2015","journal-title":"Proc Int Conf Learn Representations"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i03.5701"},{"key":"ref93","first-page":"2539","article-title":"Weisfeiler-lehman graph kernels","volume":"12","author":"shervashidze","year":"2011","journal-title":"J Mach Learn Res"},{"key":"ref92","doi-asserted-by":"publisher","DOI":"10.1145\/2254129.2254168"},{"key":"ref51","article-title":"Learning deep representations by mutual information estimation and maximization","author":"hjelm","year":"2018","journal-title":"Proc Int Conf Learn Representations"},{"key":"ref50","first-page":"4116","article-title":"Contrastive multi-view representation learning on graphs","author":"hassani","year":"2020","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref94","article-title":"R-GCN: The R could stand for random","author":"degraeve","year":"2022"},{"key":"ref91","first-page":"8024","article-title":"Pytorch: An imperative style, high-performance deep learning library","author":"paszke","year":"2019","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref90","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40988-2_39"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR46437.2021.01549"},{"key":"ref45","article-title":"Bootstrap your own latent: A new approach to self-supervised learning","author":"grill","year":"2020"},{"key":"ref89","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46547-0_20"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2023.3268215"},{"key":"ref47","article-title":"Barlow twins: Self-supervised learning via redundancy reduction","author":"zbontar","year":"2021"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR46437.2021.01505"},{"key":"ref86","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D17-1060"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2021.acl-long.181"},{"key":"ref85","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D15-1174"},{"key":"ref44","first-page":"1597","article-title":"A simple framework for contrastive learning of visual representations","author":"chen","year":"2020","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref88","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-30284-8_56"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2020.2968523"},{"key":"ref87","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-76298-0_5"},{"key":"ref49","first-page":"1","article-title":"Deep graph infomax","author":"velickovic","year":"2019","journal-title":"Proc Int Conf Learn Representations (Poster)"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1155\/2021\/5294627"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.acl-main.712"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s10044-023-01142-2"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2021.3060755"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2021.3059506"},{"key":"ref6","article-title":"Reasoning over different types of knowledge graphs: Static, temporal and multi-modal","author":"liang","year":"2022"},{"key":"ref5","first-page":"9448","article-title":"Inductive relation prediction by subgraph reasoning","author":"teru","year":"2020","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref82","first-page":"21604","article-title":"Duality-induced regularizer for tensor factorization based knowledge graph completion","volume":"33","author":"zhang","year":"2020","journal-title":"Adv Neural Inf Process Syst"},{"key":"ref81","doi-asserted-by":"publisher","DOI":"10.3233\/SW-180317"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449925"},{"key":"ref84","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v30i1.10089"},{"key":"ref83","first-page":"3015","article-title":"Whitening for self-supervised representation learning","author":"ermolov","year":"2021","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR52688.2022.01612"},{"key":"ref35","article-title":"House: Knowledge graph embedding with householder parameterization","author":"li","year":"2022"},{"key":"ref79","article-title":"Graph-MLP: Node classification without message passing in graph","author":"hu","year":"2021"},{"key":"ref34","article-title":"Are graph neural networks really helpful for knowledge graph completion?","author":"li","year":"2022"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512104"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2021.107813"},{"key":"ref36","first-page":"4289","article-title":"Simple embedding for link prediction in knowledge graphs","author":"kazemi","year":"2018","journal-title":"Proc 32nd Int Conf Neural Inf Process Syst"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2020.3028705"},{"key":"ref75","first-page":"8765","article-title":"Debiased contrastive learning","volume":"33","author":"chuang","year":"2020","journal-title":"Adv Neural Inf Process Syst"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2021\/473"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2021\/317"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/3503161.3548388"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.1145\/3477495.3532009"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2020.2970044"},{"key":"ref76","article-title":"Contrastive learning with hard negative samples","author":"robinson","year":"2020"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3178876.3186175"},{"key":"ref1","first-page":"8959","article-title":"LEGO: Latent execution-guided reasoning for multi-hop question answering on knowledge graphs","author":"ren","year":"2021","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i05.6508"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33013060"},{"key":"ref71","first-page":"24332","article-title":"Progcl: Rethinking hard negative mining in graph contrastive learning","author":"xia","year":"2022","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2021\/473"},{"key":"ref73","first-page":"21798","article-title":"Hard negative mixing for contrastive learning","volume":"33","author":"kalantidis","year":"2020","journal-title":"Adv Neural Inf Process Syst"},{"key":"ref72","first-page":"4171","article-title":"BERT: Pre-training of deep bidirectional transformers for language understanding","author":"devlin","year":"2019","journal-title":"Proc Conf North Amer Chapter Assoc Comput Linguistics Hum Lang Technol"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P19-1466"},{"key":"ref68","article-title":"An empirical study of graph contrastive learning","author":"zhu","year":"2021"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-93417-4_38"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512156"},{"key":"ref26","article-title":"Contrastive learning with graph context modeling for sparse knowledge graph completion","author":"tan","year":"2022"},{"key":"ref25","first-page":"1","article-title":"Composition-based multi-relational graph convolutional networks","author":"vashishth","year":"2020","journal-title":"Proc Int Conf Learn Representations"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2020.3014089"},{"key":"ref20","first-page":"809","article-title":"A three-way model for collective learning on multi-relational data","author":"nickel","year":"2011","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449802"},{"key":"ref63","article-title":"Graph contrastive learning with implicit augmentations","author":"liang","year":"2022"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11573"},{"key":"ref66","article-title":"Simple contrastive graph clustering","author":"liu","year":"2022"},{"key":"ref21","first-page":"2071","article-title":"Complex embeddings for simple link prediction","author":"trouillon","year":"2016","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-021-03102-x"},{"key":"ref28","article-title":"Hard sample aware network for contrastive deep graph clustering","author":"liu","year":"2022"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2022.acl-long.295"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i9.26285"},{"key":"ref60","first-page":"12121","article-title":"Graph contrastive learning automated","author":"you","year":"2021","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref62","article-title":"AutoGCL: Automated graph contrastive learning via learnable view generators","author":"yin","year":"2021"},{"key":"ref61","first-page":"15920","article-title":"Adversarial graph augmentation to improve graph contrastive learning","volume":"34","author":"suresh","year":"2021","journal-title":"Adv Neural Inf Process Syst"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/10348031\/10149041.pdf?arnumber=10149041","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,7]],"date-time":"2024-05-07T17:39:19Z","timestamp":1715103559000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10149041\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1]]},"references-count":94,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2023.3282989","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"value":"1041-4347","type":"print"},{"value":"1558-2191","type":"electronic"},{"value":"2326-3865","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,1]]}}}