{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T05:15:17Z","timestamp":1770700517941,"version":"3.49.0"},"reference-count":47,"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\/501100010193","name":"Korea Electric Power Corporation","doi-asserted-by":"publisher","award":["R18XA05"],"award-info":[{"award-number":["R18XA05"]}],"id":[{"id":"10.13039\/501100010193","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.2973923","type":"journal-article","created":{"date-parts":[[2020,2,14]],"date-time":"2020-02-14T21:15:42Z","timestamp":1581714942000},"page":"32816-32825","source":"Crossref","is-referenced-by-count":15,"title":["Reliable Knowledge Graph Path Representation Learning"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5772-7997","authenticated-orcid":false,"given":"Seungmin","family":"Seo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6273-3184","authenticated-orcid":false,"given":"Byungkook","family":"Oh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1581-917X","authenticated-orcid":false,"given":"Kyong-Ho","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","first-page":"4954","article-title":"Does william shakespeare REALLY write Hamlet? Knowledge representation learning with confidence","author":"xie","year":"2018","journal-title":"Proc AAAI"},{"key":"ref38","first-page":"2965","article-title":"Representation learning of knowledge graphs with hierarchical types","author":"xie","year":"2016","journal-title":"Proc IJCAI"},{"key":"ref33","first-page":"1859","article-title":"Knowledge base completion using embeddings and rules","author":"wang","year":"2015","journal-title":"Proc IJCAI"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P16-1124"},{"key":"ref31","first-page":"1243","article-title":"Non-parametric estimation of multiple embeddings for link prediction on dynamic knowledge graphs","author":"tay","year":"2017","journal-title":"Proc AAAI"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P16-1136"},{"key":"ref37","first-page":"2659","article-title":"Representation learning of knowledge graphs with entity descriptions","author":"xie","year":"2016","journal-title":"Proc AAAI"},{"key":"ref36","first-page":"3104","article-title":"SSP: Semantic space projection for knowledge graph embedding with text descriptions","author":"xiao","year":"2017","journal-title":"Proc AAAI"},{"key":"ref35","first-page":"2965","article-title":"TransG: A generative mixture model for knowledge graph embedding","volume":"abs 1509 5488","author":"xiao","year":"2015","journal-title":"CoRR"},{"key":"ref34","first-page":"1112","article-title":"Knowledge graph embedding by translating on hyperplanes","author":"wang","year":"2014","journal-title":"Proc AAAI"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D15-1173"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/N16-1105"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D15-1034"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1613\/jair.5013"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/P15-1009"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2638425"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D15-1038"},{"key":"ref16","first-page":"640","article-title":"Type-constrained representation learning in knowledge graphs","author":"krompa\u00e3\u00ff","year":"2015","journal-title":"Proc ISWC"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-010-5205-8"},{"key":"ref18","first-page":"529","article-title":"Random walk inference and learning in a large scale knowledge base","author":"lao","year":"2011","journal-title":"Proc EMNLP"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-018-3384-6"},{"key":"ref28","first-page":"1236","article-title":"ProjE: Embedding projection for knowledge graph completion","author":"shi","year":"2017","journal-title":"Proc AAAI"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-013-5363-6"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3271769"},{"key":"ref3","first-page":"2787","article-title":"Translating embeddings for modeling multi-relational data","author":"bordes","year":"2013","journal-title":"Proc NIPS"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/N18-1165"},{"key":"ref29","first-page":"926","article-title":"Reasoning with neural tensor networks for knowledge base completion","author":"socher","year":"2013","journal-title":"Proc NIPS"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/D14-1165"},{"key":"ref8","first-page":"161","article-title":"Go for a walk and arrive at the answer: Reasoning over paths in knowledge bases using reinforcement learning","author":"das","year":"2017","journal-title":"Proc NIPS Workshop"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/E17-1013"},{"key":"ref2","first-page":"127","article-title":"Joint learning of words and meaning representations for open-text semantic parsing","author":"bordes","year":"2012","journal-title":"Proc AISTATS"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/D14-1044"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1609\/aaai.v25i1.7917","article-title":"Learning structured embeddings of knowledge bases","author":"bordes","year":"2011","journal-title":"Proc AAAI"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2875066"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/3132847.3133095"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2797876"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/N16-1054"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2892140"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D15-1082"},{"key":"ref42","first-page":"992","article-title":"Locally adaptive translation for knowledge graph embedding","author":"jia","year":"2016","journal-title":"Proc AAAI"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2018.03.020"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D17-1186"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/P15-1016"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2759139"},{"key":"ref26","first-page":"1955","article-title":"Holographic embeddings of knowledge graphs","author":"nickel","year":"2016","journal-title":"Proc AAAI"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/3132733"},{"key":"ref25","first-page":"809","article-title":"A three-way model for collective learning on multi-relational data","author":"nickel","year":"2011","journal-title":"Proc ICML"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/08999619.pdf?arnumber=8999619","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,15]],"date-time":"2022-10-15T17:07:39Z","timestamp":1665853659000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8999619\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":47,"URL":"https:\/\/doi.org\/10.1109\/access.2020.2973923","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]}}}