Andersen, Kasper Winther

Hansen, Lars Kai

Madsen, Kristoffer H.

Mørup, Morten

Schmidt, Mikkel Nørgaard

Siebner, Hartwig Roman

Online Research Database In Technology

                       General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights.  • Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal   If you believe that this document breaches copyright please contact us providing details, and we will remove access to the work immediately and investigate your claim.     Downloaded from orbit.dtu.dk on: Dec 20, 2017Community structure in resting state complex networksAndersen, Kasper Winther; Madsen, Kristoffer H.; Siebner, Hartwig Roman; Schmidt, Mikkel Nørgaard;Mørup, Morten; Hansen, Lars KaiPublication date:2014Document VersionPublisher's PDF, also known as Version of recordLink back to DTU OrbitCitation (APA):Andersen, K. W., Madsen, K. H., Siebner, H. R., Schmidt, M. N., Mørup, M., & Hansen, L. K. (2014). Communitystructure in resting state complex networks. Abstract from 20th Annual Meeting of the Organization for HumanBrain Mapping, Hamburg, Germany.Community structure in resting state complex networksKasper Winther Andersen1,2; Kristoffer H. Madsen2; Hartwig Roman Siebner2,3,4; Mikkel N. Schmidt1; Morten Mørup1; Lars Kai Hansen11: Department of Applied Mathematics and Computer Science, Technical University of Denmark, Matematiktorvet, Bygning 303 B, 2800 Kgs. Lyngby, Denmark2: Danish Research Centre for Magnetic Resonance, Centre for Functional and Diagnostic Imaging and Research, Copenhagen University Hospital Hvidovre, Kettegaard Alle 30, 2650 Hvidovre, Denmark3: Department of Clinical Medicine, Faculty of Health and Medical Sciences, University of Copenhagen, Blegdamsvej 3B, 2200 København N, Denmark4: Department of Neurology, Copenhagen University Hospital Bispebjerg, Bispebjerg Bakke 23, 2400 København NV, DenmarkAnalysis of resting state functional magnetic resonance imaging (rs-fMRI) using graph theory is of increasing interest. Here, brain regions are represented as nodes and links between nodes are present if the statistical dependence of the time courses exceeds a given threshold. So-called communities can be found as clusters of nodes with high internal linking and sparse linking to the rest of the network and the degree to which a network can be divided into such communities can be measured using the modularity index [1]. Modularity has shown to be related to e.g.normal aging [2], working memory [3], and motor learning [4]. However, it is still unknown whether modularity reflects the best grouping of nodes. Here we use the Infinite Relational Model (IRM) [5,6] and two constrained variants thereof and test their clustering reproducibility and ability to predict unseen data.Three rs-fMRI datasets were used. The Copenhagen set was acquired locally and consists of 30 healthy controls (HC), TR=2.49s, 480 vol. In addition we used two datasets from the FCON1000 database. The Leipzig set consists of 37 HC, TR=2.3s, 195 vol. and Beijing Zhang part2 sets consists of 42 HC, TR=2s, and 225 vol. Data preprocessing included realignment and normalization to MNI305 space. The Copenhagen data was filtered using physiological (cardiac, respiration, motion) regressors [7]. The mean time series for each of the 116 brain regions included in the AAL atlas [8] was extracted for each subject and their correlation matrix was formed. The brain networks were created by thresholding these matrices individually to maintain the top d-percent links (Fig. 1). IRM is a nonparametric Bayesian Network model, which can be used to infer node clustering. Contrary to modularity, the IRM models both within-cluster and between-cluster link probabilities. Therefore nodes with a high internal linking could in fact be clustered separately if their relation to other clusters is different. By placing a Chinese Restaurant Process (CRP) prior on the node partitioning the number of clusters is determined during the model inference. A Beta distribution is used as prior for the cluster link probabilities, these probabilities can however be integrated out and thus model inference only involves sampling the node cluster assignments using Markov chain Monte Carlo. Here we seek common node clustering and cluster link probabilities over subjects. In addition we consider two constrained versions of the IRM. The Bayesian Community Detection (BCD) [9], which for a given cluster restricts between-cluster link probabilities to be strictly lower than the within-cluster link probability. The Infinite Diagonal Model (IDM) allows individual within-cluster probabilities but restricts all between-cluster link probabilities to be equal. IDM can thus be seen as a probabilistic version of modularity. The NPAIRS [10] split-half framework was used to evaluate the models predictability and reproducibility for different graph link densities (2, 4, 8, 16, and 32%). Predictability was measured using test likelihood of data from one split when the model was trained on the other split. Predictability was calculated as the normalized mutual information between node partitions of the two splits.For all link densities and datasets investigated BCD and IRM showed clearly better predictability than IDM and BCD had better or on par predictability compared with IRM (Fig. 2). For link densities greater than 4% IRM and BCD had higher reproducibility than IDM, and BCD had better or on par reproducibility compared with IRM.Resting state organization in fMRI networks is consistent with a model based on community structure. Modelling between-cluster linking significantly increases predictability and reproducibility. Node partitioning and link probabilities together represent a compressed description of the network, which allows for group inference, behavioral measures correlation, and is a potential new expressive bio-marker.Figure 1Figure 2References[1] Newman, M. (2004), Finding and evaluating community structure in networks. Physical Review E, 69(2), 026113.[2] Meunier, D. (2009), ‘Age-related changes in modular organization of human brain functional networks’,  NeuroImage, 44(3), 715–23.[3] Stevens, A. A. (2012), ‘Functional brain network modularity captures inter- and intra-individual variation in working memory capacity’, PloS one, 7(1), e30468.[4] Bassett, D. S. (2011), ‘Dynamic reconfiguration of human brain networks during learning’, Proceedings of the National Academy of Sciences of the United States of America, 108(18), 7641–6.[5] Kemp, C. (2006), ‘Learning systems of concepts with an infinite relational model’, In Proceedings of the 21th National Conference on Artificial Intelligence (AAAI) (pp. 381–388).[6] Xu, Z. (2006), ‘Infinite hidden relational models’. In In Proceedings of the 22nd International Conference on Uncertainity in Artificial Intelligence (UAI). [7] Glover, G. H. (2000), ‘Image-based method for retrospective correction of physiological motion effects in fMRI: RETROICOR’, Magnetic Resonance in Medicine, 44(1), 162–167.[8] Tzourio-Mazoyer, N. (2002), ‘Automated anatomical labeling of activations in SPM usinga macroscopic anatomical parcellation of the MNI MRI single-subject brain’. Neuroimage,15(1), 273–89.[9] Mørup, M. (2012), ’Bayesian community detection’, Neural computation, 24(9), 2434–56.[10] Strother, S. C. (2002), ‘The quantitative evaluation of functional neuroimaging experiments: the NPAIRS data analysis framework’, NeuroImage, 15(4), 747–71.

Community structure in resting state complex networks

http://orbit.dtu.dk/ws/files/101895629/andersen2014hbm.pdf

Community structure in resting state complex networks

Abstract

Similar works

Full text

Available Versions

Online Research Database In Technology