Graph-Based Approaches to Learning Epileptogenic Zone Localization Using Stereo-EEG Recordings
Organizations: University of Cincinnati, Cincinnati, USA · Dept. of Computer Science University of Cincinnati Cincinnati, USA · Cincinnati Children's Hospital Medical Center, Cincinnati, USA · Dept. of Neurology Cincinnati Children’s Hospital Medical Center Cincinnati, USA ·
Abstract
The epileptogenic zone (EZ) is the brain region that generates seizures in an individual, and is the target of epilepsy surgery. Localizing the EZ from stereo-EEG (sEEG) recordings supports surgical planning, but manual interpretation is time-consuming and focuses on seizure recordings. Graphical learning models of resting-state functional connectivity among the recorded brain regions are an attractive alternative, but depend crucially on the network topology chosen for the model. We present a controlled study of graph-based models to explore how graph topology affects EZ localization from resting-state sEEG in 40 patients. Using the same simple learnable model and leave-one-patient-out evaluation, we compare dense graphs, anatomy- and geometry-informed priors, budgeted sparsification methods, and learned sparsification, including the proposed Region-Bridge- topology. To compare graph constructions fairly, we control the number of incoming edges per node and vary graph sparsity. At edge retention, Region-Bridge- achieves the highest observed mean PR-AUC (; ROC-AUC ) while using fewer edges than Dense (PR-AUC ). Spatial- is competitive, whereas random pruning requires near-dense retention. Learned sparsification benefits from anatomical node metadata but, on average, does not surpass the best fixed prior. Across all topologies, the best choice varies by patient. These results suggest that graph construction should be evaluated explicitly rather than treated as fixed preprocessing.
Figures & tables
| Topology | PR-AUC | ROC-AUC | MCC | Sens. | Spec. | Edge Retention |
|---|---|---|---|---|---|---|
| Dense | ||||||
| Intra-Lead | 0.653(17) | |||||
| Lead-Chain | ||||||
| Intra-Region | 0.694(22) | |||||
| Region-Bridge-c | 0.371(15) | 0.743(10) | 0.221(11) | |||
| Random-k |
| Condition | PR-AUC | ROC-AUC |
|---|---|---|
| Edge-only (no node embedding) | ||
| Edge-only (shuffled edge attributes) | ||
| Node-only (no edges) | ||
| Node-only (shuffled node metadata) |
Graph Structure Learning
Graph structure learning infers or adapts network connections from data for statistical discovery and downstream prediction.
See all 139 papers