Graph-in-Graph (GiG): Learning interpretable latent graphs in non-Euclidean domain for biological and healthcare applications

被引:4
作者
Zaripova, Kamilia [1 ]
Cosmo, Luca [2 ,3 ]
Kazi, Anees [7 ]
Ahmadi, Seyed-Ahmad [4 ]
Bronstein, Michael M. [6 ]
Navab, Nassir [1 ,5 ]
机构
[1] Tech Univ Munich, Dept Comp Sci, Munich, Germany
[2] CaFoscari Univ Venice, Dept Environm Sci Informat & Stat, Venice, Italy
[3] USI Univ Lugano, Informat Dept, Lugano, Switzerland
[4] NVIDIA, Munich, Germany
[5] Johns Hopkins Univ, Whiting Sch Engn, Baltimore, MD USA
[6] Univ Oxford, Oxford, England
[7] Harvard Med Sch, Massachusetts Gen Hosp, Athinoula A Martinos Ctr Biomed Imaging, Boston, MA USA
关键词
Graph deep learning; Knowledge discovery; INDEPENDENT COMPONENT ANALYSIS; CLASSIFICATION;
D O I
10.1016/j.media.2023.102839
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Graphs are a powerful tool for representing and analyzing unstructured, non-Euclidean data ubiquitous in the healthcare domain. Two prominent examples are molecule property prediction and brain connectome analysis. Importantly, recent works have shown that considering relationships between input data samples has a positive regularizing effect on the downstream task in healthcare applications. These relationships are naturally modeled by a (possibly unknown) graph structure between input samples. In this work, we propose Graph-in-Graph (GiG), a neural network architecture for protein classification and brain imaging applications that exploits the graph representation of the input data samples and their latent relation. We assume an initially unknown latent-graph structure between graph-valued input data and propose to learn a parametric model for message passing within and across input graph samples, end-to-end along with the latent structure connecting the input graphs. Further, we introduce a Node Degree Distribution Loss (NDDL) that regularizes the predicted latent relationships structure. This regularization can significantly improve the downstream task. Moreover, the obtained latent graph can represent patient population models or networks of molecule clusters, providing a level of interpretability and knowledge discovery in the input domain, which is of particular value in healthcare.
引用
收藏
页数:13
相关论文
共 115 条
[1]  
Agarap A. F., 2018, arXiv, DOI DOI 10.48550/ARXIV.1803.08375
[2]   Optuna: A Next-generation Hyperparameter Optimization Framework [J].
Akiba, Takuya ;
Sano, Shotaro ;
Yanase, Toshihiko ;
Ohta, Takeru ;
Koyama, Masanori .
KDD'19: PROCEEDINGS OF THE 25TH ACM SIGKDD INTERNATIONAL CONFERENCCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2019, :2623-2631
[3]  
Baek J, 2021, INT C LEARNING REPRE
[4]   Identifying Biological Pathway Interrupting Toxins Using Multi-Tree Ensembles [J].
Barta, Gergo .
FRONTIERS IN ENVIRONMENTAL SCIENCE, 2016, 4
[5]   Probabilistic independent component analysis for functional magnetic resonance imaging [J].
Beckmann, CF ;
Smith, SA .
IEEE TRANSACTIONS ON MEDICAL IMAGING, 2004, 23 (02) :137-152
[6]  
Bessadok A., 2019, MED IMAGE COMPUTING
[7]   Brain graph synthesis by dual adversarial domain alignment and target graph prediction from a source graph [J].
Bessadok, Alaa ;
Mahjoub, Mohamed Ali ;
Rekik, Islem .
MEDICAL IMAGE ANALYSIS, 2021, 68
[8]   Hierarchical Adversarial Connectomic Domain Alignment for Target Brain Graph Prediction and Classification from a Source Graph [J].
Bessadok, Alaa ;
Mahjoub, Mohamed Ali ;
Rekik, Islem .
PREDICTIVE INTELLIGENCE IN MEDICINE (PRIME 2019), 2019, 11843 :105-114
[9]   Classifying Me Softly: A Novel Graph Neural Network Based on Features Soft-Alignment [J].
Bicciato, Alessandro ;
Cosmo, Luca ;
Minello, Giorgia ;
Rossi, Luca ;
Torsello, Andrea .
STRUCTURAL, SYNTACTIC, AND STATISTICAL PATTERN RECOGNITION, S+SSPR 2022, 2022, 13813 :43-53
[10]   Protein function prediction via graph kernels [J].
Borgwardt, KM ;
Ong, CS ;
Schönauer, S ;
Vishwanathan, SVN ;
Smola, AJ ;
Kriegel, HP .
BIOINFORMATICS, 2005, 21 :I47-I56