Multi-Hop Reasoning With Relation Based Node Quality Evaluation for Sparse Medical Knowledge Graph

IF 5.3 3区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE IEEE Transactions on Emerging Topics in Computational Intelligence Pub Date : 2024-09-12 DOI:10.1109/TETCI.2024.3452748
Tian Zhang;Jian Cheng;Lijie Miao;Hanning Chen;Qing Li;Qiang He;Jianhui Lyu;Lianbo Ma
{"title":"Multi-Hop Reasoning With Relation Based Node Quality Evaluation for Sparse Medical Knowledge Graph","authors":"Tian Zhang;Jian Cheng;Lijie Miao;Hanning Chen;Qing Li;Qiang He;Jianhui Lyu;Lianbo Ma","doi":"10.1109/TETCI.2024.3452748","DOIUrl":null,"url":null,"abstract":"Medical knowledge graph (KG) is sparse KG that contains insufficient information and missing paths. Multi-hop reasoning is an effective approach of medical KG completion, since it offers logical insights of the underlying KG and shows more direct interpretability. However, existing methods based on reinforcement learning focus on the use of historical and current state information but ignore the importance of evaluating the quality of candidate nodes in sparse KGs. Especially, it is difficult for the agent to select the correct search actions in sparse KGs. Occasionally, the agent will be at a dilemma state (i.e., state trap), where few actions can be selected. To address the above issue, we propose an effective relation-based node quality evaluation (RNQE) model for multi-hop reasoning. This model has two merits: (1) it reduces the impact of insufficient information in sparse KGs by synthesizing the reasoning quality information (i.e., the potential reasoning contribution) of candidate nodes; (2) it avoids the state trap by encouraging the agents to explore the path along a set of nodes with more relations. Experiments on both benchmark and real-world medical knowledge graphs demonstrate the promising ability of our proposed method to improve the reasoning performance for KGs.","PeriodicalId":13135,"journal":{"name":"IEEE Transactions on Emerging Topics in Computational Intelligence","volume":"9 2","pages":"1805-1816"},"PeriodicalIF":5.3000,"publicationDate":"2024-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Emerging Topics in Computational Intelligence","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10679243/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Medical knowledge graph (KG) is sparse KG that contains insufficient information and missing paths. Multi-hop reasoning is an effective approach of medical KG completion, since it offers logical insights of the underlying KG and shows more direct interpretability. However, existing methods based on reinforcement learning focus on the use of historical and current state information but ignore the importance of evaluating the quality of candidate nodes in sparse KGs. Especially, it is difficult for the agent to select the correct search actions in sparse KGs. Occasionally, the agent will be at a dilemma state (i.e., state trap), where few actions can be selected. To address the above issue, we propose an effective relation-based node quality evaluation (RNQE) model for multi-hop reasoning. This model has two merits: (1) it reduces the impact of insufficient information in sparse KGs by synthesizing the reasoning quality information (i.e., the potential reasoning contribution) of candidate nodes; (2) it avoids the state trap by encouraging the agents to explore the path along a set of nodes with more relations. Experiments on both benchmark and real-world medical knowledge graphs demonstrate the promising ability of our proposed method to improve the reasoning performance for KGs.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
稀疏医学知识图的多跳推理及基于关系的节点质量评价
医学知识图(KG)是包含信息不足和路径缺失的稀疏知识图。多跳推理是医学KG完成的有效方法,因为它提供了对潜在KG的逻辑见解,并显示出更直接的可解释性。然而,现有的基于强化学习的方法侧重于使用历史和当前状态信息,而忽略了稀疏KGs中候选节点质量评估的重要性,特别是在稀疏KGs中,智能体很难选择正确的搜索动作,偶尔会处于两难状态(即状态陷阱),在这种状态下,智能体可以选择的动作很少。为了解决上述问题,我们提出了一种有效的基于关系的节点质量评估(RNQE)模型用于多跳推理。该模型有两个优点:(1)通过综合候选节点的推理质量信息(即潜在的推理贡献),减少了稀疏KGs中信息不足的影响;(2)通过鼓励agent沿着一组具有更多关系的节点探索路径,避免了状态陷阱。在基准和现实医学知识图上的实验表明,我们提出的方法在提高KGs的推理性能方面具有良好的能力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
10.30
自引率
7.50%
发文量
147
期刊介绍: The IEEE Transactions on Emerging Topics in Computational Intelligence (TETCI) publishes original articles on emerging aspects of computational intelligence, including theory, applications, and surveys. TETCI is an electronics only publication. TETCI publishes six issues per year. Authors are encouraged to submit manuscripts in any emerging topic in computational intelligence, especially nature-inspired computing topics not covered by other IEEE Computational Intelligence Society journals. A few such illustrative examples are glial cell networks, computational neuroscience, Brain Computer Interface, ambient intelligence, non-fuzzy computing with words, artificial life, cultural learning, artificial endocrine networks, social reasoning, artificial hormone networks, computational intelligence for the IoT and Smart-X technologies.
期刊最新文献
IEEE Transactions on Emerging Topics in Computational Intelligence Information for Authors IEEE Computational Intelligence Society Information 2025 Index IEEE Transactions on Emerging Topics in Computational Intelligence IEEE Computational Intelligence Society Information IEEE Transactions on Emerging Topics in Computational Intelligence Information for Authors
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1