Name
Title | ||
|---|---|---|
Extracting the Core Structural Connectivity Network: Guaranteeing Network Connectedness Through a Graph-Theoretical Approach. |
Abstract | ||
|---|---|---|
We present a graph-theoretical algorithm to extract the connected core structural connectivity network of a subject population. Extracting this core common network across subjects is a main problem in current neuroscience. Such network facilitates cognitive and clinical analyses by reducing the number of connections that need to be explored. Furthermore, insights into the human brain structure can be gained by comparing core networks of different populations. We show that our novel algorithm has theoretical and practical advantages. First, contrary to the current approach our algorithm guarantees that the extracted core subnetwork is connected agreeing with current evidence that the core structural network is tightly connected. Second, our algorithm shows enhanced performance when used as feature selection approach for connectivity analysis on populations. |
Year | Venue | Field |
|---|---|---|
2016 | MICCAI | Graph theory,Population,Graph,Social connectedness,Feature selection,Computer science,Theoretical computer science,Subnetwork |
DocType | Citations | PageRank |
Conference | 1 | 0.38 |
References | Authors | |
3 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Demian Wassermann | 1 | 76 | 11.03 |
| Dorian Mazauric | 2 | 82 | 13.34 |
| Guillermo Gallardo-Diez | 3 | 1 | 0.38 |
| Rachid Deriche | 4 | 4903 | 633.65 |