ArticleScientific reports2019
Ranking Regions, Edges and Classifying Tasks in Functional Brain Graphs by Sub-Graph Entropy.
Article in Scientific reports, 2019. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 7 papers, 1 of them a synthesis that pooled it.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
7 citing papers in PubMed, 1 synthesis or guideline pooled it.
- A comprehensive analysis of brain network complexity in task-based fMRI using entropy: systematic review.Brain imaging and behavior · 2026Pooled it
- When Randomness Becomes Rigid: Dynamic Connectivity Entropy and Symptom-Linked Network Dysfunction in Schizophrenia.bioRxiv : the preprint server for biology · 2026Article
- Assessing the impact of sampling bias on node centralities in synthetic and biological networks.NPJ systems biology and applications · 2025Article
- Graph models of brain state in deep anesthesia reveal sink state dynamics of reduced spatiotemporal complexity.Network neuroscience (Cambridge, Mass.) · 2025Article
- Deep Relational Reasoning for the Prediction of Language Impairment and Postoperative Seizure Outcome Using Preoperative DWI Connectome Data of Children With Focal Epilepsy.IEEE transactions on medical imaging · 2021Article
- Stepwise target controllability identifies dysregulations of macrophage networks in multiple sclerosis.Network neuroscience (Cambridge, Mass.) · 2021Article
- Sub-graph entropy based network approaches for classifying adolescent obsessive-compulsive disorder from resting-state functional MRI.NeuroImage. Clinical · 2020Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
3 authors.
Funding
No grant is acknowledged in the PubMed record.
Abstract
This paper considers analysis of human brain networks or graphs constructed from time-series collected from functional magnetic resonance imaging (fMRI). In the network of time-series, the nodes describe the regions and the edge weights correspond to the absolute values of correlation coefficients of the time-series of the two nodes associated with the edges. The paper introduces a novel information-theoretic metric, referred as sub-graph entropy, to measure uncertainty associated with a sub-graph. Nodes and edges constitute two special cases of sub-graph structures. Node and edge entropies are used in this paper to rank regions and edges in a functional brain network. The paper analyzes task-fMRI data collected from 475 subjects in the Human Connectome Project (HCP) study for gambling and emotion tasks. The proposed approach is used to rank regions and edges associated with these tasks. The differential node (edge) entropy metric is defined as the difference of the node (edge) entropy corresponding to two different networks belonging to two different classes. Differential entropy of nodes and edges are used to rank top regions and edges associated with the two classes of data. Using top node and edge entropy features separately, two-class classifiers are designed using support vector machine (SVM) with radial basis function (RBF) kernel and leave-one-out method to classify time-series for emotion task vs. no-task, gambling task vs. no-task and emotion task vs. gambling task. Using node entropies, the SVM classifier achieves classification accuracies of 0.96, 0.97 and 0.98, respectively. Using edge entropies, the classifier achieves classification accuracies of 0.91, 0.96 and 0.94, respectively.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.