Improving fMRI-based Autism Spectrum Disorder Classification with Random Walks-informed Feature Extraction and Selection
Bibliographic record
Abstract
Functional magnetic resonance imaging (fMRI) is a non-invasive technique measuring brain activity by detecting blood flow changes, enabling the study of cognitive processes and brain states. However, the high dimensionality of resting-state (rs) fMRI data poses challenges for machine learning applications. Feature extraction (FE) and feature selection (FS) are critical for developing efficient machine learning models. Transforming raw data into meaningful features and selecting the most relevant ones, allows models to achieve improved generalization, accuracy, and robustness. Previous studies demonstrated the effectiveness of FE and FS methods for analyzing rs-fMRI data for Autism Spectrum Disorder (ASD) classification. In this study, we apply a random walks technique for correlation-based brain networks to extract features from rs-fMRI data, specifically the number of random walkers on each brain area. We then select significant features, i.e., brain areas with a statistically significant difference in the number of random walkers between neurotypical and ASD subjects. Our random walks-based FE and FS approach reduces the number of brain areas used in the classification and converts the functional connectivity matrix into a manageable vector, enabling faster computation. We examined 16 pipelines and tested support vector machines (SVM) and logistic regression for classification, identifying the optimal pipeline to consist of no filtering, no global signal regression (GSR), and FS, achieving a 76.54% classification accuracy with SVM. Our findings suggest that random walks capture a wide range of interactions and dynamics in brain networks, providing a deeper characterization of their structure and function, ultimately enhancing classification performance.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.002 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".