{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T15:16:24Z","timestamp":1750173384423,"version":"3.37.3"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,9,18]],"date-time":"2021-09-18T00:00:00Z","timestamp":1631923200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,9,18]],"date-time":"2021-09-18T00:00:00Z","timestamp":1631923200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100012156","name":"Shenzhen Technical Project","doi-asserted-by":"publisher","award":["JCYJ20190808182805919"],"award-info":[{"award-number":["JCYJ20190808182805919"]}],"id":[{"id":"10.13039\/501100012156","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010909","name":"Young Scientists Fund","doi-asserted-by":"publisher","award":["61602013"],"award-info":[{"award-number":["61602013"]}],"id":[{"id":"10.13039\/501100010909","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2022,2]]},"DOI":"10.1007\/s00521-021-06460-2","type":"journal-article","created":{"date-parts":[[2021,9,18]],"date-time":"2021-09-18T16:02:31Z","timestamp":1631980951000},"page":"1951-1961","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Modeling path information for knowledge graph completion"],"prefix":"10.1007","volume":"34","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3220-904X","authenticated-orcid":false,"given":"Ying","family":"Shen","sequence":"first","affiliation":[]},{"given":"Dagang","family":"Li","sequence":"additional","affiliation":[]},{"given":"Du","family":"Nan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,18]]},"reference":[{"key":"6460_CR1","unstructured":"Bordes A, Usunier N, Garcia-Duran A, Weston J, Yakhnenko O (2013) Translating embeddings for modeling multi-relational data. In: Advances in neural information processing systems, pp. 2787\u20132795"},{"key":"6460_CR2","doi-asserted-by":"crossref","unstructured":"B\u00fchmann L, Lehmann J (2013) Pattern based knowledge base enrichment. In: International Semantic Web Conference. Springer, pp. 33\u201348","DOI":"10.1007\/978-3-642-41335-3_3"},{"key":"6460_CR3","unstructured":"Das R, Dhuliawala S, Zaheer M, Vilnis L, Durugkar I, Krishnamurthy A, Smola A, McCallum A (2017) Go for a walk and arrive at the answer: reasoning over paths in knowledge bases using reinforcement learning. arXiv preprint arXiv:1711.05851"},{"key":"6460_CR4","doi-asserted-by":"crossref","unstructured":"Das R, Neelakantan A, Belanger D, McCallum A (2016) Chains of reasoning over entities, relations, and text using recurrent neural networks. arXiv preprint arXiv:1607.01426","DOI":"10.18653\/v1\/E17-1013"},{"key":"6460_CR5","unstructured":"Deng Y, Li Y, Du N, Fan W, Shen Y, Lei K (2018) When truth discovery meets medical knowledge graph: estimating trustworthiness degree for medical knowledge condition. arXiv preprint arXiv:1809.10404"},{"key":"6460_CR6","doi-asserted-by":"crossref","unstructured":"Gardner M, Mitchell T (2015) Efficient and expressive knowledge base completion using subgraph feature extraction. In: Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing, pp. 1488\u20131498","DOI":"10.18653\/v1\/D15-1173"},{"key":"6460_CR7","doi-asserted-by":"publisher","first-page":"112960","DOI":"10.1016\/j.eswa.2019.112960","volume":"142","author":"Batselem Jagvaral","year":"2020","unstructured":"Jagvaral Batselem, Lee Wan-Kon, Roh Jae-Seung, Kim Min-Sung, Park Young-Tack (2020) Path-based reasoning approach for knowledge graph completion using cnn-bilstm with attention mechanism. Expert Syst Appl 142:112960","journal-title":"Expert Syst Appl"},{"key":"6460_CR8","doi-asserted-by":"crossref","unstructured":"Ji G, He S, Xu L, Liu K, Zhao J (2015) Knowledge graph embedding via dynamic mapping matrix. In: Proceedings of the 53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference on Natural Language Processing (Volume 1: Long Papers), vol\u00a01, pp. 687\u2013696","DOI":"10.3115\/v1\/P15-1067"},{"key":"6460_CR9","unstructured":"Guoliang J, Kang L, Shizhu H, Jun Z, Knowledge graph completion with adaptive sparse transfer matrix. In: AAAI, pp. 985\u2013991"},{"issue":"1","key":"6460_CR10","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/s10994-010-5205-8","volume":"81","author":"Ni Lao","year":"2010","unstructured":"Lao Ni, Cohen William W (2010) Relational retrieval using a combination of path constrained random walks. Mach Learn 81(1):53\u201367","journal-title":"Mach Learn"},{"key":"6460_CR11","unstructured":"Lao N, Mitchell T, Cohen William\u00a0W (2011) Random walk inference and learning in a large scale knowledge base. In: Proceedings of the Conference on Empirical Methods in Natural Language Processing. Association for Computational Linguistics, pp. 529\u2013539"},{"key":"6460_CR12","doi-asserted-by":"crossref","unstructured":"Lin Y, Liu Z, Luan H, Sun M, Rao S, Liu S (2015) Modeling relation paths for representation learning of knowledge bases. arXiv preprint arXiv:1506.00379","DOI":"10.18653\/v1\/D15-1082"},{"key":"6460_CR13","unstructured":"Lin Z, Feng M, dos Santos Cicero N, Yu M, Xiang B, Zhou B, Bengio Y (2017) A structured self-attentive sentence embedding. arXiv preprint arXiv:1703.03130"},{"key":"6460_CR14","doi-asserted-by":"crossref","unstructured":"Nathani D, Chauhan J, Sharma C, Kaul M (2019) Learning attention-based embeddings for relation prediction in knowledge graphs. In: Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics, pp. 4710\u20134723","DOI":"10.18653\/v1\/P19-1466"},{"key":"6460_CR15","doi-asserted-by":"crossref","unstructured":"Neelakantan A, Roth B, McCallum A (2015) Compositional vector space models for knowledge base completion. arXiv preprint arXiv:1504.06662","DOI":"10.3115\/v1\/P15-1016"},{"key":"6460_CR16","doi-asserted-by":"crossref","unstructured":"Nguyen D\u00a0Q, Sirts K, Qu L, Johnson M (2016) Stranse: a novel embedding model of entities and relationships in knowledge bases. arXiv preprint arXiv:1606.08140","DOI":"10.18653\/v1\/N16-1054"},{"key":"6460_CR17","unstructured":"Adam P, Geoff S (2007) First order reasoning on a large ontology. ESARLT 257"},{"key":"6460_CR18","doi-asserted-by":"crossref","unstructured":"Pujara J, Miao H, Getoor L, Cohen W (2013) Knowledge graph identification. In: International Semantic Web Conference. Springer, pp. 542\u2013557","DOI":"10.1007\/978-3-642-41335-3_34"},{"key":"6460_CR19","doi-asserted-by":"crossref","unstructured":"Shen Yelong, Huang P-S, Chang M-W, Gao J (2017) Modeling largescale structured relationships with shared memory for knowledge base completion. In: Proceedings of the 2nd Workshop on Representation Learning for NLP, pp. 57\u201368","DOI":"10.18653\/v1\/W17-2608"},{"issue":"1","key":"6460_CR20","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1186\/s13326-018-0188-7","volume":"9","author":"Ying Shen","year":"2018","unstructured":"Shen Ying, Chen Daoyuan, Tang Buzhou, Yang Min, Lei Kai (2018) Eapb: entropy-aware pathbased metric for ontology quality. J Biomed Semant 9(1):20","journal-title":"J Biomed Semant"},{"key":"6460_CR21","doi-asserted-by":"crossref","unstructured":"Shen Y, Ding N, Zheng H-T, Li Y, Yang M (2020) Modeling relation paths for knowledge graph completion. IEEE Trans Knowled Data Eng","DOI":"10.1109\/TKDE.2020.2970044"},{"key":"6460_CR22","first-page":"1236","volume":"17","author":"Baoxu Shi","year":"2017","unstructured":"Shi Baoxu, Weninger Tim (2017) Proje: Embedding projection for knowledge graph completion. AAAI 17:1236\u20131242","journal-title":"AAAI"},{"key":"6460_CR23","unstructured":"Socher R, Chen D, Manning C\u00a0D, Ng A (2013) Reasoning with neural tensor networks for knowledge base completion. In: Advances in neural information processing systems, pp. 926\u2013934"},{"key":"6460_CR24","unstructured":"Socher R, Huval B, Manning C\u00a0D, Ng A\u00a0Y (2012) Semantic compositionality through recursive matrixvector spaces. In: Proceedings of the 2012 joint conference on empirical methods in natural language processing and computational natural language learning. Association for Computational Linguistics, pp. 1201\u20131211"},{"key":"6460_CR25","unstructured":"Sun Z, Deng Z-H, Nie J-Y, Tang J (2019) Rotate: Knowledge graph embedding by relational rotation in complex space. In: International Conference on Learning Representations"},{"key":"6460_CR26","doi-asserted-by":"crossref","unstructured":"Toutanova K, Chen D, Pantel P, Poon H, Choudhury P, Gamon M (2015) Representing text for joint embedding of text and knowledge bases. In: Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing, pp. 1499\u20131509","DOI":"10.18653\/v1\/D15-1174"},{"key":"6460_CR27","doi-asserted-by":"crossref","unstructured":"Toutanova K, Lin V, Yih W-T, Poon H, Quirk C (2016) Compositional learning of embeddings for relation paths in knowledge base and text. In: Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), vol\u00a01, pp. 1434\u20131444","DOI":"10.18653\/v1\/P16-1136"},{"key":"6460_CR28","unstructured":"Vaswani A, Shazeer N, Parmar N, Uszkoreit J, Jones L, Gomez A\u00a0N, Kaiser \u0141, Polosukhin I (2017) Attention is all you need. In: Advances in Neural Information Processing Systems, pp. 5998\u20136008"},{"key":"6460_CR29","unstructured":"Veli\u010dkovi\u0107 P, Cucurull G, Casanova A, Romero A, Lio P, Bengio Y (2018) Graph attention networks. In: Proceedings of the International Conference on Learning Representations (ICLR)"},{"key":"6460_CR30","doi-asserted-by":"crossref","unstructured":"Wang Q, Liu J, Luo Y, Wang B, Lin C-Y (2016) Knowledge base completion via coupled path ranking. In: Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), vol\u00a01, pp. 1308\u20131318","DOI":"10.18653\/v1\/P16-1124"},{"key":"6460_CR31","unstructured":"Wang Q, Wang B, Guo L et\u00a0al (2015) Knowledge base completion using embeddings and rules. In: IJCAI, pp. 1859\u20131866"},{"key":"6460_CR32","unstructured":"Wang Z, Li J-Z (2016) Text-enhanced representation learning for knowledge graph. In: IJCAI, pp. 1293\u20131299"},{"key":"6460_CR33","doi-asserted-by":"crossref","unstructured":"Wen D, Liu Y, Yuan K, Si S, Shen Y (2017) Attention-aware pathbased relation extraction for medical knowledge graph. In: International Conference on Smart Computing and Communication. Springer, pp. 321\u2013331","DOI":"10.1007\/978-3-319-73830-7_32"},{"key":"6460_CR34","doi-asserted-by":"crossref","unstructured":"West R, Gabrilovich E, Murphy K, Sun S, Gupta R, Lin D (2014) Knowledge base completion via search based question answering. In: Proceedings of the 23rd international conference on World wide web. ACM, pp. 515\u2013526","DOI":"10.1145\/2566486.2568032"},{"key":"6460_CR35","doi-asserted-by":"crossref","unstructured":"Xu J, Chen K, Qiu X, Huang X (2016) Knowledge graph representation with jointly structural and textual encoding. arXiv preprint arXiv:1611.08661","DOI":"10.24963\/ijcai.2017\/183"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-021-06460-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-021-06460-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-021-06460-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,4]],"date-time":"2022-02-04T18:16:52Z","timestamp":1643998612000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-021-06460-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,18]]},"references-count":35,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,2]]}},"alternative-id":["6460"],"URL":"https:\/\/doi.org\/10.1007\/s00521-021-06460-2","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"type":"print","value":"0941-0643"},{"type":"electronic","value":"1433-3058"}],"subject":[],"published":{"date-parts":[[2021,9,18]]},"assertion":[{"value":"1 February 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 August 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 September 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"We wish to confirm that there are no known conflicts of interest associated with this publication and there has been no significant financial support for this work that could have influenced its outcome. We confirm that the manuscript has been read and approved by all named authors and that there are no other persons who satisfied the criteria for authorship but are not listed. We further confirm that the order of authors listed in the manuscript has been approved by all of us.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}