arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1612.04740math.STstat.TH
收藏

一致的核变点检测

Consistent change-point detection with kernels

Damien Garreau, Sylvain Arlot

摘要:

本文研究了Arlot,Celisse和Harchaoui(2012)提出的核变点算法(KCP),该算法的目标是在一个任意集合上取值的独立数据序列的分布中定位未知数的变点.变点的选择与惩罚核经验标准的模型选择。我们提供了一个非渐近的结果表明,具有很高的概率,KCP程序检索正确的变点数量,只要在罚款的常数是精心选择的;此外,KCP估计的变点位置在最佳速率。因此,当使用特征核时,KCP检测分布中的所有类型的变化(不仅是均值或方差的变化),并且它能够对复杂的结构化数据(不一定在$\mathbb{R}^d$中)进行检测。大部分的分析是假设核是有界的,部分结果可以扩展时,我们只假设一个有限的二阶矩。

英文摘要:

In this paper we study the kernel change-point algorithm (KCP) proposed by Arlot, Celisse and Harchaoui (2012), which aims at locating an unknown number of change-points in the distribution of a sequence of independent data taking values in an arbitrary set. The change-points are selected by model selection with a penalized kernel empirical criterion. We provide a non-asymptotic result showing that, with high probability, the KCP procedure retrieves the correct number of change-points, provided that the constant in the penalty is well-chosen; in addition, KCP estimates the change-points location at the optimal rate. As a consequence, when using a characteristic kernel, KCP detects all kinds of change in the distribution (not only changes in the mean or the variance), and it is able to do so for complex structured data (not necessarily in $\mathbb{R}^d$). Most of the analysis is conducted assuming that the kernel is bounded; part of the results can be extended when we only assume a finite second-order moment.

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

↑