{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:10Z","timestamp":1740122410465,"version":"3.37.3"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,12,2]],"date-time":"2024-12-02T00:00:00Z","timestamp":1733097600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,2]],"date-time":"2024-12-02T00:00:00Z","timestamp":1733097600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"the Outstanding Academic Leader Project of Shanghai","award":["No.20XD1401700"],"award-info":[{"award-number":["No.20XD1401700"]}]},{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["91746203"],"award-info":[{"award-number":["91746203"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2025,1]]},"DOI":"10.1007\/s10618-024-01080-5","type":"journal-article","created":{"date-parts":[[2024,12,2]],"date-time":"2024-12-02T18:49:58Z","timestamp":1733165398000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["ARL: analogical reinforcement learning for knowledge graph reasoning"],"prefix":"10.1007","volume":"39","author":[{"given":"Nan","family":"Xia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Run-Fa","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiangfeng","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,12,2]]},"reference":[{"key":"1080_CR1","unstructured":"Bordes A, Usunier N, Garcia-Duran A, Weston J, Yakhnenko O (2013) Translating embeddings for modeling multi-relational data. Adv Neural Inf Process Syst 26"},{"key":"1080_CR2","doi-asserted-by":"crossref","unstructured":"Cheng K, Yang Z, Zhang M, Sun Y (2021) Uniker: a unified framework for combining embedding and definite horn rule reasoning for knowledge graph inference. In: Moens M, Huang X, Specia L, Yih SW (eds) Proceedings of the 2021 conference on empirical methods in natural language processing, EMNLP 2021, Virtual Event \/ Punta Cana, Dominican Republic, 7-11 November, pp 9753\u20139771","DOI":"10.18653\/v1\/2021.emnlp-main.769"},{"key":"1080_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":"1080_CR4","doi-asserted-by":"crossref","unstructured":"Dettmers T, Minervini P, Stenetorp P, Riedel S (2018) Convolutional 2D knowledge graph embeddings. In: Thirty-second AAAI conference on artificial intelligence","DOI":"10.1609\/aaai.v32i1.11573"},{"key":"1080_CR5","doi-asserted-by":"crossref","unstructured":"Hou Z, Jin X, Li Z, Bai L (2021) Rule-aware reinforcement learning for knowledge graph reasoning. In: Findings of the association for computational linguistics: ACL-IJCNLP 2021, pp 4687\u20134692","DOI":"10.18653\/v1\/2021.findings-acl.412"},{"issue":"1","key":"1080_CR6","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s10618-022-00891-8","volume":"37","author":"W Jin","year":"2023","unstructured":"Jin W, Zhao B, Yu H, Tao X, Yin R, Liu G (2023) Improving embedded knowledge graph multi-hop question answering by introducing relational chain reasoning. Data Min Knowl Discov 37(1):255\u2013288","journal-title":"Data Min Knowl Discov"},{"issue":"3","key":"1080_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2022.103260","volume":"60","author":"W Jin","year":"2023","unstructured":"Jin W, Zhao B, Zhang L, Liu C, Yu H (2023) Back to common sense: Oxford dictionary descriptive knowledge augmentation for aspect-based sentiment analysis. Inf Process Manag 60(3):103260","journal-title":"Inf Process Manag"},{"key":"1080_CR8","unstructured":"Kingma DP, Ba J (2014) Adam: a method for stochastic optimization. arXiv preprint arXiv:1412.6980"},{"key":"1080_CR9","unstructured":"Kipf TN, Welling M (2016) Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907"},{"key":"1080_CR10","doi-asserted-by":"crossref","unstructured":"Kok S, Domingos P (2007) Statistical predicate invention. In: Proceedings of the 24th international conference on machine learning, pp 433\u2013440","DOI":"10.1145\/1273496.1273551"},{"key":"1080_CR11","doi-asserted-by":"crossref","unstructured":"Lan Y, Jiang J (2020) Query graph generation for answering multi-hop complex questions from knowledge bases. Assoc Comput Linguist","DOI":"10.18653\/v1\/2020.acl-main.91"},{"key":"1080_CR12","unstructured":"Lao N, Mitchell T, Cohen W (2011) Random walk inference and learning in a large scale knowledge base. In: Proceedings of the 2011 conference on empirical methods in natural language processing, pp 529\u2013539"},{"key":"1080_CR13","doi-asserted-by":"crossref","unstructured":"Lei D, Jiang G, Gu X, Sun K, Mao Y, Ren X (2020) Learning collaborative agents with rule guidance for knowledge graph reasoning. In: Webber B, Cohn T, He Y, Liu Y (eds) Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing, EMNLP 2020, Online, November 16-20, pp 8541\u20138547","DOI":"10.18653\/v1\/2020.emnlp-main.688"},{"key":"1080_CR14","unstructured":"Liu S, Omran PG, Taylor K (2023) Data augmented knowledge graph completion via pre-trained language models. In: Fundulaki I, Kozaki K, Garijo D, G\u00f3mez-P\u00e9rez JM (eds) Proceedings of the ISWC 2023 posters, demos and industry tracks: from novel ideas to industrial practice co-located with 22nd international semantic web conference (ISWC 2023), Athens, Greece, November 6-10, 2023. CEUR workshop proceedings, vol 3632"},{"key":"1080_CR15","doi-asserted-by":"crossref","unstructured":"Ma J, Zhao Z, Yi X, Chen J, Hong L, Chi EH (2018) Modeling task relationships in multi-task learning with multi-gate mixture-of-experts. In: Proceedings of the 24th ACM sigkdd international conference on knowledge discovery & data mining, pp 1930\u20131939","DOI":"10.1145\/3219819.3220007"},{"key":"1080_CR16","unstructured":"Meilicke C, Chekol M.W, Fink M, Stuckenschmidt H (2020) Reinforced anytime bottom up rule learning for knowledge graph completion. CoRR abs\/2004.04412 2004.04412"},{"key":"1080_CR17","doi-asserted-by":"crossref","unstructured":"Nathani D, Chauhan J, Sharma C, Kaul M (2019) Learning attention-based embeddings for relation prediction in knowledge graphs. arXiv preprint arXiv:1906.01195","DOI":"10.18653\/v1\/P19-1466"},{"key":"1080_CR18","doi-asserted-by":"crossref","unstructured":"Nguyen DQ, Nguyen TD, Nguyen DQ, Phung D (2017) A novel embedding model for knowledge base completion based on convolutional neural network. arXiv preprint arXiv:1712.02121","DOI":"10.18653\/v1\/N18-2053"},{"key":"1080_CR19","doi-asserted-by":"crossref","unstructured":"Pan Z, Wang P (2011) Hyperbolic hierarchy-aware knowledge graph embedding for link prediction. In: Findings of the association for computational linguistics: EMNLP 2021, pp 2941-2948","DOI":"10.18653\/v1\/2021.findings-emnlp.251"},{"key":"1080_CR20","doi-asserted-by":"publisher","unstructured":"Qi B, Chen X, Gao J, Li D, Liu J, Wu L, Zhou B (2024) Interactive continual learning: fast and slow thinking. https:\/\/doi.org\/10.48550\/ARXIV.2403.02628.2403.02628","DOI":"10.48550\/ARXIV.2403.02628.2403.02628"},{"key":"1080_CR21","doi-asserted-by":"crossref","unstructured":"Schlichtkrull M, Kipf T.N, Bloem P, Van Den\u00a0Berg R, Titov I, Welling M (2018) Modeling relational data with graph convolutional networks. In: European semantic web conference. Springer, pp 593\u2013607","DOI":"10.1007\/978-3-319-93417-4_38"},{"key":"1080_CR22","unstructured":"Sun Z, Deng Z-H, Nie J-Y, Tang J (2019) Rotate: knowledge graph embedding by relational rotation in complex space. arXiv preprint arXiv:1902.10197"},{"key":"1080_CR23","unstructured":"Teru K, Denis E, Hamilton W (2020) Inductive relation prediction by subgraph reasoning. In: International conference on machine learning"},{"key":"1080_CR24","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":"1080_CR25","unstructured":"Trouillon T, Welbl J, Riedel S, Gaussier \u00c9, Bouchard G (2016) Complex embeddings for simple link prediction. In: International conference on machine learning, pp 2071\u20132080. PMLR"},{"key":"1080_CR26","unstructured":"Velikovi P, Cucurull G, Casanova A, Romero A, Li\u00f2 P, Bengio Y (2017) Graph attention networks"},{"issue":"10","key":"1080_CR27","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1145\/2629489","volume":"57","author":"D Vrande\u010di\u0107","year":"2014","unstructured":"Vrande\u010di\u0107 D, Kr\u00f6tzsch M (2014) Wikidata: a free collaborative knowledgebase. Commun ACM 57(10):78\u201385","journal-title":"Commun ACM"},{"key":"1080_CR28","doi-asserted-by":"crossref","unstructured":"Wang WY, Cohen W (2015) Joint information extraction and reasoning: a scalable statistical relational learning approach. 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), pp 355\u2013364","DOI":"10.3115\/v1\/P15-1035"},{"key":"1080_CR29","doi-asserted-by":"crossref","unstructured":"Wang X, He X, Cao Y, Liu M, Chua T-S (2019) Kgat: knowledge graph attention network for recommendation. In: Proceedings of the 25th ACM SIGKDD international conference on knowledge discovery & data mining, pp 950\u2013958","DOI":"10.1145\/3292500.3330989"},{"key":"1080_CR30","doi-asserted-by":"crossref","unstructured":"Wang H, Li S, Pan R, Mao M (2019) Incorporating graph attention mechanism into knowledge graph reasoning based on deep reinforcement learning. In: Proceedings of the 2019 conference on empirical methods in natural language processing and the 9th international joint conference on natural language processing (EMNLP-IJCNLP), pp 2623\u20132631","DOI":"10.18653\/v1\/D19-1264"},{"key":"1080_CR31","doi-asserted-by":"crossref","unstructured":"Wan G, Pan S, Gong C, Zhou C, Haffari G (2020) Reasoning like human: hierarchical reinforcement learning for knowledge graph reasoning. In: IJCAI, pp 1926\u20131932","DOI":"10.24963\/ijcai.2020\/267"},{"issue":"3","key":"1080_CR32","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\u2013256","journal-title":"Mach Learn"},{"key":"1080_CR33","doi-asserted-by":"crossref","unstructured":"Xiong W, Hoang T, Wang WY (2017) Deeppath: a reinforcement learning method for knowledge graph reasoning. arXiv preprint arXiv:1707.06690","DOI":"10.18653\/v1\/D17-1060"},{"key":"1080_CR34","doi-asserted-by":"crossref","unstructured":"Xu X, Zhang P, He Y, Chao C, Yan C (2022) Subgraph neighboring relations infomax for inductive link prediction on knowledge graphs. arXiv preprint arXiv:2208.00850","DOI":"10.24963\/ijcai.2022\/325"},{"issue":"3","key":"1080_CR35","doi-asserted-by":"publisher","first-page":"1113","DOI":"10.1109\/TKDE.2023.3304137","volume":"36","author":"D Yang","year":"2024","unstructured":"Yang D, Qu B, Rosso P, Cudr\u00e9-Mauroux P (2024) Fast and slow thinking: a two-step schema-aware approach for instance completion in knowledge graphs. IEEE Trans Knowl Data Eng 36(3):1113\u20131129. https:\/\/doi.org\/10.1109\/TKDE.2023.3304137","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1080_CR36","unstructured":"Yang F, Yang Z, Cohen W.W (2017) Differentiable learning of logical rules for knowledge base reasoning. In: Guyon I, Luxburg U, Bengio S, Wallach HM, Fergus R, Vishwanathan SVN, Garnett R (eds) Advances in neural information processing systems 30: annual conference on neural information processing systems 2017, December 4-9, 2017, Long Beach, CA, USA, pp 2319\u20132328"},{"key":"1080_CR37","unstructured":"Yang B, Yih,W.-t, He X, Gao J, Deng L (2014) Embedding entities and relations for learning and inference in knowledge bases. arXiv preprint arXiv:1412.6575"},{"key":"1080_CR38","doi-asserted-by":"crossref","unstructured":"Zhang Z, Cai J, Zhang Y, Wang J (2020) Learning hierarchy-aware knowledge graph embeddings for link prediction. In: Proceedings of the AAAI conference on artificial intelligence, vol 34, pp 3065\u20133072","DOI":"10.1609\/aaai.v34i03.5701"},{"key":"1080_CR39","doi-asserted-by":"crossref","unstructured":"Zhang Z, Zhuang F, Zhu H, Shi Z, Xiong H, He Q (2020) Relational graph neural network with hierarchical attention for knowledge graph completion. In: Proceedings of the AAAI conference on artificial intelligence, vol 34, pp 9612\u20139619","DOI":"10.1609\/aaai.v34i05.6508"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-024-01080-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10618-024-01080-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-024-01080-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T11:46:42Z","timestamp":1737028002000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10618-024-01080-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,2]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["1080"],"URL":"https:\/\/doi.org\/10.1007\/s10618-024-01080-5","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"type":"print","value":"1384-5810"},{"type":"electronic","value":"1573-756X"}],"subject":[],"published":{"date-parts":[[2024,12,2]]},"assertion":[{"value":"1 March 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 November 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 December 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"5"}}