2016 IEEE 16th International Conference on Data Mining Workshops (ICDMW) 2016
DOI: 10.1109/icdmw.2016.0023
|View full text |Cite
|
Sign up to set email alerts
|

Classification of Normal and Pathological Brain Networks Based on Similarity in Graph Partitions

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
6
0

Year Published

2017
2017
2022
2022

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 8 publications
(6 citation statements)
references
References 11 publications
0
6
0
Order By: Relevance
“…Each node represented a different time window of DFNs, and the different edges indicated the correlations between the corresponding time windows of DFNs. We utilized the Frobenius norm for distance measurement to calculate the similarity between networks ( Kurmukov et al, 2016 ), and the distance measure was inversely proportional to similarity. The calculation formula is as follows:…”
Section: Methodsmentioning
confidence: 99%
“…Each node represented a different time window of DFNs, and the different edges indicated the correlations between the corresponding time windows of DFNs. We utilized the Frobenius norm for distance measurement to calculate the similarity between networks ( Kurmukov et al, 2016 ), and the distance measure was inversely proportional to similarity. The calculation formula is as follows:…”
Section: Methodsmentioning
confidence: 99%
“…The Frobenius norm of the difference between a pair of networks is given by (Kurmukov, Dodonova, & Zhukov, 2016).…”
Section: Recurrence Plots and Distance Measuresmentioning
confidence: 99%
“…First, we used the Frobenius norm of the difference between a pair of networks, which is given by (Kurmukov et al, 2016)…”
Section: Recurrence Plots and Distance Measuresmentioning
confidence: 99%
“…The problem of brain network classification has been paid much attention recently [17,9,21,19,18]. This problem is non-trivial as most modern classification algorithms can work only with vectorial data while in our case each object in the dataset is represented by graph.…”
Section: Existing Approachesmentioning
confidence: 99%
“…By community structure we mean the existence of groups of nodes that are much more strongly linked inside the group compared to the rest of the graph. We note that the community detection approach has been recently used for connectome classification [19,18], where a certain kernel function was used to measure similarity between graph partitions, which were again obtained independently for each graph.…”
Section: Existing Approachesmentioning
confidence: 99%