{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T04:07:57Z","timestamp":1773979677432,"version":"3.50.1"},"reference-count":46,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T00:00:00Z","timestamp":1727740800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T00:00:00Z","timestamp":1727740800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T00:00:00Z","timestamp":1727740800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"National Key R&amp;D Program of China","award":["2023YFF0905503"],"award-info":[{"award-number":["2023YFF0905503"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62072203"],"award-info":[{"award-number":["62072203"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Emerg. Top. Comput. Intell."],"published-print":{"date-parts":[[2024,10]]},"DOI":"10.1109\/tetci.2024.3372350","type":"journal-article","created":{"date-parts":[[2024,3,26]],"date-time":"2024-03-26T20:34:59Z","timestamp":1711485299000},"page":"3665-3677","source":"Crossref","is-referenced-by-count":3,"title":["From Concept to Instance: Hierarchical Reinforced Knowledge Graph Reasoning"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-7896-7041","authenticated-orcid":false,"given":"Cheng","family":"Yan","sequence":"first","affiliation":[{"name":"Natural Language Processing and Knowledge Graph Lab, School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7205-3302","authenticated-orcid":false,"given":"Feng","family":"Zhao","sequence":"additional","affiliation":[{"name":"Natural Language Processing and Knowledge Graph Lab, School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4870-1493","authenticated-orcid":false,"given":"Yudong","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Computing and Mathematical Sciences, University of Leicester, Leicester, U.K."}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.emnlp-main.147"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TETCI.2021.3067017"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TETCI.2019.2920404"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TETCI.2022.3189084"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2022.3223858"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2021.3070843"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2021.3104310"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.4324\/9780203786031-11"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2021.emnlp-main.769"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2023.02.050"},{"key":"ref11","article-title":"Go for a walk and arrive at the answer: Reasoning over paths in knowledge bases using reinforcement learning","volume-title":"Proc. 6th Int. Conf. Learn. Representations","author":"Das","year":"2018"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/3331184.3331203"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.acl-main.412"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i5.16565"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3482402"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i5.20538"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2022.acl-long.205"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.1706.03762"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2021.acl-long.336"},{"key":"ref20","first-page":"19716","article-title":"Beta embeddings for multi-hop logical reasoning in knowledge graphs","volume-title":"Proc. 34th Int. Conf. Neural Inf. Process. Syst.","author":"Ren","year":"2020"},{"key":"ref21","first-page":"2787","article-title":"Translating embeddings for modeling multi-relational data","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Bordes","year":"2013"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11573"},{"key":"ref23","first-page":"5595","article-title":"Quantum embedding of knowledge for reasoning","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Garg","year":"2019"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-88361-4_24"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330838"},{"key":"ref26","first-page":"8959","article-title":"LEGO: Latent execution-guided reasoning for multi-hop question answering on knowledge graphs","volume-title":"Proc. 38th Int. Conf. Mach. Learn.","volume":"139","author":"Ren","year":"2021"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-021-00972-6"},{"key":"ref28","article-title":"Tensorlog: Deep learning meets probabilistic DBs","author":"Cohen","year":"2017"},{"key":"ref29","first-page":"2319","article-title":"Differentiable learning of logical rules for knowledge base reasoning","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Yang","year":"2017"},{"key":"ref30","first-page":"7710","article-title":"Probabilistic logic neural networks for reasoning","volume-title":"Proc. Adv. Neural Inf. Process.","author":"Qu","year":"2019"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TETCI.2022.3145694"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D17-1060"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D18-1362"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2022.108235"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-00123-9_13"},{"key":"ref36","article-title":"Hierarchical reinforcement learning by discovering intrinsic options","volume-title":"Proc. 9th Int. Conf. Learn. Representations","author":"Zhang","year":"2021"},{"key":"ref37","first-page":"278","article-title":"Policy invariance under reward transformations: Theory and application to reward shaping","volume-title":"Proc. 16th Int. Conf. Mach. Learn.","author":"Ng","year":"1999"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/BF00992696"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D18-1223"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/tkde.2023.3304665"},{"key":"ref41","first-page":"6787","article-title":"M-walk: Learning to walk over graphs using monte carlo tree search","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Shen","year":"2018"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.emnlp-main.688"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2022.108843"},{"key":"ref44","article-title":"Adam: A method for stochastic optimization","volume-title":"Proc. 3rd Int. Conf. Learn. Representations","author":"Kingma","year":"2015"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.acl-main.572"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2016.7799322"}],"container-title":["IEEE Transactions on Emerging Topics in Computational Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7433297\/10703967\/10478730.pdf?arnumber=10478730","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,26]],"date-time":"2024-11-26T18:56:32Z","timestamp":1732647392000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10478730\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10]]},"references-count":46,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tetci.2024.3372350","relation":{},"ISSN":["2471-285X"],"issn-type":[{"value":"2471-285X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,10]]}}}