arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1701.01672stat.COstat.MEstat.ML
收藏

通过$L_0$惩罚检测斜率变化

Detecting changes in slope with an $L_0$ penalty

Robert Maidstone, Paul Fearnhead, Adam Letchford

摘要:

虽然有许多方法来检测一个单变量时间序列的平均值的变化,检测斜率的多个变化的问题相对被忽视。部分原因是检测斜率的变化更具挑战性。例如,简单的二进制分割程序不适用于这个问题,而有效的动态规划方法,工作以及平均值的变化问题不能直接用于检测斜率的变化。我们提出了一种新的动态规划方法,CPOP,寻找“最佳”连续分段线性拟合数据。我们定义最好的基础上的一个标准,措施适合数据使用残差平方和,但惩罚复杂性的基础上的$L_0$惩罚的变化,斜率。我们表明,使用这样的标准是更可靠的估计变点位置比惩罚复杂性的方法,使用$L_1$罚款。CPOP具有良好的计算性能,可以在几分钟内分析超过10,000个观测值和100个变化的时间序列。我们的方法是用来分析数据的运动的细菌,并提供适合的数据,都有很大程度上较小的残差平方和,比两个竞争的方法更吝啬。

英文摘要:

Whilst there are many approaches to detecting changes in mean for a univariate time-series, the problem of detecting multiple changes in slope has comparatively been ignored. Part of the reason for this is that detecting changes in slope is much more challenging. For example, simple binary segmentation procedures do not work for this problem, whilst efficient dynamic programming methods that work well for the change in mean problem cannot be directly used for detecting changes in slope. We present a novel dynamic programming approach, CPOP, for finding the "best" continuous piecewise-linear fit to data. We define best based on a criterion that measures fit to data using the residual sum of squares, but penalises complexity based on an $L_0$ penalty on changes in slope. We show that using such a criterion is more reliable at estimating changepoint locations than approaches that penalise complexity using an $L_1$ penalty. Empirically CPOP has good computational properties, and can analyse a time-series with over 10,000 observations and over 100 changes in a few minutes. Our method is used to analyse data on the motion of bacteria, and provides fits to the data that both have substantially smaller residual sum of squares and are more parsimonious than two competing approaches.

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

↑