Structure-Preserving Graph Kernel for Brain Network Classification
원문 초록
This paper presents a novel graph-based kernel learning approach for connectome analysis. Specifically, we demonstrate how to leverage the naturally available structure within the graph representation to encode prior knowledge in the kernel. We first proposed a matrix factorization to directly extract structural features from natural symmetric graph representations of connectome data. We then used them to derive a structure-persevering graph kernel to be fed into the support vector machine. The proposed approach has the advantage of being clinically interpretable. Quantitative evaluations on challenging HIV disease classification (DTI- and fMRI-derived connectome data) and emotion recognition (EEG-derived connectome data) tasks demonstrate the superior performance of our proposed methods against the state-of-the-art. Results showed that relevant EEG-connectome information is primarily encoded in the alpha band during the emotion regulation task.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Channel-Imposed Fusion: A Simple yet Effective Method for Medical Time Series Classification
EEG-based Emotion Recognition via Efficient Convolutional Neural Network and Contrastive Learning
EEG-Based Emotion Recognition Using Genetic Algorithm Optimized Multi-Layer Perceptron
Classification of Hand-Grasp Movements of Stroke Patients using EEG Data
FOIT: Fast Online Instance Transfer for Improved EEG Emotion Recognition
Imagined speech classification using EEG
토론
이 논문과 연결된 포럼 글이 아직 없습니다.