Brain network similarity using k-cores

被引:0
|
作者
Ferdous, Kazi Tabassum [1 ]
Balasubramanian, Sowmya [1 ]
Srinivasan, Venkatesh [1 ]
Thomo, Alex [1 ]
机构
[1] Univ Victoria, Dept Comp Sci, Victoria, BC, Canada
关键词
Autism Spectrum Disorder; ASD; ADHD; brain networks; fMRI; Hamming Distance; K-Cores; Jaccard Similarity; AUTISM SPECTRUM DISORDERS; CONNECTIVITY;
D O I
10.1145/3625007.3627318
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Autism Spectrum Disorder (ASD) is extensively studied by medical practitioners, health researchers, and educators. ASD symptoms appear in early childhood, within the first two years of life, but diagnosing it remains challenging due to its complex and diverse nature. Nevertheless, early diagnosis is crucial for effective intervention. Traditional methods rely on behavioral observations, while modern approaches involve applying machine learning (ML) to brain networks derived from fMRI scans. Limited explainability of these advanced techniques poses a significant challenge in gaining clinicians trust. This paper builds on recent works that design explainable approaches for ASD diagnosis from fMRI data preprocessed as graphs. Our research makes three key contributions. Firstly, we demonstrate that a simple approach based on viewing graphs as tables and using tabular data classifiers can achieve the same performance as state-of-art, explainable graph theoretic methods. Secondly, we provide evidence that by adding higher-order connectivity information as attributes does not improve their performance. Most importantly, we show why classification of brain networks is challenging by demonstrating the similarity between graphs belonging to individuals with ASD and those without, using a novel k-core based approach.
引用
收藏
页码:575 / 582
页数:8
相关论文
共 50 条
  • [1] On Querying Historical K-Cores
    Yu, Michael
    Wen, Dong
    Qin, Lu
    Zhang, Ying
    Zhang, Wenjie
    Lin, Xuemin
    [J]. PROCEEDINGS OF THE VLDB ENDOWMENT, 2021, 14 (11): : 2033 - 2045
  • [2] On the robustness of random k-cores
    Sato, Cristiane M.
    [J]. EUROPEAN JOURNAL OF COMBINATORICS, 2014, 41 : 163 - 182
  • [3] Homomorphism complexes and k-cores
    Malen, Greg
    [J]. DISCRETE MATHEMATICS, 2018, 341 (09) : 2567 - 2574
  • [4] Minimum k-cores and the k-core polytope
    Mikesell, Derek
    Hicks, Illya V.
    [J]. NETWORKS, 2022, 80 (01) : 93 - 108
  • [5] Attack robustness and stability of generalized k-cores
    Shang, Yilun
    [J]. NEW JOURNAL OF PHYSICS, 2019, 21
  • [6] A Parameterized Complexity View on Collapsing k-Cores
    Junjie Luo
    Hendrik Molter
    Ondřej Suchý
    [J]. Theory of Computing Systems, 2021, 65 : 1243 - 1282
  • [7] Are k-cores meaningful for temporal graph analysis?
    Conte, Alessio
    Rucci, Davide
    [J]. 39TH ANNUAL ACM SYMPOSIUM ON APPLIED COMPUTING, SAC 2024, 2024, : 1453 - 1460
  • [8] Persuasion in Networks: Public Signals and k-Cores
    Candogan, Ozan
    [J]. ACM EC '19: PROCEEDINGS OF THE 2019 ACM CONFERENCE ON ECONOMICS AND COMPUTATION, 2019, : 133 - 134
  • [9] A Parameterized Complexity View on Collapsing k-Cores
    Luo, Junjie
    Molter, Hendrik
    Suchy, Ondrej
    [J]. THEORY OF COMPUTING SYSTEMS, 2021, 65 (08) : 1243 - 1282
  • [10] Exotic phase transitions of k-cores in clustered networks
    Bhat, Uttam
    Shrestha, Munik
    Hebert-Dufresne, Laurent
    [J]. PHYSICAL REVIEW E, 2017, 95 (01)