Department of Computer Science, Derozio Memorial College, Kolkata, 700136, India.
Department of Chemical Engineering, University of Calcutta, Kolkata, 700009, India.
Child Psychiatry Hum Dev. 2024 Jun;55(3):622-634. doi: 10.1007/s10578-022-01432-6. Epub 2022 Sep 13.
In recent times, the complex network theory is increasingly applied to characterize, classify, and diagnose a broad spectrum of neuropathological conditions, including attention deficit hyperactivity disorder (ADHD), Alzheimer's disease, bipolar disorder, and many others. Nevertheless, the diagnosis and associated subtype identification majorly rely on the baseline correlation matrix obtained from the functional MRI scan. Thus, the existing protocols are either full of personalized bias or computationally expensive as network complexity-based simple but deterministic protocols are yet to be developed and formalized. This article proposes a deterministic method to identify and differentiate the common ADHD subtypes, which is based on a single complexity measure, namely the eigenvector centrality. The node-wise centrality differences were explored using a classification tree model (p < 0.05) to diagnose the subtypes. Identification of marker nodes from default mode, visual, frontoparietal, limbic, and cerebellar networks strongly vouch for the involvement of multiple brain regions in ADHD neuropathology.
近年来,复杂网络理论越来越多地被应用于描述、分类和诊断广泛的神经病理学状况,包括注意缺陷多动障碍(ADHD)、阿尔茨海默病、双相情感障碍等。然而,诊断和相关亚型的识别主要依赖于从功能磁共振扫描中获得的基线相关矩阵。因此,现有的方案要么充满个性化偏见,要么计算成本高昂,因为基于网络复杂性的简单但确定性方案尚未开发和形式化。本文提出了一种基于单一复杂度度量,即特征向量中心性,来识别和区分常见 ADHD 亚型的确定性方法。通过分类树模型(p<0.05)探索节点的中心性差异,以诊断亚型。从默认模式、视觉、额顶叶、边缘和小脑网络中识别标记节点,强烈证明了多个脑区参与 ADHD 神经病理学。