{"title":"学习去噪生物医学知识图谱,实现可靠的分子相互作用预测","authors":"Tengfei Ma;Yujie Chen;Wen Tao;Dashun Zheng;Xuan Lin;Patrick Cheong-Iao Pang;Yiping Liu;Yijun Wang;Longyue Wang;Bosheng Song;Xiangxiang Zeng;Philip S. Yu","doi":"10.1109/TKDE.2024.3471508","DOIUrl":null,"url":null,"abstract":"Molecular interaction prediction plays a crucial role in forecasting unknown interactions between molecules, such as drug-target interaction (DTI) and drug-drug interaction (DDI), which are essential in the field of drug discovery and therapeutics. Although previous prediction methods have yielded promising results by leveraging the rich semantics and topological structure of biomedical knowledge graphs (KGs), they have primarily focused on enhancing predictive performance without addressing the presence of inevitable noise and inconsistent semantics. This limitation has hindered the advancement of KG-based prediction methods. To address this limitation, we propose BioKDN (\n<bold>Bio</b>\nmedical \n<bold>K</b>\nnowledge Graph \n<bold>D</b>\nenoising \n<bold>N</b>\network) for robust molecular interaction prediction. BioKDN refines the reliable structure of local subgraphs by denoising noisy links in a learnable manner, providing a general module for extracting task-relevant interactions. To enhance the reliability of the refined structure, BioKDN maintains consistent and robust semantics by smoothing relations around the target interaction. By maximizing the mutual information between reliable structure and smoothed relations, BioKDN emphasizes informative semantics to enable precise predictions. Experimental results on real-world datasets show that BioKDN surpasses state-of-the-art models in DTI and DDI prediction tasks, confirming the effectiveness and robustness of BioKDN in denoising unreliable interactions within contaminated KGs.","PeriodicalId":13496,"journal":{"name":"IEEE Transactions on Knowledge and Data Engineering","volume":"36 12","pages":"8682-8694"},"PeriodicalIF":8.9000,"publicationDate":"2024-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Learning to Denoise Biomedical Knowledge Graph for Robust Molecular Interaction Prediction\",\"authors\":\"Tengfei Ma;Yujie Chen;Wen Tao;Dashun Zheng;Xuan Lin;Patrick Cheong-Iao Pang;Yiping Liu;Yijun Wang;Longyue Wang;Bosheng Song;Xiangxiang Zeng;Philip S. Yu\",\"doi\":\"10.1109/TKDE.2024.3471508\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Molecular interaction prediction plays a crucial role in forecasting unknown interactions between molecules, such as drug-target interaction (DTI) and drug-drug interaction (DDI), which are essential in the field of drug discovery and therapeutics. Although previous prediction methods have yielded promising results by leveraging the rich semantics and topological structure of biomedical knowledge graphs (KGs), they have primarily focused on enhancing predictive performance without addressing the presence of inevitable noise and inconsistent semantics. This limitation has hindered the advancement of KG-based prediction methods. To address this limitation, we propose BioKDN (\\n<bold>Bio</b>\\nmedical \\n<bold>K</b>\\nnowledge Graph \\n<bold>D</b>\\nenoising \\n<bold>N</b>\\network) for robust molecular interaction prediction. BioKDN refines the reliable structure of local subgraphs by denoising noisy links in a learnable manner, providing a general module for extracting task-relevant interactions. To enhance the reliability of the refined structure, BioKDN maintains consistent and robust semantics by smoothing relations around the target interaction. By maximizing the mutual information between reliable structure and smoothed relations, BioKDN emphasizes informative semantics to enable precise predictions. Experimental results on real-world datasets show that BioKDN surpasses state-of-the-art models in DTI and DDI prediction tasks, confirming the effectiveness and robustness of BioKDN in denoising unreliable interactions within contaminated KGs.\",\"PeriodicalId\":13496,\"journal\":{\"name\":\"IEEE Transactions on Knowledge and Data Engineering\",\"volume\":\"36 12\",\"pages\":\"8682-8694\"},\"PeriodicalIF\":8.9000,\"publicationDate\":\"2024-10-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Knowledge and Data Engineering\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10706014/\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Knowledge and Data Engineering","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10706014/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0
摘要
分子相互作用预测在预测分子间未知相互作用(如药物-靶点相互作用(DTI)和药物-药物相互作用(DDI))方面发挥着至关重要的作用,这些相互作用在药物发现和治疗领域至关重要。虽然以前的预测方法利用生物医学知识图(KG)丰富的语义和拓扑结构取得了可喜的成果,但它们主要侧重于提高预测性能,而没有解决不可避免的噪声和语义不一致的问题。这一局限性阻碍了基于 KG 的预测方法的发展。为了解决这一局限性,我们提出了用于稳健分子相互作用预测的 BioKDN(生物医学知识图谱去噪网络)。BioKDN 通过以可学习的方式去噪链接来完善局部子图的可靠结构,为提取任务相关的相互作用提供了一个通用模块。为了提高精炼结构的可靠性,BioKDN 通过平滑目标交互周围的关系来保持一致和稳健的语义。通过最大化可靠结构与平滑关系之间的互信息,BioKDN 强调了信息语义,从而实现了精确预测。在真实世界数据集上的实验结果表明,BioKDN 在 DTI 和 DDI 预测任务中超越了最先进的模型,证实了 BioKDN 在去噪受污染 KG 中不可靠相互作用方面的有效性和鲁棒性。
Learning to Denoise Biomedical Knowledge Graph for Robust Molecular Interaction Prediction
Molecular interaction prediction plays a crucial role in forecasting unknown interactions between molecules, such as drug-target interaction (DTI) and drug-drug interaction (DDI), which are essential in the field of drug discovery and therapeutics. Although previous prediction methods have yielded promising results by leveraging the rich semantics and topological structure of biomedical knowledge graphs (KGs), they have primarily focused on enhancing predictive performance without addressing the presence of inevitable noise and inconsistent semantics. This limitation has hindered the advancement of KG-based prediction methods. To address this limitation, we propose BioKDN (
Bio
medical
K
nowledge Graph
D
enoising
N
etwork) for robust molecular interaction prediction. BioKDN refines the reliable structure of local subgraphs by denoising noisy links in a learnable manner, providing a general module for extracting task-relevant interactions. To enhance the reliability of the refined structure, BioKDN maintains consistent and robust semantics by smoothing relations around the target interaction. By maximizing the mutual information between reliable structure and smoothed relations, BioKDN emphasizes informative semantics to enable precise predictions. Experimental results on real-world datasets show that BioKDN surpasses state-of-the-art models in DTI and DDI prediction tasks, confirming the effectiveness and robustness of BioKDN in denoising unreliable interactions within contaminated KGs.
期刊介绍:
The IEEE Transactions on Knowledge and Data Engineering encompasses knowledge and data engineering aspects within computer science, artificial intelligence, electrical engineering, computer engineering, and related fields. It provides an interdisciplinary platform for disseminating new developments in knowledge and data engineering and explores the practicality of these concepts in both hardware and software. Specific areas covered include knowledge-based and expert systems, AI techniques for knowledge and data management, tools, and methodologies, distributed processing, real-time systems, architectures, data management practices, database design, query languages, security, fault tolerance, statistical databases, algorithms, performance evaluation, and applications.