.png){kind=icon}
.png){kind=icon}
Return
Clustering functional data into groups by using projections
.png){kind=icon}
OA
AI
DOI：10.1111/rssb.12310.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We show that, in the functional data context, by appropriately exploiting the functional nature of the data, it is possible to cluster the observations asymptotically perfectly. We demonstrate that this level of performance can sometimes be achieved by the k-means algorithm as long as the data are projected on a carefully chosen finite dimensional space. In general, the notion of an ideal cluster is not clearly defined. We derive our results in the setting where the data come from two populations whose distributions differ at least in terms of means, and where an ideal cluster corresponds to one of these two populations. We propose an iterative algorithm to choose the projection functions in a way that optimizes clustering performance, where, to avoid peculiar solutions, we use a weighted least squares criterion. We apply our iterative clustering procedure on simulated and real data, where we show that it works well.
Keywords:
Asymptotically perfect clustering
Functional principal components
Haar basis
k-means
Optimal projection
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
J
IF:
3.6
Papers:
1.5K
Citations:
3.2W