mlsanityData to 7 Oct 2026

M-LINKX: Multiview Graph Learning for Brain Cognitive Disease Detection

arXiv 2608.14847 ↗First posted 14 Aug 2026cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Electroencephalogram (EEG) is a non-invasive and relatively low-cost procedure that measures brain electricity for the detection of cognitive diseases. EEG-based classification of dementia-related conditions, including Alzheimer's disease (AD), mild cognitive impairment (MCI), and frontotemporal dementia (FTD), remains challenging because EEG signals are noisy, non-stationary, and vary across subjects. Segment-based learning provides a practical way to model long EEG recordings by converting them into fixed-length inputs. For each segment, discriminative information may be explored by using signals within each channel (i.e. electrode), as well as interactions between EEG channels. In this paper, we propose M-LINKX, a multi-view graph learning framework for EEG-based dementia classification. For each segment, we extract channel-level node features and construct multiple functional-connectivity (FC) graph views, where each view is defined by a specific combination of connectivity metric, frequency band, and topology filter, respectively. Instead of relying on message passing over the constructed graphs, M-LINKX follows a simple design in modeling node features and adjacency-based connectivity representations. The graph-view representations are fused using global trainable view weights, and subject-level prediction is obtained by averaging segment-level probabilities. Experiments on two three-class EEG datasets with different diagnostic groups, CAUEEG (HC/MCI/Dementia) and AHEAP (HC/AD/FTD), show that M-LINKX achieves the best subject-level performance under the main experimental settings. Our study suggests that multi-view functional connectivity can improve EEG-based dementia classification when integrated with an appropriate graph-learning architecture. Code and data are available at https://github.com/anphantt/MLINKX.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 3 of its 36 references that are in the map. First posted on arXiv 14 Aug 2026.

Builds on

3 of 36 references.

References · 3

  1. 2021How Attentive are Graph Attention Networks?cited by 818
  2. 2021Large Scale Learning on Non-Homophilous Graphs: New Benchmarks and Strong Simple Methodscited by 309
  3. 2020AM-GCN: Adaptive Multi-channel Graph Convolutional Networkscited by 121

Built on by

Not cited yet.