Journal
ADVANCES IN DATA ANALYSIS AND CLASSIFICATION
Volume 6, Issue 3, Pages 219-247Publisher
SPRINGER HEIDELBERG
DOI: 10.1007/s11634-012-0113-3
Keywords
Functional data; Clustering; Low-dimensional space; Dimension reduction; Smoothing
Categories
Ask authors/readers for more resources
To find optimal clusters of functional objects in a lower-dimensional subspace of data, a sequential method called tandem analysis, is often used, though such a method is problematic. A new procedure is developed to find optimal clusters of functional objects and also find an optimal subspace for clustering, simultaneously. The method is based on the k-means criterion for functional data and seeks the subspace that is maximally informative about the clustering structure in the data. An efficient alternating least-squares algorithm is described, and the proposed method is extended to a regularized method. Analyses of artificial and real data examples demonstrate that the proposed method gives correct and interpretable results.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available