ID-GBA: Subgraph Extension With Information Distance Guilt by Association in Complex Networks

ID-GBA:基于信息距离的子图扩展方法在复杂网络中的关联定罪

阅读:2

Abstract

Here, we introduce the ID-GBA (Information Distance Guilt By Association) method to expand highly connected sets of nodes by deploying a novel algorithm for subgraph extension based on the guilt-by-association principle and information distance. In this study, ID-GBA was utilized to expand disease clusters, and identify novel disease genes. We first validate its ability to expand related disease sets from disease/disease graphs built using Open Targets' gene association scores. We then analyze disease/control gene expression networks and show that ID-GBA recaptures known disease genes in nine disease/control graphs. Compared to existing methods such as Random Walk with Restarts and Personalized PageRank, ID-GBA achieves significantly higher Normalized Discounted Cumulative Gain scores, which indicates superior predictive performance at capturing known disease genes. Additionally, unlike other approaches that require users to specify either a threshold parameter or a fixed number of nodes to include in the extended subgraph, ID-GBA includes a built-in, automated, and data-driven thresholding mechanism. These results establish ID-GBA as a novel open-source tool to uncover hidden relationships in gene/gene, disease/disease, and other complex networks.

特别声明

1、本页面内容包含部分的内容是基于公开信息的合理引用;引用内容仅为补充信息,不代表本站立场。

2、若认为本页面引用内容涉及侵权,请及时与本站联系,我们将第一时间处理。

3、其他媒体/个人如需使用本页面原创内容,需注明“来源:[生知库]”并获得授权;使用引用内容的,需自行联系原作者获得许可。

4、投稿及合作请联系:info@biocloudy.com。