Simultaneous Matrix Diagonalization for Structural Brain Networks Classification
This paper considers the problem of brain disease classification based on connectome data. A connectome is a network representation of a human brain. The typical connectome classification problem is very challenging because of the small sample size and high dimensionality of the data. We propose to use simultaneous approximate diagonalization of adjacency matrices in order to compute their eigenstructures in more stable way. The obtained approximate eigenvalues are further used as features for classification. The proposed approach is demonstrated to be efficient for detection of Alzheimer's disease, outperforming simple baselines and competing with state-of-the-art approaches to brain disease classification.
Code (0)
등록된 구현이 없습니다.
Tasks
ClassificationGeneral ClassificationSimilar Papers 제목 키워드 기반
Diagonalization without Diagonalization: A Direct Optimization Approach for Solid-State Density Functional Theory
We present a novel approach to address the challenges of variable occupation numbers in direct optimization of density functional theory (DFT). By parameterizing both the eigenfunctions and the occupation matrix, our met…
Structural Gaussian mixture vector autoregressive model with application to the asymmetric effects of monetary policy shocks
A structural Gaussian mixture vector autoregressive model is introduced. The shocks are identified by combining simultaneous diagonalization of the reduced form error covariance matrices with constraints on the time-vary…
Enhanced motor imagery-based EEG classification using a discriminative graph Fourier subspace
Dealing with irregular domains, graph signal processing (GSP) has attracted much attention especially in brain imaging analysis. Motor imagery tasks are extensively utilized in brain-computer interface (BCI) systems that…
Brain Computer InterfaceClassificationEEGElectroencephalogram (EEG)+1Towards Faster Matrix Diagonalization with Graph Isomorphism Networks and the AlphaZero Framework
In this paper, we introduce innovative approaches for accelerating the Jacobi method for matrix diagonalization, specifically through the formulation of large matrix diagonalization as a Semi-Markov Decision Process and …
Matrix Diagonalization as a Board Game: Teaching an Eigensolver the Fastest Path to Solution
Matrix diagonalization is at the cornerstone of numerous fields of scientific computing. Diagonalizing a matrix to solve an eigenvalue problem requires a sequential path of iterations that eventually reaches a sufficient…