{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T19:06:52Z","timestamp":1775329612888,"version":"3.50.1"},"reference-count":46,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"National Key Research and Development Program of China","award":["2018YFB1402600"],"award-info":[{"award-number":["2018YFB1402600"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/access.2021.3055529","type":"journal-article","created":{"date-parts":[[2021,1,29]],"date-time":"2021-01-29T20:56:26Z","timestamp":1611953786000},"page":"20840-20849","source":"Crossref","is-referenced-by-count":61,"title":["RAGAT: Relation Aware Graph Attention Network for Knowledge Graph Completion"],"prefix":"10.1109","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1120-6584","authenticated-orcid":false,"given":"Xiyang","family":"Liu","sequence":"first","affiliation":[{"name":"School of Software, Beihang University, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3113-6552","authenticated-orcid":false,"given":"Huobin","family":"Tan","sequence":"additional","affiliation":[{"name":"School of Software, Beihang University, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7471-483X","authenticated-orcid":false,"given":"Qinghong","family":"Chen","sequence":"additional","affiliation":[{"name":"School of Software, Beihang University, Beijing, China"}]},{"given":"Guangyan","family":"Lin","sequence":"additional","affiliation":[{"name":"School of Software, Beihang University, Beijing, China"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2950230"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P19-1431"},{"key":"ref33","first-page":"1","article-title":"Semi-supervised classification with graph convolutional networks","author":"kipf","year":"2017","journal-title":"Proc 5th Int Conf Learn Represent"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/N19-1226"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/N19-1103"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/N18-2053"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/3360901.3364441"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.acl-main.489"},{"key":"ref35","first-page":"1","article-title":"Graph attention networks","author":"velickovic","year":"2018","journal-title":"Proc 6th Int Conf Learn Represent"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D17-1159"},{"key":"ref10","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":"ref40","first-page":"5998","article-title":"Attention is all you need","author":"vaswani","year":"2017","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P16-1219"},{"key":"ref12","first-page":"1112","article-title":"Knowledge graph embedding by translating on hyperplanes","author":"wang","year":"2014","journal-title":"Proc 28th Conf Artif Intell"},{"key":"ref13","first-page":"2181","article-title":"Learning entity and relation embeddings for knowledge graph completion","author":"lin","year":"2015","journal-title":"Proc 29th Conf Artif Intell"},{"key":"ref14","first-page":"809","article-title":"A three-way model for collective learning on multi-relational data","author":"nickel","year":"2011","journal-title":"Proc 28th Int Conf Mach Learn"},{"key":"ref15","first-page":"1","article-title":"Embedding entities and relations for learning and inference in knowledge bases","author":"yang","year":"2015","journal-title":"Proc 3rd Int Conf Learn Represent"},{"key":"ref16","first-page":"1955","article-title":"Holographic embeddings of knowledge graphs","author":"nickel","year":"2016","journal-title":"Proc 30th Conf Artif Intell"},{"key":"ref17","first-page":"2071","article-title":"Complex embeddings for simple link prediction","volume":"48","author":"trouillon","year":"2016","journal-title":"Proc 33rd Int Conf Int Conf Mach Learn (ICML)"},{"key":"ref18","first-page":"926","article-title":"Reasoning with neural tensor networks for knowledge base completion","author":"socher","year":"2013","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref19","first-page":"1","article-title":"Probabilistic reasoning via deep learning: Neural association models","volume":"abs 1603 7704","author":"liu","year":"2016","journal-title":"CoRR"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242667"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D15-1082"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/219717.219748"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/3289600.3291014"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/D14-1067"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-76298-0_52"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i03.5694"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2015.7178992"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939673"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376746"},{"key":"ref1","first-page":"1","author":"singhal","year":"2012","journal-title":"Introducing the Knowledge Graph Things Not Strings"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623623"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i03.5693"},{"key":"ref20","first-page":"1811","article-title":"Convolutional 2D knowledge graph embeddings","author":"dettmers","year":"2018","journal-title":"Proc 32nd Conf Artif Intell"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i03.5665"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33013060"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-93417-4_38"},{"key":"ref42","first-page":"1","article-title":"Rotate: Knowledge graph embedding by relational rotation in complex space","author":"sun","year":"2019","journal-title":"Proc 7th Int Conf Learn Represent"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/574"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D15-1174"},{"key":"ref23","first-page":"1263","article-title":"Neural message passing for quantum chemistry","volume":"70","author":"gilmer","year":"2017","journal-title":"Proc 34th Int Conf Mach Learn"},{"key":"ref44","first-page":"1","article-title":"Adam: A method for stochastic optimization","author":"kingma","year":"2015","journal-title":"Proc 3rd Int Conf Learn Represent"},{"key":"ref26","first-page":"1","article-title":"Composition-based multi-relational graph convolutional networks","author":"vashishth","year":"2020","journal-title":"Proc 8th Int Conf Learn Represent"},{"key":"ref43","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":"ref25","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P19-1466"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9312710\/09340326.pdf?arnumber=9340326","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,8]],"date-time":"2022-09-08T20:14:12Z","timestamp":1662668052000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9340326\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":46,"URL":"https:\/\/doi.org\/10.1109\/access.2021.3055529","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]}}}