arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2003.13620cs.LG

Latent-Graph Learning for Disease Prediction

University of Lugano(卢加诺大学);Sapienza University of Rome(罗马大学);Technical University of Munich(慕尼黑工业大学);Ludwig Maximilians Universität München(慕尼黑大学);Johns Hopkins University(约翰斯·霍普金斯大学);Imperial College London(帝国理工学院);Twitter(推特)

Luca Cosmo, Anees Kazi, Seyed-Ahmad Ahmadi, Nassir Navab, Michael Bronstein

英文摘要:

Recently, Graph Convolutional Networks (GCNs) have proven to be a powerful machine learning tool for Computer-Aided Diagnosis (CADx) and disease prediction. A key component in these models is to build a population graph, where the graph adjacency matrix represents pair-wise patient similarities. Until now, the similarity metrics have been defined manually, usually based on meta-features like demographics or clinical scores. The definition of the metric, however, needs careful tuning, as GCNs are very sensitive to the graph structure. In this paper, we demonstrate for the first time in the CADx domain that it is possible to learn a single, optimal graph towards the GCN's downstream task of disease classification. To this end, we propose a novel, end-to-end trainable graph learning architecture for dynamic and localized graph pruning. Unlike commonly employed spectral GCN approaches, our GCN is spatial and inductive, and can thus infer previously unseen patients as well. We demonstrate significant classification improvements with our learned graph on two CADx problems in medicine. We further explain and visualize this result using an artificial dataset, underlining the importance of graph learning for more accurate and robust inference with GCNs in medical applications.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑