Key points are not available for this paper at this time.
Abstract Clustering long term follow-up data has broad applications in supervised and unsupervised learning. This study proposes to accumulate the dissimilarity measure across the study interval to provide an overall index for clustering. The data, typically non-Gaussian, are assumed to be collected at regular time points, and dissimilarity is calculated as a rank-based noncentrality. To initiate the clustering, the K-means and a discretized K-center method of functional principal component analysis is used. We propose a fast computational algorithm to speed up the clustering process with tolerable sacrifice in correct rates. The proposed algorithm is illustrated through simulation studies. For real-world data analysis, a year of fine particulate matter (PM ₂. ₅) monitoring data are analyzed for exploring the spatial closeness between and within clusters.
Hong‐Dar Isaac Wu (Tue,) studied this question.