.png){kind=icon}
返回
The conjunctive disjunctive graph node kernel for disease gene prioritization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2018.01.089.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Disease gene prioritization plays an important role in disclosing the relation between genes and diseases and it has attracted much research. As a consequence, a high number of disease gene prioritization methods have been proposed. Among them, graph-based methods are the most promising paradigms due to their ability to naturally represent many types of relations using a graph representation. One key factor of success of graph-based learning methods is the definition of a proper graph node similarity measure normally measured by graph node kernels. However, most approaches share two common limitations: first, they are based on the diffusion phenomenon which does not effectively exploit the nodes' context; second, they are not able to process the auxiliary information associated to graph nodes. In this paper, we propose an efficient graph node kernel, based on graph decompositions, that not only is able to effectively take into account nodes' context, but also to exploit additional information available on graph nodes. The key idea is to learn and generalize from small network fragments present in the neighborhood of genes of interest. An empirical evaluation on several biological databases shows that our proposal achieves state-of-the-art results. (C) 2018 Elsevier B.V. All rights reserved.
Keyword:
Graph node kernels
Graph decomposition
Disease gene prioritization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
The Gene Ontology (GO) database and informatics resource基因本体论 (GO) 数据库和信息学资源.png)
NUCLEIC ACIDS RESEARCH
OAAI
NUCLEIC ACIDS RESEARCHIF13.1
OAAI分享收藏Computational approaches to disease-gene prediction: rationale, classification and successes疾病基因预测的计算方法: 原理，分类和成功FEBS JOURNALOAAI
FEBS JOURNALIF4.2
OAAI分享收藏分享收藏
查看更多内容