Lancaster Jack L, Laird Angela R, Fox P Mickle, Glahn David E, Fox Peter T
Research Imaging Center, University of Texas Health Science Center at San Antonio, San Antonio, Texas 78229-3900, USA.
Hum Brain Mapp. 2005 May;25(1):174-84. doi: 10.1002/hbm.20135.
The high information content in large data sets from voxel-based meta-analyses is complex, making it hard to readily resolve details. Using the meta-analysis network as a standardized data structure, network analysis algorithms can examine complex interrelationships and resolve hidden details. Two new network analysis algorithms have been adapted for use with meta-analysis networks. The first, called replicator dynamics network analysis (RDNA), analyzes co-occurrence of activations, whereas the second, called fractional similarity network analysis (FSNA), uses binary pattern matching to form similarity subnets. These two network analysis methods were evaluated using data from activation likelihood estimation (ALE)-based meta-analysis of the Stroop paradigm. Two versions of these data were evaluated, one using a more strict ALE threshold (P < 0.01) with a 13-node meta-analysis network, and the other a more lax threshold (P < 0.05) with a 22-node network. Java-based applications were developed for both RDNA and FSNA. The RDNA algorithm was modified to provide multiple subnets or maximal cliques for meta-analysis networks. Three different similarity measures were evaluated with FSNA to form subsets of nodes and experiments. RDNA provides a means to gauge importance of metanalysis subnets and complements FSNA, which provides a more comprehensive assessment of node similarity subsets, experiment similarity subsets, and overall node-to-factors similarity. The need to use both presence and absence of activations was an important finding in similarity analyses. FSNA revealed details from the pooled Stroop meta-analysis that would otherwise require separate highly filtered meta-analyses. These new analysis tools demonstrate how network analysis strategies can simplify greatly and enhance voxel-based meta-analyses.
基于体素的元分析大数据集中的高信息量内容很复杂,难以轻易解析其中的细节。将元分析网络用作标准化数据结构,网络分析算法可以检查复杂的相互关系并解析隐藏的细节。两种新的网络分析算法已被改编用于元分析网络。第一种称为复制者动态网络分析(RDNA),用于分析激活的共现情况;第二种称为分数相似性网络分析(FSNA),使用二元模式匹配来形成相似性子网络。使用基于激活可能性估计(ALE)的Stroop范式元分析数据对这两种网络分析方法进行了评估。对这些数据的两个版本进行了评估,一个使用更严格的ALE阈值(P < 0.01)和一个13节点的元分析网络,另一个使用更宽松的阈值(P < 0.05)和一个22节点的网络。为RDNA和FSNA都开发了基于Java的应用程序。对RDNA算法进行了修改,以提供元分析网络的多个子网或最大团。使用FSNA评估了三种不同的相似性度量,以形成节点和实验的子集。RDNA提供了一种衡量元分析子网重要性的方法,并补充了FSNA,后者对节点相似性子集、实验相似性子集以及整体节点与因素的相似性提供了更全面的评估。在相似性分析中,需要同时使用激活的存在和不存在情况是一个重要发现。FSNA揭示了合并后的Stroop元分析中的细节,否则这些细节需要单独进行高度筛选的元分析。这些新的分析工具展示了网络分析策略如何能够极大地简化并增强基于体素的元分析。