2019 IEEE 16th International Symposium on Biomedical Imaging (ISBI 2019) 2019
DOI: 10.1109/isbi.2019.8759593
|View full text |Cite
|
Sign up to set email alerts
|

Network Regularization in Imaging Genetics Improves Prediction Performances and Model Interpretability on Alzheimer’s Disease

Abstract: Imaging-genetics is a growing popular research avenue which aims to find genetic variants associated with quantitative phenotypes that characterize a disease. In this work, we combine structural MRI with genetic data structured by prior knowledge of interactions in a Canonical Correlation Analysis (CCA) model with graph regularization. This results in improved prediction performance and yields a more interpretable model.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 16 publications
0
2
0
Order By: Relevance
“…Graph-net 10 , similar to SCCAN 11 , 12 , uses ℓ 1 regularization to constrain embedding vectors to be sparse and reduce over-fitting in high-dimensional problems. Relatedly, graph-regularization has been used to improve prediction in imaging genetics 10 , 13 , 14 and may be combined with canonical correlation analysis (as in SCCAN 11 ). Non-negative factorization methods provide a second degree of interpretability by guaranteeing that factorizations are unsigned and, therefore, these methods allow components to be interpreted in terms of their original units (e.g.…”
Section: Introductionmentioning
confidence: 99%
“…Graph-net 10 , similar to SCCAN 11 , 12 , uses ℓ 1 regularization to constrain embedding vectors to be sparse and reduce over-fitting in high-dimensional problems. Relatedly, graph-regularization has been used to improve prediction in imaging genetics 10 , 13 , 14 and may be combined with canonical correlation analysis (as in SCCAN 11 ). Non-negative factorization methods provide a second degree of interpretability by guaranteeing that factorizations are unsigned and, therefore, these methods allow components to be interpreted in terms of their original units (e.g.…”
Section: Introductionmentioning
confidence: 99%
“…The problem expressed in Equation (2) belongs to a class of multiconvex optimization problems with nonsmooth constraints. The feasibility of the using of the GraphNet penalty with the SGCCA framework has already been presented by Guigui et al (2019) . Multiple solvers for this problem have been proposed and studied ( Hadj-Selem et al 2018 ).…”
Section: Methodsmentioning
confidence: 99%