Ranking Regions, Edges and Classifying Tasks in Functional Brain Graphs by Sub-Graph Entropy

Bhaskar Sen, Shu Hsien Chu, Keshab K Parhi

Research output: Contribution to journalArticle

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.

Original languageEnglish (US)
Article number7628
JournalScientific reports
Volume9
Issue number1
DOIs
StatePublished - Dec 1 2019

Fingerprint

Entropy
Brain
Gambling
Emotions
Connectome
Magnetic Resonance Imaging
Uncertainty
Weights and Measures

PubMed: MeSH publication types

  • Journal Article

Cite this

Ranking Regions, Edges and Classifying Tasks in Functional Brain Graphs by Sub-Graph Entropy. / Sen, Bhaskar; Chu, Shu Hsien; Parhi, Keshab K.

In: Scientific reports, Vol. 9, No. 1, 7628, 01.12.2019.

Research output: Contribution to journalArticle

@article{89ea7adc1217435392992a5eea2780cf,
title = "Ranking Regions, Edges and Classifying Tasks in Functional Brain Graphs by Sub-Graph Entropy",
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.",
author = "Bhaskar Sen and Chu, {Shu Hsien} and Parhi, {Keshab K}",
year = "2019",
month = "12",
day = "1",
doi = "10.1038/s41598-019-44103-8",
language = "English (US)",
volume = "9",
journal = "Scientific Reports",
issn = "2045-2322",
publisher = "Nature Publishing Group",
number = "1",

}

TY - JOUR

T1 - Ranking Regions, Edges and Classifying Tasks in Functional Brain Graphs by Sub-Graph Entropy

AU - Sen, Bhaskar

AU - Chu, Shu Hsien

AU - Parhi, Keshab K

PY - 2019/12/1

Y1 - 2019/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85066017294&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85066017294&partnerID=8YFLogxK

U2 - 10.1038/s41598-019-44103-8

DO - 10.1038/s41598-019-44103-8

M3 - Article

C2 - 31110317

AN - SCOPUS:85066017294

VL - 9

JO - Scientific Reports

JF - Scientific Reports

SN - 2045-2322

IS - 1

M1 - 7628

ER -