{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:13:12Z","timestamp":1777453992287,"version":"3.51.4"},"reference-count":44,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China NSFC","doi-asserted-by":"crossref","award":["61976065"],"award-info":[{"award-number":["61976065"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Guizhou TalentsGrowth Foundation of Science and Technology","award":["No.KY[2019]201"],"award-info":[{"award-number":["No.KY[2019]201"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.3004448","type":"journal-article","created":{"date-parts":[[2020,6,23]],"date-time":"2020-06-23T20:20:52Z","timestamp":1592943652000},"page":"117146-117158","source":"Crossref","is-referenced-by-count":9,"title":["Hamming Distance Encoding Multihop Relation Knowledge Graph Completion"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6155-7043","authenticated-orcid":false,"given":"Panfeng","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yisong","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Quan","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yi","family":"Fan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Renyan","family":"Feng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/W19-4313"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/W15-4007"},{"key":"ref33","first-page":"1112","article-title":"Knowledge graph embedding by translating on hyperplanes","author":"wang","year":"2014","journal-title":"Proc 28th AAAI Conf Artif Intell"},{"key":"ref32","first-page":"3111","article-title":"Distributed representations of words and phrases and their compositionality","author":"mikolov","year":"2013","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref31","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":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2015.2483592"},{"key":"ref37","first-page":"3788","article-title":"End-to-end differentiable proving","author":"rockt\u00e4schel","year":"2017","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref36","article-title":"On approximate reasoning capabilities of low-rank vector spaces","author":"bouchard","year":"2015","journal-title":"Proc AAAI Spring Symp"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1002\/cfg.255"},{"key":"ref34","first-page":"1950","article-title":"Dimensionality of nations project: Dyadic foreign conflict variables","author":"rummel","year":"1992","journal-title":"Int J Genomics"},{"key":"ref10","first-page":"3812","article-title":"Bernoulli embeddings for graphs","author":"misra","year":"2018","journal-title":"Proc 32nd AAAI Conf Artif Intell Innov Appl Artif Intell 8th AAAI Symp Educ Adv Artif Intell"},{"key":"ref40","article-title":"Go for a walk and arrive at the answer: Reasoning over paths in knowledge bases using reinforcement learning","author":"das","year":"2018","journal-title":"Proc Int Conf Learn Represent"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/BF02310791"},{"key":"ref12","first-page":"1","article-title":"Foundations of the PARAFAC procedure: Models and conditions for an ‘explanatory’ multi-modal factor analysis","volume":"16","author":"harshman","year":"1970","journal-title":"UCLA Work Papers Phonet"},{"key":"ref13","article-title":"Models for analysis of asymmetrical relationships among N objects or stimuli","author":"harshman","year":"1978","journal-title":"Proc Joint Meeting of the Psychometric Society and the Society for Mathematical Psychology"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289464"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2007.54"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1137\/07070111X"},{"key":"ref17","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":"ref18","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/W17-2608"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.websem.2019.01.004"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1950.tb00463.x"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2787787"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D19-1522"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.12.032"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2566486.2568032"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88682-2_24"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P17-1132"},{"key":"ref8","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":"ref7","first-page":"640","article-title":"Type-constrained representation learning in knowledge graphs","author":"krompa\u00df","year":"2015","journal-title":"Proc 14th Int Semantic Web Conf"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2766634"},{"key":"ref9","first-page":"4284","article-title":"Simple embedding for link prediction in knowledge graphs","author":"kazemi","year":"2018","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2807442"},{"key":"ref20","first-page":"381","article-title":"Learning systems of concepts with an infinite relational model","author":"kemp","year":"2006","journal-title":"Proc 21st Nat Conf Artif Intell 18th Innov Appl Artif Intell Conf"},{"key":"ref22","first-page":"1821","article-title":"Modelling relational data using Bayesian clustered tensor factorization","author":"sutskever","year":"2009","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04930-9_14"},{"key":"ref42","article-title":"Differentiable reasoning on large knowledge bases and natural language","author":"minervini","year":"2019","journal-title":"arXiv 1912 10824"},{"key":"ref24","first-page":"2168","article-title":"Analogical inference for multi-relational embeddings","volume":"70","author":"liu","year":"2017","journal-title":"Proc 34th Int Conf Mach Learn"},{"key":"ref41","first-page":"2319","article-title":"Differentiable learning of logical rules for knowledge base reasoning","author":"yang","year":"2017","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref23","first-page":"1955","article-title":"Holographic embeddings of knowledge graphs","author":"nickel","year":"2016","journal-title":"Proc 13th AAAI Conf Artif Intell"},{"key":"ref44","article-title":"Inductive relation prediction by subgraph reasoning","author":"teru","year":"2019","journal-title":"arXiv 1911 06962"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2754499"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-00671-6_1"},{"key":"ref25","first-page":"4735","article-title":"Knowledge graph completion via complex tensor factorization","volume":"18","author":"trouillon","year":"2017","journal-title":"J Mach Learn Res"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09123330.pdf?arnumber=9123330","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T01:09:38Z","timestamp":1641949778000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9123330\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":44,"URL":"https:\/\/doi.org\/10.1109\/access.2020.3004448","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]}}}