Temporal Graph Representation Learning for Autism spectrum disorder Brain Networks
Bibliographic record
Abstract
Modeling spatio-temporal dynamics in functional brain networks is critical for underlying the functional mechanism of autism spectrum disorder (ASD). In our study, we propose an end-to-end framework called temporal graph representation learning for brain networks, which thoroughly captures spatio-temporal features in resting-state functional magnetic resonance imaging (rs-fMRI) data. Specifically, we first transform rs-fMRI time-series into temporal multi-graph using a sliding window technique. A temporal multi-graph clustering is then designed to eliminate the inconsistency of the temporal multi-graph series. Then, a graph structure aware LSTM (GSA-LSTM) is proposed to capture the spatio-temporal embedding for temporal graphs. The proposed GSA-LSTM can not only capture discriminative features for prediction but also impute the incomplete graphs for the temporal multi-graph series. Extensive experiments on autism brain imaging data exchange (ABIDE) dataset shows the effectiveness of our proposed framework. The results demonstrate that the proposed dynamic brain network embedding learning outperforms the state of-the-art brain network classification models. Furthermore, the obtained clustering results are consistent with the previous neuroimaging-derived evidence of biomarkers for autism spectrum disorder (ASD).
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.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.002 | 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".