Clustering Coefficients for Correlation Networks

被引:66
|
作者
Masuda, Naoki [1 ]
Sakaki, Michiko [2 ,3 ]
Ezaki, Takahiro [4 ]
Watanabe, Takamitsu [5 ]
机构
[1] Univ Bristol, Dept Engn Math, Bristol, Avon, England
[2] Univ Reading, Sch Psychol & Clin Language Sci, Reading, Berks, England
[3] Kochi Univ Technol, Res Inst, Kochi, Japan
[4] Japan Sci & Technol Agcy, PRESTO, Kawaguchi, Saitama, Japan
[5] UCL, Inst Cognit Neurosci, London, England
基金
日本学术振兴会;
关键词
network neuroscience; clustering coefficient; functional connectivity; partial correlation; partial mutual information; aging; BRAIN FUNCTIONAL NETWORKS; SMALL-WORLD; CONNECTIVITY NETWORKS; TOPOLOGICAL PATTERNS; GLOBAL SIGNAL; AGE; ORGANIZATION; SCHIZOPHRENIA; ARCHITECTURE; REGRESSION;
D O I
10.3389/fninf.2018.00007
中图分类号
Q [生物科学];
学科分类号
07 ; 0710 ; 09 ;
摘要
Graph theory is a useful tool for deciphering structural and functional networks of the brain on various spatial and temporal scales. The clustering coefficient quantifies the abundance of connected triangles in a network and is a major descriptive statistics of networks. For example, it finds an application in the assessment of small-worldness of brain networks, which is affected by attentional and cognitive conditions, age, psychiatric disorders and so forth. However, it remains unclear how the clustering coefficient should be measured in a correlation-based network, which is among major representations of brain networks. In the present article, we propose clustering coefficients tailored to correlation matrices. The key idea is to use three-way partial correlation or partial mutual information to measure the strength of the association between the two neighboring nodes of a focal node relative to the amount of pseudo-correlation expected from indirect paths between the nodes. Our method avoids the difficulties of previous applications of clustering coefficient (and other) measures in defining correlational networks, i.e., thresholding on the correlation value, discarding of negative correlation values, the pseudo-correlation problem and full partial correlation matrices whose estimation is computationally difficult. For proof of concept, we apply the proposed clustering coefficient measures to functional magnetic resonance imaging data obtained from healthy participants of various ages and compare them with conventional clustering coefficients. We show that the clustering coefficients decline with the age. The proposed clustering coefficients are more strongly correlated with age than the conventional ones are. We also show that the local variants of the proposed clustering coefficients (i.e., abundance of triangles around a focal node) are useful in characterizing individual nodes. In contrast, the conventional local clustering coefficients were strongly correlated with and therefore may be confounded by the node's connectivity. The proposed methods are expected to help us to understand clustering and lack thereof in correlational brain networks, such as those derived from functional time series and across-participant correlation in neuroanatomical properties.
引用
收藏
页数:13
相关论文
共 50 条
  • [21] Analysis of Clustering Coefficients of Online Social Networks by Duplication Models
    Lee, Duan-Shin
    Chang, Cheng-Shang
    Ye, Wen-Gui
    Cheng, Min-Chien
    2014 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2014, : 4095 - 4100
  • [22] Higher order clustering coefficients in Barabasi-Albert networks
    Fronczak, A
    Holyst, JA
    Jedynak, M
    Sienkiewicz, J
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2002, 316 (1-4) : 688 - 694
  • [23] Correlation coefficients of simplified neutrosophic multiplicative sets and their applications in clustering analysis
    Ali Köseoğlu
    Rıdvan Şahin
    Journal of Ambient Intelligence and Humanized Computing, 2023, 14 : 3383 - 3404
  • [24] High resolution human clustering based on complex signal correlation coefficients
    Rudrappa, Manjunath Thindlu
    Herschel, Reinhold
    2021 18TH EUROPEAN RADAR CONFERENCE (EURAD), 2021, : 309 - 312
  • [25] Clustering algorithms based on correlation coefficients for probabilistic linguistic term sets
    Lin, Mingwei
    Wang, Huibing
    Xu, Zeshui
    Yao, Zhiqiang
    Huang, Jinli
    INTERNATIONAL JOURNAL OF INTELLIGENT SYSTEMS, 2018, 33 (12) : 2402 - 2424
  • [26] On generalized correlation coefficients of the hesitant fuzzy sets with their application to clustering analysis
    Singh, Surender
    Lalotra, Sumita
    COMPUTATIONAL & APPLIED MATHEMATICS, 2019, 38 (01):
  • [27] On generalized correlation coefficients of the hesitant fuzzy sets with their application to clustering analysis
    Surender Singh
    Sumita Lalotra
    Computational and Applied Mathematics, 2019, 38
  • [28] Correlation coefficients of simplified neutrosophic multiplicative sets and their applications in clustering analysis
    Koseoglu, Ali
    Sahin, Ridvan
    JOURNAL OF AMBIENT INTELLIGENCE AND HUMANIZED COMPUTING, 2021, 14 (4) : 3383 - 3404
  • [29] Data Correlation-Based Clustering in Sensor Networks
    Yeo, Myung Ho
    Lee, Mi Sook
    Lee, Seok Jae
    Yoo, Jae Soo
    CSA 2008: INTERNATIONAL SYMPOSIUM ON COMPUTER SCIENCE AND ITS APPLICATIONS, PROCEEDINGS, 2008, : 332 - 337
  • [30] Detecting large cohesive subgroups with high clustering coefficients in social networks
    Ertem, Zeynep
    Veremyev, Alexander
    Butenko, Sergiy
    SOCIAL NETWORKS, 2016, 46 : 1 - 10