{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T16:11:19Z","timestamp":1777651879501,"version":"3.51.4"},"reference-count":44,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","funder":[{"DOI":"10.13039\/501100007046","name":"Wuhan University","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100007046","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/tkde.2021.3108224","type":"journal-article","created":{"date-parts":[[2021,8,30]],"date-time":"2021-08-30T21:33:11Z","timestamp":1630359191000},"page":"1-1","source":"Crossref","is-referenced-by-count":16,"title":["Knowledge Graph Completion by Jointly Learning Structural Features and Soft Logical Rules"],"prefix":"10.1109","author":[{"given":"Weidong","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rong","family":"Peng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhi","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376746"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/219717.219748"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242667"},{"key":"ref4","first-page":"1","article-title":"Toward never ending language learning","volume-title":"Proc. AAAI Spring Symp.: Learn. Reading Learn. Read","author":"Betteridge"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.3233\/SW-140134"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/P15-1128"},{"key":"ref7","article-title":"Go for a walk and arrive at the answer: Reasoning over paths in knowledge bases using reinforcement learning","author":"Das","year":"2017"},{"key":"ref8","article-title":"Question answering over freebase via attentive RNN with similarity matrix based CNN","author":"Qu","year":"2018"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.12057"},{"key":"ref10","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/j.ins.2018.02.047","article-title":"Word sense disambiguation: A complex network approach","volume":"442\/443","author":"J\u00fanior","year":"2018","journal-title":"Inf. Sci."},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1561\/1500000032"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052558"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.14778\/2732286.2732295"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.3233\/SW-160218"},{"key":"ref15","first-page":"2787","article-title":"Translating embeddings for modeling multi-relational data","volume-title":"Proc. Neural Inf. Process. Syst.","author":"Bordes"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v28i1.8870"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v29i1.9491"},{"key":"ref18","first-page":"809","article-title":"A three-way model for collective learning on multi-relational data","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Nickel"},{"key":"ref19","article-title":"Embedding entities and relations for learning and inference in knowledge bases","author":"Yang","year":"2014"},{"key":"ref20","first-page":"2071","article-title":"Complex embeddings for simple link prediction","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Trouillon"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11573"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-30493-5_52"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-93417-4_38"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33013060"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-015-0394-1"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2754499"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2950230"},{"key":"ref28","article-title":"Go for a walk and arrive at the answer: Reasoning over paths in knowledge bases using reinforcement learning","author":"Das","year":"2017"},{"key":"ref29","first-page":"6786","article-title":"M-walk: Learning to walk over graphs using monte carlo tree search","volume-title":"Proc. Neural Inf. Process. Syst.","author":"Shen"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2019.03.033"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D16-1019"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/N15-1118"},{"key":"ref33","first-page":"2319","article-title":"Differentiable learning of logical rules for knowledge base reasoning","volume-title":"Proc. Neural Inf. Process. Syst.","author":"Yang"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/W16-1309"},{"key":"ref35","first-page":"1","volume-title":"Proc. 33rd Conf. Uncertainty Artif. Intell.","author":"Minervini"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11918"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1613\/jair.1.11305"},{"key":"ref38","article-title":"Graph attention networks","volume-title":"Proc. 6th Int. Conf. Representations","author":"Velickovic"},{"key":"ref39","article-title":"Adam: A method for stochastic optimization","volume-title":"Proc. 3rd Int. Conf. Learn. Representations","author":"Kingma"},{"key":"ref40","first-page":"249","article-title":"Understanding the difficulty of training deep feedforward neural networks","volume-title":"Proc. 13th Int. Conf. Artif. Intell. Statist.","author":"Glorot"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D15-1174"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/435"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/435"},{"key":"ref44","article-title":"You CAN teach an old dog new tricks! on training knowledge graph embeddings","volume-title":"Proc. 8th Int. Conf. Learn. Representations","author":"Ruffinelli"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/4358933\/09525301.pdf?arnumber=9525301","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,11]],"date-time":"2024-01-11T22:40:42Z","timestamp":1705012842000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9525301\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":44,"URL":"https:\/\/doi.org\/10.1109\/tkde.2021.3108224","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":[[2021]]}}}