Cluster analysis of fMRI data using dendrogram sharpening

The major disadvantage of hierarchical clustering in fMRI data analysis is that an appropriate clustering threshold needs to be specified. Upon grouping data into a hierarchical tree, clusters are identified either by specifying their number or by choosing an appropriate inconsistency coefficient. Since the number of clusters present in the data is not known beforehand, even a slight variation of the inconsistency coefficient can significantly affect the results. To address these limitations, the dendrogram sharpening method, combined with a hierarchical clustering algorithm, is used in this work to identify modality regions, which are, in essence, areas of activation in the human brain during an fMRI experiment. The objective of the algorithm is to remove data from the low‐density regions in order to obtain a clearer representation of the data structure. Once cluster cores are identified, the classification algorithm is run on voxels, set aside during sharpening, attempting to reassign them to the detected groups. When applied to a paced motor paradigm, task‐related activations in the motor cortex are detected. In order to evaluate the performance of the algorithm, the obtained clusters are compared to standard activation maps where the expected hemodynamic response function is specified as a regressor. The obtained patterns of both methods have a high concordance (correlation coefficient = 0.91). Furthermore, the dependence of the clustering results on the sharpening parameters is investigated and recommendations on the appropriate choice of these variables are offered. Hum. Brain Mapping 20:201–219, 2003. © 2003 Wiley‐Liss, Inc.

[1]  Dietmar Cordes,et al.  Hierarchical clustering to measure connectivity in fMRI resting-state data. , 2002, Magnetic resonance imaging.

[2]  M. Braga,et al.  Exploratory Data Analysis , 2018, Encyclopedia of Social Network Analysis and Mining. 2nd Ed..

[3]  I. Jolliffe Principal Component Analysis , 2002 .

[4]  Claus Lamm,et al.  Fuzzy cluster analysis of high-field functional MRI data , 2003, Artif. Intell. Medicine.

[5]  L. K. Hansen,et al.  On Clustering fMRI Time Series , 1999, NeuroImage.

[6]  Anil K. Jain,et al.  Algorithms for Clustering Data , 1988 .

[7]  John A. Hartigan,et al.  Clustering Algorithms , 1975 .

[8]  P. Bandettini,et al.  Synthetic images by subspace transforms. I. Principal components images and related filters. , 1994, Medical physics.

[9]  Steven McKinney,et al.  AutoPaint: a toolkit for visualizing data in four or more dimensions , 1996 .

[10]  R Baumgartner,et al.  Comparison of two exploratory data analysis methods for fMRI: fuzzy clustering vs. principal component analysis. , 2000, Magnetic resonance imaging.

[11]  J. Hartigan Distribution Problems in Clustering , 1977 .

[12]  C. Windischberger,et al.  Quantification in functional magnetic resonance imaging: fuzzy clustering vs. correlation analysis. , 1998, Magnetic resonance imaging.

[13]  J. Hartigan Consistency of Single Linkage for High-Density Clusters , 1981 .

[14]  Jody Tanabe,et al.  See Blockindiscussions, Blockinstats, Blockinand Blockinauthor Blockinprofiles Blockinfor Blockinthis Blockinpublication Comparison Blockinof Blockindetrending Blockinmethods Blockinfor Optimal Blockinfmri Blockinpreprocessing , 2022 .

[15]  L Ryner,et al.  Novelty indices: identifiers of potentially interesting time-courses in functional MRI data. , 2000, Magnetic resonance imaging.

[16]  J. Hartigan Asymptotic Distributions for Clustering Criteria , 1978 .

[17]  R Baumgartner,et al.  A hierarchical clustering method for analyzing functional MR images. , 1999, Magnetic resonance imaging.

[18]  T. Sejnowski,et al.  Human Brain Mapping 6:368–372(1998) � Independent Component Analysis of fMRI Data: Examining the Assumptions , 2022 .