期刊
ADVANCES IN DATA ANALYSIS AND CLASSIFICATION
卷 6, 期 3, 页码 219-247出版社
SPRINGER HEIDELBERG
DOI: 10.1007/s11634-012-0113-3
关键词
Functional data; Clustering; Low-dimensional space; Dimension reduction; Smoothing
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据