We propose a model-based clustering algorithm for a general class of functional data for which the components could be curves or images. The random functional data realizations could be measured with error at discrete, and possibly random, points in the definition domain. The idea is to build a set of binary trees by recursive splitting of the observations. The number of groups are determined in a data-driven way. The new algorithm provides easily interpretable results and fast predictions for online data sets. Results on simulated datasets reveal good performance in various complex settings. The methodology is applied to the analysis of vehicle trajectories on a German roundabout.
翻译:我们为一般功能数据类别提议一个基于模型的组合算法,其中各组成部分可以是曲线或图像。随机功能数据实现情况可以在定义域的离散点(可能还包括随机点)上以错误来测量。设想是通过对观测结果的递归分割来构建一套二进制树。组数以数据驱动的方式确定。新的算法为在线数据集提供了容易解释的结果和快速预测。模拟数据集的结果显示不同复杂环境的性能良好。该方法用于分析德国圆环上的车辆轨迹。