微生物-疾病关联预测的自适应动态k近邻和上下文感知相似性优化

IF 4.9 3区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE
Bo Wang , Peilong Wu , Xiaoxin Du , JianFei Zhang , Chunyu Zhang
{"title":"微生物-疾病关联预测的自适应动态k近邻和上下文感知相似性优化","authors":"Bo Wang ,&nbsp;Peilong Wu ,&nbsp;Xiaoxin Du ,&nbsp;JianFei Zhang ,&nbsp;Chunyu Zhang","doi":"10.1016/j.compeleceng.2025.110725","DOIUrl":null,"url":null,"abstract":"<div><div>Microbes play a crucial role in disease occurrence, progression, and treatment. Traditional experimental methods are time-consuming, prompting researchers to turn to computational models. However, existing models often suffer from limited data adaptability and improper feature selection, making them prone to noise interference. To address these limitations, we propose ADKNN-KFGCN, a novel adaptive framework that integrates dynamic K-nearest neighbors, graph convolutional networks, and context-aware similarity optimization. The model constructs multi-source similarity networks by integrating various similarity measures between microbes and diseases, forming a comprehensive foundation for association inference. To better capture complex local patterns, it employs adaptive dynamic K-nearest neighbors to adjust the number of neighbors based on local structure, enhancing the accuracy of network construction. This is followed by context-aware similarity optimization, which filters out low-similarity nodes to suppress noise and emphasize the most informative connections. On this refined graph, graph convolutional networks are used to extract high-level representations, effectively capturing intricate topological relationships. These features are then fused through kernel-based strategies, combining multiple similarity sources via averaging and weighted integration to form a unified representation. Finally, Laplacian Regularized Least Squares leverages the global graph structure during prediction, improving generalization and ensuring robust performance. Experimental results show that ADKNN-KFGCN outperforms seven state-of-the-art methods, achieving an AUC of 0.9851±0.0025 and AUPR of 0.9587±0.0032 on the HMDAD dataset. Case studies on rheumatoid arthritis and inflammatory bowel disease further demonstrate its potential to uncover novel associations, provide insights into disease mechanisms, and support therapeutic target discovery.</div></div>","PeriodicalId":50630,"journal":{"name":"Computers & Electrical Engineering","volume":"128 ","pages":"Article 110725"},"PeriodicalIF":4.9000,"publicationDate":"2025-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Adaptive dynamic K-nearest neighbors and context-aware similarity optimization for microbe-disease association prediction\",\"authors\":\"Bo Wang ,&nbsp;Peilong Wu ,&nbsp;Xiaoxin Du ,&nbsp;JianFei Zhang ,&nbsp;Chunyu Zhang\",\"doi\":\"10.1016/j.compeleceng.2025.110725\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Microbes play a crucial role in disease occurrence, progression, and treatment. Traditional experimental methods are time-consuming, prompting researchers to turn to computational models. However, existing models often suffer from limited data adaptability and improper feature selection, making them prone to noise interference. To address these limitations, we propose ADKNN-KFGCN, a novel adaptive framework that integrates dynamic K-nearest neighbors, graph convolutional networks, and context-aware similarity optimization. The model constructs multi-source similarity networks by integrating various similarity measures between microbes and diseases, forming a comprehensive foundation for association inference. To better capture complex local patterns, it employs adaptive dynamic K-nearest neighbors to adjust the number of neighbors based on local structure, enhancing the accuracy of network construction. This is followed by context-aware similarity optimization, which filters out low-similarity nodes to suppress noise and emphasize the most informative connections. On this refined graph, graph convolutional networks are used to extract high-level representations, effectively capturing intricate topological relationships. These features are then fused through kernel-based strategies, combining multiple similarity sources via averaging and weighted integration to form a unified representation. Finally, Laplacian Regularized Least Squares leverages the global graph structure during prediction, improving generalization and ensuring robust performance. Experimental results show that ADKNN-KFGCN outperforms seven state-of-the-art methods, achieving an AUC of 0.9851±0.0025 and AUPR of 0.9587±0.0032 on the HMDAD dataset. Case studies on rheumatoid arthritis and inflammatory bowel disease further demonstrate its potential to uncover novel associations, provide insights into disease mechanisms, and support therapeutic target discovery.</div></div>\",\"PeriodicalId\":50630,\"journal\":{\"name\":\"Computers & Electrical Engineering\",\"volume\":\"128 \",\"pages\":\"Article 110725\"},\"PeriodicalIF\":4.9000,\"publicationDate\":\"2025-09-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computers & Electrical Engineering\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0045790625006688\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Electrical Engineering","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0045790625006688","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0

摘要

微生物在疾病的发生、发展和治疗中起着至关重要的作用。传统的实验方法耗时,促使研究人员转向计算模型。然而,现有模型的数据适应性有限,特征选择不当,容易受到噪声干扰。为了解决这些限制,我们提出了ADKNN-KFGCN,这是一种集成了动态k近邻、图卷积网络和上下文感知相似性优化的新型自适应框架。该模型通过整合微生物与疾病之间的各种相似性度量,构建了多源相似网络,为关联推理奠定了全面的基础。为了更好地捕获复杂的局部模式,该算法采用自适应动态k近邻,根据局部结构调整近邻的数量,提高了网络构建的准确性。接下来是上下文感知的相似性优化,它过滤掉低相似性节点以抑制噪声并强调信息最多的连接。在这个改进的图上,图卷积网络用于提取高级表示,有效地捕获复杂的拓扑关系。然后通过基于核的策略融合这些特征,通过平均和加权积分将多个相似源组合在一起,形成统一的表示。最后,拉普拉斯正则化最小二乘在预测过程中利用全局图结构,提高了泛化性并确保了鲁棒性。实验结果表明,ADKNN-KFGCN在HMDAD数据集上的AUC为0.9851±0.0025,AUPR为0.9587±0.0032,优于7种最先进的方法。类风湿性关节炎和炎症性肠病的病例研究进一步证明了它有潜力发现新的关联,为疾病机制提供见解,并支持治疗靶点的发现。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Adaptive dynamic K-nearest neighbors and context-aware similarity optimization for microbe-disease association prediction
Microbes play a crucial role in disease occurrence, progression, and treatment. Traditional experimental methods are time-consuming, prompting researchers to turn to computational models. However, existing models often suffer from limited data adaptability and improper feature selection, making them prone to noise interference. To address these limitations, we propose ADKNN-KFGCN, a novel adaptive framework that integrates dynamic K-nearest neighbors, graph convolutional networks, and context-aware similarity optimization. The model constructs multi-source similarity networks by integrating various similarity measures between microbes and diseases, forming a comprehensive foundation for association inference. To better capture complex local patterns, it employs adaptive dynamic K-nearest neighbors to adjust the number of neighbors based on local structure, enhancing the accuracy of network construction. This is followed by context-aware similarity optimization, which filters out low-similarity nodes to suppress noise and emphasize the most informative connections. On this refined graph, graph convolutional networks are used to extract high-level representations, effectively capturing intricate topological relationships. These features are then fused through kernel-based strategies, combining multiple similarity sources via averaging and weighted integration to form a unified representation. Finally, Laplacian Regularized Least Squares leverages the global graph structure during prediction, improving generalization and ensuring robust performance. Experimental results show that ADKNN-KFGCN outperforms seven state-of-the-art methods, achieving an AUC of 0.9851±0.0025 and AUPR of 0.9587±0.0032 on the HMDAD dataset. Case studies on rheumatoid arthritis and inflammatory bowel disease further demonstrate its potential to uncover novel associations, provide insights into disease mechanisms, and support therapeutic target discovery.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Computers & Electrical Engineering
Computers & Electrical Engineering 工程技术-工程:电子与电气
CiteScore
9.20
自引率
7.00%
发文量
661
审稿时长
47 days
期刊介绍: The impact of computers has nowhere been more revolutionary than in electrical engineering. The design, analysis, and operation of electrical and electronic systems are now dominated by computers, a transformation that has been motivated by the natural ease of interface between computers and electrical systems, and the promise of spectacular improvements in speed and efficiency. Published since 1973, Computers & Electrical Engineering provides rapid publication of topical research into the integration of computer technology and computational techniques with electrical and electronic systems. The journal publishes papers featuring novel implementations of computers and computational techniques in areas like signal and image processing, high-performance computing, parallel processing, and communications. Special attention will be paid to papers describing innovative architectures, algorithms, and software tools.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信