{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T16:10:34Z","timestamp":1776355834996,"version":"3.51.2"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,11,20]],"date-time":"2023-11-20T00:00:00Z","timestamp":1700438400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,11,20]],"date-time":"2023-11-20T00:00:00Z","timestamp":1700438400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Vis. Comput. Ind. Biomed. Art"],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Knowledge graph\u00a0(KG) fact prediction aims to complete a KG by determining the truthfulness of predicted triples. Reinforcement learning (RL)-based approaches have been widely used for fact prediction. However, the existing approaches largely suffer from unreliable calculations on rule confidences owing to a limited number of obtained reasoning paths, thereby resulting in unreliable decisions on prediction triples. Hence, we propose a new RL-based approach named EvoPath in this study. EvoPath features a new reward mechanism based on entity heterogeneity, facilitating an agent to obtain effective reasoning paths during random walks. EvoPath also incorporates a new postwalking mechanism to leverage easily overlooked but valuable reasoning paths during RL. Both mechanisms provide sufficient reasoning paths to facilitate the reliable calculations of rule confidences, enabling EvoPath to make precise judgments about the truthfulness of prediction triples. Experiments demonstrate that EvoPath can achieve more accurate fact predictions than existing approaches.<\/jats:p>","DOI":"10.1186\/s42492-023-00150-7","type":"journal-article","created":{"date-parts":[[2023,11,20]],"date-time":"2023-11-20T03:01:44Z","timestamp":1700449304000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Reliable knowledge graph fact prediction via reinforcement learning"],"prefix":"10.1186","volume":"6","author":[{"given":"Fangfang","family":"Zhou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiapeng","family":"Mi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Beiwen","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingcheng","family":"Shi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ran","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaohui","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ying","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5418-0455","authenticated-orcid":false,"given":"Jian","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,11,20]]},"reference":[{"issue":"1","key":"150_CR1","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1186\/s40537-022-00631-1","volume":"9","author":"M Yani","year":"2022","unstructured":"Yani M, Krisnadhi AA, Budi I (2022) A better entity detection of question for knowledge graph question answering through extracting position-based patterns. J Big Data 9(1):80. https:\/\/doi.org\/10.1186\/s40537-022-00631-1","journal-title":"J Big Data"},{"issue":"5","key":"150_CR2","doi-asserted-by":"publisher","first-page":"052058","DOI":"10.1088\/1757-899X\/569\/5\/052058","volume":"569","author":"R Lu","year":"2019","unstructured":"Lu R, Cai ZP, Zhao S (2019) A survey of knowledge reasoning based on KG. IOP Conf Ser: Mater Sci Eng, 569(5):052058. https:\/\/doi.org\/10.1088\/1757-899X\/569\/5\/052058","journal-title":"IOP Conf Ser: Mater Sci Eng"},{"key":"150_CR3","doi-asserted-by":"publisher","first-page":"100497","DOI":"10.1016\/j.websem.2019.01.004","volume":"59","author":"A Padia","year":"2019","unstructured":"Padia A, Kalpakis K, Ferraro F, Finin T (2019) Knowledge graph fact prediction via knowledge-enriched tensor factorization. J Web Semant 59:100497. https:\/\/doi.org\/10.1016\/j.websem.2019.01.004","journal-title":"J Web Semant"},{"key":"150_CR4","doi-asserted-by":"publisher","unstructured":"Xiong WH, Hoang T, Wang WY (2017) DeepPath: a reinforcement learning method for knowledge graph reasoning. In: Proceedings of the 2017 conference on empirical methods in natural language processing, Association for Computational Linguistics, Copenhagen, 7-11 September 2017. https:\/\/doi.org\/10.18653\/v1\/D17-1060","DOI":"10.18653\/v1\/D17-1060"},{"key":"150_CR5","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/j.neucom.2020.08.032","volume":"419","author":"SY Li","year":"2021","unstructured":"Li SY, Wang H, Pan R, Mao MZ (2021) MemoryPath: a deep reinforcement learning framework for incorporating memory component into knowledge graph reasoning. Neurocomputing 419:273-286. https:\/\/doi.org\/10.1016\/j.neucom.2020.08.032","journal-title":"Neurocomputing"},{"key":"150_CR6","doi-asserted-by":"publisher","unstructured":"Gal\u00e1rraga LA, Teflioudi C, Hose K, Suchanek F (2013) AMIE: association rule mining under incomplete evidence in ontological knowledge bases. In: Proceedings of the 22nd international conference on world wide web, ACM, Rio de Janeiro, 13-17 May 2013. https:\/\/doi.org\/10.1145\/2488388.2488425\u00a0","DOI":"10.1145\/2488388.2488425"},{"key":"150_CR7","doi-asserted-by":"publisher","unstructured":"Cohen WW (2016) TensorLog: a differentiable deductive database. arXiv preprint arXiv:1605.06523. https:\/\/doi.org\/10.48550\/arXiv.1605.06523\u00a0","DOI":"10.48550\/arXiv.1605.06523"},{"key":"150_CR8","unstructured":"Yang F, Yang ZL, Cohen WW (2017) Differentiable learning of logical rules for knowledge base reasoning. In: Proceedings of the 31st international conference on neural information processing systems, Curran Associates Inc, Long Beach, 4-9 December 2017"},{"key":"150_CR9","doi-asserted-by":"publisher","unstructured":"Qu M, Chen JK, Xhonneux LP, Bengio Y, Tang J (2020) RNNLogic: learning logic rules for reasoning on knowledge graphs. arXiv preprint arXiv:2010.04029. https:\/\/doi.org\/10.48550\/arXiv.2010.04029\u00a0","DOI":"10.48550\/arXiv.2010.04029"},{"key":"150_CR10","unstructured":"Bordes A, Usunier N, Garcia-Dur\u00e1n A, Weston J, Yakhnenko O (2013) Translating embeddings for modeling multi-relational data. In: Proceedings of the 26th international conference on neural information processing systems, Curran Associates Inc, Lake Tahoe, 5-8 December 2013"},{"key":"150_CR11","doi-asserted-by":"publisher","unstructured":"Wang Z, Zhang JW, Feng JL, Chen Z (2014) Knowledge graph embedding by translating on hyperplanes. In: Proceedings of the 28th AAAI conference on artificial intelligence, AAAI, Qu\u00e9bec City, 27-31 July 2014. https:\/\/doi.org\/10.1609\/aaai.v28i1.8870\u00a0","DOI":"10.1609\/aaai.v28i1.8870"},{"key":"150_CR12","doi-asserted-by":"publisher","unstructured":"Lin YK, Liu ZY, Sun MS, Liu Y, Zhu X (2015) Learning entity and relation embeddings for knowledge graph completion. In: Proceedings of the 29th AAAI conference on artificial intelligence, AAAI, Austin, 25-30 January 2015. https:\/\/doi.org\/10.1609\/aaai.v29i1.9491\u00a0","DOI":"10.1609\/aaai.v29i1.9491"},{"key":"150_CR13","doi-asserted-by":"publisher","unstructured":"Ji GL, He SZ, Xu LH, 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), Association for Computational Linguistics, Beijing, 26-31 July 2015. https:\/\/doi.org\/10.3115\/v1\/P15-1067\u00a0","DOI":"10.3115\/v1\/P15-1067"},{"key":"150_CR14","unstructured":"Nickel M, Tresp V, Kriegel HP (2011) A three-way model for collective learning on multi-relational data. In: Proceedings of the 28th international conference on international conference on machine learning, Omnipress, Bellevue, 28 June-2 July 2011"},{"key":"150_CR15","doi-asserted-by":"publisher","unstructured":"Yang BS, Yih WT, He XD, Gao JF, Deng L (2014) Embedding entities and relations for learning and inference in knowledge bases. arXiv preprint arXiv:1412.6575. https:\/\/doi.org\/10.48550\/arXiv.1412.6575","DOI":"10.48550\/arXiv.1412.6575"},{"key":"150_CR16","unstructured":"Trouillon T, Welbl J, Riedel S, Gaussier \u00c9, Bouchard G (2016) Complex embeddings for simple link prediction. In: Proceedings of the 33rd international conference on international conference on machine learning, JMLR.org, New York City, 19-24 June 2016"},{"key":"150_CR17","doi-asserted-by":"publisher","unstructured":"Dettmers T, Minervini P, Stenetorp P, Riedel S (2018) Convolutional 2D knowledge graph embeddings. In: Proceedings of the 32nd AAAI conference on artificial intelligence, AAAI, New Orleans, 2-7 February 2018. https:\/\/doi.org\/10.1609\/aaai.v32i1.11573\u00a0","DOI":"10.1609\/aaai.v32i1.11573"},{"key":"150_CR18","doi-asserted-by":"publisher","unstructured":"Schlichtkrull M, Kipf TN, Bloem P, Van Den Berg R, Titov I, Welling M (2018) Modeling relational data with graph convolutional networks. In: Gangemi A, Navigli R, Vidal ME, Hitzler P, Troncy R, Hollink L et al (eds) The semantic web. 15th international conference, ESWC 2018, Heraklion, June 2018. Lecture notes in computer science (Information systems and applications, incl. internet\/web, and HCI), vol 10843. Springer, Heidelberg, pp 593-607. https:\/\/doi.org\/10.1007\/978-3-319-93417-4_38\u00a0","DOI":"10.1007\/978-3-319-93417-4_38"},{"key":"150_CR19","unstructured":"Teru KK, Denis EG, Hamilton WL (2020) Inductive relation prediction by subgraph reasoning. In: Proceedings of the 37th international conference on machine learning, JMLR.org, Online, 13-18 July 2020."},{"key":"150_CR20","doi-asserted-by":"publisher","first-page":"109673","DOI":"10.1016\/j.knosys.2022.109673","volume":"255","author":"WM Li","year":"2022","unstructured":"Li WM, Ni L, Wang JJ, Wang C (2022) Collaborative representation learning for nodes and relations via heterogeneous graph neural network. Knowl-Based Syst 255:109673. https:\/\/doi.org\/10.1016\/j.knosys.2022.109673\u00a0","journal-title":"Knowl-Based Syst"},{"key":"150_CR21","doi-asserted-by":"publisher","unstructured":"Lin XV, Socher R, Xiong CM (2018) Multi-hop knowledge graph reasoning with reward shaping. In: Proceedings of the 2018 conference on empirical methods in natural language processing, Association for Computational Linguistics, Brussels, 31 October-04 November 4 2018. https:\/\/doi.org\/10.18653\/v1\/D18-1362","DOI":"10.18653\/v1\/D18-1362"},{"key":"150_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.neunet.2020.11.012","volume":"135","author":"P Tiwari","year":"2021","unstructured":"Tiwari P, Zhu HY, Pandey HM (2021) DAPath: distance-aware knowledge graph reasoning based on deep reinforcement learning. Neural Netw 135:1-12. https:\/\/doi.org\/10.1016\/j.neunet.2020.11.012","journal-title":"Neural Netw"},{"key":"150_CR23","doi-asserted-by":"publisher","unstructured":"Kwon D, Natarajan K, Suh SC, Kim H, Kim J (2018) An empirical study on network anomaly detection using convolutional neural networks. In: Proceedings of the IEEE 38th international conference on distributed computing systems, IEEE, Vienna, 2-6 July 2018. https:\/\/doi.org\/10.1109\/ICDCS.2018.00178","DOI":"10.1109\/ICDCS.2018.00178"},{"key":"150_CR24","doi-asserted-by":"publisher","unstructured":"Hsu D (2017) Anomaly detection on graph time series. arXiv preprint arXiv:1708.02975. https:\/\/doi.org\/10.48550\/arXiv.1708.02975","DOI":"10.48550\/arXiv.1708.02975"},{"issue":"4","key":"150_CR25","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.visinf.2021.12.003","volume":"5","author":"YY Wang","year":"2021","unstructured":"Wang YY, Bai ZN, Lin ZF, Dong XQ, Feng YCJ, Pan JC et al (2021) G6: a web-based library for graph visualization. Vis Inf 5(4):49-55. https:\/\/doi.org\/10.1016\/j.visinf.2021.12.003","journal-title":"Vis Inf"},{"issue":"1","key":"150_CR26","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1109\/TVCG.2022.3209469","volume":"29","author":"Y Zhao","year":"2022","unstructured":"Zhao Y, Ge LH, Xie HX, Bai GH, Zhang Z, Wei Q et al (2022) ASTF: visual abstractions of time-varying patterns in radio signals. IEEE Trans Vis Comput Graph 29(1):214-224. https:\/\/doi.org\/10.1109\/TVCG.2022.3209469\u00a0","journal-title":"IEEE Trans Vis Comput Graph"},{"issue":"1","key":"150_CR27","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1186\/s42492-021-00088-8","volume":"4","author":"M Burch","year":"2021","unstructured":"Burch M, Ten Brinke KB, Castella A, Peters GKS, Shteriyanov V, Vlasvinkel R (2021) Dynamic graph exploration by interactively linked node-link diagrams and matrix visualizations. Vis Comput Ind, Biomed, Art 4(1):23. https:\/\/doi.org\/10.1186\/s42492-021-00088-8","journal-title":"Vis Comput Ind, Biomed, Art"},{"issue":"12","key":"150_CR28","doi-asserted-by":"publisher","first-page":"4839","DOI":"10.1109\/TVCG.2021.3107297","volume":"28","author":"Y Zhao","year":"2022","unstructured":"Zhao Y, Shi JC, Liu JW, Zhao J, Zhou FF, Zhang WZ et al (2022) Evaluating effects of background stories on graph perception. IEEE Trans Vis Comput Graph 28(12):4839-4854. https:\/\/doi.org\/10.1109\/TVCG.2021.3107297","journal-title":"IEEE Trans Vis Comput Graph"},{"issue":"4","key":"150_CR29","doi-asserted-by":"publisher","first-page":"2341","DOI":"10.1007\/s11280-020-00810-1","volume":"23","author":"XH Tao","year":"2020","unstructured":"Tao XH, Pham T, Zhang J, Yong JM, Goh WP, Zhang WP et al (2020) Mining health knowledge graph for health risk prediction. World Wide Web 23(4):2341-2362. https:\/\/doi.org\/10.1007\/s11280-020-00810-1","journal-title":"World Wide Web"},{"key":"150_CR30","doi-asserted-by":"publisher","DOI":"10.1016\/j.visinf.2023.06.008","author":"Y Zhao","year":"2023","unstructured":"Zhao Y, Lv SL, Long WW, Fan YL, Yuan J, Jiang HJ et al (2023) Malicious webshell family dataset for webshell multi-classification research. Vis Inf (in press) https:\/\/doi.org\/10.1016\/j.visinf.2023.06.008","journal-title":"Vis Inf (in press)"},{"issue":"8","key":"150_CR31","doi-asserted-by":"publisher","first-page":"1735","DOI":"10.1007\/978-3-642-24797-2_4","volume":"9","author":"S Hochreiter","year":"1997","unstructured":"Hochreiter S, Schmidhuber J (1997) Long short-term memory. Neural Comput 9(8):1735-1780. https:\/\/doi.org\/10.1007\/978-3-642-24797-2_4","journal-title":"Neural Comput"},{"issue":"86","key":"150_CR32","first-page":"2579","volume":"9","author":"L van der Maaten","year":"2008","unstructured":"van der Maaten L, Hinton G (2008) Visualizing data using t-SNE. J Mach Learn Res 9(86):2579-2605.","journal-title":"J Mach Learn Res"},{"issue":"1","key":"150_CR33","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1186\/s42492-022-00103-6","volume":"5","author":"MQ Hatem","year":"2022","unstructured":"Hatem MQ (2022) Skin lesion classification system using a K-nearest neighbor algorithm. Vis Comput Ind, Biomed, Art 5(1):7. https:\/\/doi.org\/10.1186\/s42492-022-00103-6","journal-title":"Vis Comput Ind, Biomed, Art"},{"key":"150_CR34","doi-asserted-by":"publisher","unstructured":"Kramer O (2013) K-nearest neighbors. In: Kramer O (ed) Dimensionality reduction with unsupervised nearest neighbors, vol 51. Springer, Heidelberg, pp 13-23. https:\/\/doi.org\/10.4249\/scholarpedia.1883","DOI":"10.4249\/scholarpedia.1883"},{"key":"150_CR35","doi-asserted-by":"publisher","unstructured":"Wang WT, Wu YL, Tang CY, Hor MK (2015) Adaptive density-based spatial clustering of applications with noise (DBSCAN) according to data. In: Proceedings of the 2015 international conference on machine learning and cybernetics, IEEE, Guangzhou, 12-15 July 2015. https:\/\/doi.org\/10.1109\/ICMLC.2015.7340962","DOI":"10.1109\/ICMLC.2015.7340962"},{"key":"150_CR36","doi-asserted-by":"publisher","unstructured":"Li J, Wang RX, Zhang NY, Zhang W, Yang F, Chen HJ (2020) Logic-guided semantic representation learning for zero-shot relation classification. In: Proceedings of the 28th international conference on computational linguistics, International Committee on Computational Linguistics, Barcelona, 8-13 December 2020. https:\/\/doi.org\/10.18653\/v1\/2020.coling-main.265","DOI":"10.18653\/v1\/2020.coling-main.265"},{"issue":"2","key":"150_CR37","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R Tarjan","year":"1972","unstructured":"Tarjan R (1972) Depth-first search and linear graph algorithms. SIAM J Comput 1(2):146-160. https:\/\/doi.org\/10.1137\/0201010","journal-title":"SIAM J Comput"},{"issue":"3","key":"150_CR38","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/BF00992696","volume":"8","author":"RJ Williams","year":"1992","unstructured":"Williams RJ (1992) Simple statistical gradient-following algorithms for connectionist reinforcement learning. Mach Learn 8(3):229-256. https:\/\/doi.org\/10.1007\/BF00992696","journal-title":"Mach Learn"},{"key":"150_CR39","unstructured":"Kingma DP, Ba J (2015) Adam: a method for stochastic optimization. In: Proceedings of the 3rd international conference on learning representations, ICLR, San Diego, 7-9 May 2015."},{"key":"150_CR40","doi-asserted-by":"publisher","unstructured":"Carlson A, Betteridge J, Kisiel B, Settles B, Hruschka Jr ER, Mitchell TM (2010) Toward an architecture for never-ending language learning. In: Proceedings of the 24th AAAI conference on artificial intelligence, AAAI, Atlanta, 11-15 July 2010. https:\/\/doi.org\/10.1609\/aaai.v24i1.7519","DOI":"10.1609\/aaai.v24i1.7519"},{"key":"150_CR41","doi-asserted-by":"publisher","unstructured":"Bollacker KD, Evans C, Paritosh PK, Sturge T, Taylor J (2008) Freebase: a collaboratively created graph database for structuring human knowledge. In: Proceedings of the 2008 ACM SIGMOD international conference on management of data, ACM, Vancouver, 10-12 June 2008. https:\/\/doi.org\/10.1145\/1376616.1376746","DOI":"10.1145\/1376616.1376746"}],"container-title":["Visual Computing for Industry, Biomedicine, and Art"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s42492-023-00150-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s42492-023-00150-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s42492-023-00150-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,20]],"date-time":"2023-11-20T03:03:35Z","timestamp":1700449415000},"score":1,"resource":{"primary":{"URL":"https:\/\/vciba.springeropen.com\/articles\/10.1186\/s42492-023-00150-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,20]]},"references-count":41,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2023,12]]}},"alternative-id":["150"],"URL":"https:\/\/doi.org\/10.1186\/s42492-023-00150-7","relation":{},"ISSN":["2524-4442"],"issn-type":[{"value":"2524-4442","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,11,20]]},"assertion":[{"value":"16 July 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 October 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 November 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"21"}}