Clustering Functional Data into Groups by Using Projections
利用投影对函数型数据进行分组聚类
Summary 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…