...
首页> 外文期刊>Journal of classification >Piecewise Regression Mixture for Simultaneous Functional Data Clustering and Optimal Segmentation
【24h】

Piecewise Regression Mixture for Simultaneous Functional Data Clustering and Optimal Segmentation

机译:分段回归混合,可同时进行功能数据聚类和最佳分段

获取原文
获取原文并翻译 | 示例

摘要

This paper introduces a novel mixture model-based approach to the simultaneous clustering and optimal segmentation of functional data, which are curves presenting regime changes. The proposed model consists of a finite mixture of piecewise polynomial regression models. Each piecewise polynomial regression model is associated with a cluster, and within each cluster, each piecewise polynomial component is associated with a regime (i.e., a segment). We derive two approaches to learning the model parameters: the first is an estimation approach which maximizes the observed-data likelihood via a dedicated expectation-maximization (EM) algorithm, then yielding a fuzzy partition of the curves into K clusters obtained at convergence by maximizing the posterior cluster probabilities. The second is a classification approach and optimizes a specific classification likelihood criterion through a dedicated classification expectation-maximization (CEM) algorithm. The optimal curve segmentation is performed by using dynamic programming. In the classification approach, both the curve clustering and the optimal segmentation are performed simultaneously as the CEM learning proceeds. We show that the classification approach is a probabilistic version generalizing the deterministic K-means-like algorithm proposed in Hbrail, Hugueney, Lechevallier, and Rossi (2010). The proposed approach is evaluated using simulated curves and real-world curves. Comparisons with alternatives including regression mixture models and the K-means-like algorithm for piecewise regression demonstrate the effectiveness of the proposed approach.
机译:本文介绍了一种新颖的基于混合模型的方法来对功能数据进行同时聚类和最佳分割,这些数据是表示状态变化的曲线。所提出的模型由分段多项式回归模型的有限混合组成。每个分段多项式回归模型与一个群集相关联,并且在每个群集内,每个分段多项式分量与一个方案(即一个段)相关联。我们推导了两种学习模型参数的方法:第一种是通过专用的期望最大化(EM)算法使观测数据似然性最大化的估计方法,然后将曲线的模糊划分成K个聚类,并通过最大化将其收敛后集群概率。第二种是分类方法,它通过专用的分类期望最大化(CEM)算法优化特定的分类可能性标准。通过使用动态编程来执行最佳曲线分割。在分类方法中,随着CEM学习的进行,曲线聚类和最佳分割都同时进行。我们表明分类方法是一种概率版本,它概括了Hbrail,Hugueney,Lechevallier和Rossi(2010)中提出的确定性K均值式算法。使用模拟曲线和实际曲线对所提出的方法进行评估。与包括回归混合模型和类似K-means的分段回归算法在内的替代方案的比较证明了该方法的有效性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号