.png){kind=icon}
返回
Robust graph learning for classification
.png){kind=icon}
PRE
AI
DOI：10.1016/j.sigpro.2023.109120.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We present an algorithm for inferring an unknown graph from time-indexed signals corresponding to the graph nodes. The signals are assumed to consist of a few dominant, yet unknown, frequencies within the graph spectrum, consistent across all time points, as well as sparse, potentially temporally incoherent corruptions. These corruptions may serve as relevant features for classification in neurological applica-tions. We apply our algorithm to neuropsychiatric datasets, including ADHD , OPEN-NEURO , and COBRE , in order to learn graphs for patients and controls. The learned graphs, used as features for classification, result in higher classification accuracy compared to existing graph learning methods. Furthermore, our proposed model generates more connected or small-world networks, consistent with previous findings on brain networks. We also demonstrate that the proposed model achieves a better separation between patient and control classes. & COPY; 2023 Elsevier B.V. All rights reserved.
Keyword:
Graph signal processing
Graph learning
Functional connectivity
Optimization
期刊
IF:
3.6
论文数:
10.0K
被引数:
1.7W
机构
引用论文
分享收藏Compression and Air Storage Systems for Small Size CAES Plants: Design and Off-design Analysis小型CAES工厂的压缩和空气存储系统: 设计和非设计分析
OAAI
OAAI分享收藏分享收藏分享收藏Graph Signal Processing: Overview, Challenges, and Applications图信号处理: 概述、挑战与应用.png)
PROCEEDINGS OF THE IEEEOAAI
PROCEEDINGS OF THE IEEEIF25.9
OAAI分享收藏
查看更多内容