Integrating Visualised Automatic Temporal Relation Graph into Multi-Task Learning for Alzheimer's Disease Progression Prediction

被引:0
作者
Zhou, Menghui [1 ,2 ]
Wang, Xulong [2 ]
Liu, Tong [2 ]
Yang, Yun [3 ,4 ]
Yang, Po [2 ]
机构
[1] Yunnan Univ, Dept Software, Kunming 674199, Peoples R China
[2] Univ Sheffield, Dept Comp Sci, Sheffield S10 2TT, England
[3] Yunnan Univ, Yunnan Key Lab Software Engn, Kunming 674199, Peoples R China
[4] Yunnan Univ, Dept Software, Kunming 674199, Peoples R China
基金
中国国家自然科学基金;
关键词
Task analysis; Multitasking; Magnetic resonance imaging; Biomarkers; Predictive models; Learning systems; Analytical models; Alzheimer's disease; automatic temporal relation graph; multi-task learning; disease progression; COGNITIVE IMPAIRMENT; MRI;
D O I
10.1109/TKDE.2024.3385712
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Alzheimer's disease (AD), the most prevalent dementia, gradually reduces the cognitive abilities of patients while also posing a significant financial burden on the healthcare system. A variety of multi-task learning methods have recently been proposed in order to identify potential MRI-related biomarkers and accurately predict the progression of AD. These methods, however, all use a predefined task relation structure that is rigid and insufficient to adequately capture the intricate temporal relations among tasks. Instead, we propose a novel mechanism for directly and automatically learning the temporal relation and constructing it as an Automatic Temporal relation Graph (AutoTG). We use the sparse group Lasso to select a universal MRI feature set for all tasks and particular sets for various tasks in order to find biomarkers that are useful for predicting the progression of AD. To solve the biconvex and non-smooth objective function, we adopt the alternating optimization and show that the two related sub-optimization problems are amenable to closed-form solution of the proximal operator. To solve the two problems efficiently, the accelerated proximal gradient method is used, which has the fastest convergence rate of any first-order method. We have preprocessed three latest AD datasets, and the experimental results verify our proposed novel multi-task approach outperforms several baseline methods. To demonstrate the high interpretability of our approach, we visualise the automatically learned temporal relation graph and investigate the temporal patterns of the important MRI features.
引用
收藏
页码:5206 / 5220
页数:15
相关论文
共 52 条
  • [1] Altay F, 2021, AAAI CONF ARTIF INTE, V35, P15088
  • [2] 2021 Alzheimer's disease facts and figures
    不详
    [J]. ALZHEIMERS & DEMENTIA, 2021, 17 (03) : 327 - 406
  • [3] [Anonymous], 2011, Malsar: Multi-task learning via structural regularization
  • [4] A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
    Beck, Amir
    Teboulle, Marc
    [J]. SIAM JOURNAL ON IMAGING SCIENCES, 2009, 2 (01): : 183 - 202
  • [5] Distributed optimization and statistical learning via the alternating direction method of multipliers
    Boyd S.
    Parikh N.
    Chu E.
    Peleato B.
    Eckstein J.
    [J]. Foundations and Trends in Machine Learning, 2010, 3 (01): : 1 - 122
  • [6] Boyd SP., 2004, CONVEX OPTIMIZATION, DOI [DOI 10.1017/CBO9780511804441, 10.1017/CBO9780511804441]
  • [7] Sparse shared structure based multi-task learning for MRI based cognitive performance prediction of Alzheimer's disease
    Cao, Peng
    Shan, Xuanfeng
    Zhao, Dazhe
    Huang, Min
    Zaiane, Osmar
    [J]. PATTERN RECOGNITION, 2017, 72 : 219 - 235
  • [8] Chan KHR, 2022, J MACH LEARN RES, V23, P1
  • [9] Relating one-year cognitive change in mild cognitive impairment to baseline MRI features
    Duchesne, Simon
    Caroli, Anna
    Geroldi, Cristina
    Collins, D. Louis
    Frisoni, Giovanni B.
    [J]. NEUROIMAGE, 2009, 47 (04) : 1363 - 1370
  • [10] Prognosis and Diagnosis of Parkinson's Disease Using Multi-Task Learning
    Emrani, Saba
    McGuirk, Anya
    Xiao, Wei
    [J]. KDD'17: PROCEEDINGS OF THE 23RD ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2017, : 1457 - 1466