arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2012.11573stat.CO
收藏

变斜率参数空间的最优分割算法

Change-in-Slope Optimal Partitioning Algorithm in a Finite-Size Parameter Space

Vincent Runge, Marco Pascucci, Nicolas Deschamps de Boishebert

摘要:

研究了利用残差平方和拟合连续分段线性信号的单变量时间序列中的变点检测问题。坡折处的推断信号的值被限制为大小为$m$的有限集合。使用这个有限的参数空间,我们建立了一个动态规划算法的$O(m^2n^2)$控制的时间复杂度为$n$数据点。在$n^2$之前,可以使用一些加速策略来减小常数。一个更简单的“通道”方法的模拟适应经典的基于不等式的修剪优于。此外,我们的有限参数空间设置允许一个简单的引入约束的推断信号。例如,在连续段斜率之间施加最小角度可提供对模型错误指定和离群值的鲁棒性。我们测试我们的算法与isotonic约束上的migram图像分析问题的算法效率是一个基石,在新兴的背景下,移动健康和嵌入式医疗设备。对于这种应用,有限状态方法可以是有效的折衷。

英文摘要:

We consider the problem of detecting change-points in univariate time series by fitting a continuous piecewise linear signal using the residual sum of squares. Values of the inferred signal at slope breaks are restricted to a finite set of size $m$. Using this finite parameter space, we build a dynamic programming algorithm with a controlled time complexity of $O(m^2n^2)$ for $n$ data points. Some accelerating strategies can be used to reduce the constant before $n^2$. The adapted classic inequality-based pruning is outperformed by a simpler "channel" method on simulations. Besides, our finite parameter space setting allows an easy introduction of constraints on the inferred signal. For example, imposing a minimal angle between consecutive segment slopes provides robustness to model misspecification and outliers. We test our algorithm with an isotonic constraint on an antibiogram image analysis problem for which algorithmic efficiency is a cornerstone in the emerging context of mobile-health and embedded medical devices. For this application, a finite state approach can be a valid compromise.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑