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

基于新排序方案的现代数据渐近无分布变点检测

Asymptotic Distribution-free Change-point Detection for Modern Data Based on a New Ranking Scheme

National University of Singapore(新加坡国立大学)

Doudou Zhou, Hao Chen

AI总结:

针对高维或非欧几里得数据的变点检测问题,提出基于图诱导秩的RING-CPD方法,该方法渐近无分布、可解析近似p值,在模拟与真实数据集上均表现出有效性与稳健性。

摘要:

变点检测(CPD)涉及识别独立观测序列中的分布变化。在非参数方法中,基于秩的方法因其稳健性和有效性而具有吸引力,已在单变量数据中得到广泛研究,但在高维或非欧几里得数据中尚未得到充分探索。本文提出一种新方法——图诱导秩变点检测(RING-CPD),利用图诱导秩处理高维与非欧几里得数据。该方法在原假设下渐近无分布,提供解析p值近似以简化第一类错误控制。模拟研究表明,RING-CPD能有效检测多种替代方案下的变点,且对重尾分布和异常值稳健;通过功能连接网络数据集的癫痫发作检测、数字图像变化检测及纽约市出租车数据集的出行模式变化检测进行了验证。

英文摘要:

Change-point detection (CPD) involves identifying distributional changes in a sequence of independent observations. Among nonparametric methods, rank-based methods are attractive due to their robustness and effectiveness and have been extensively studied for univariate data. However, they are not well explored for high-dimensional or non-Euclidean data. This paper proposes a new method, Rank INduced by Graph Change-Point Detection (RING-CPD), which utilizes graph-induced ranks to handle high-dimensional and non-Euclidean data. The new method is asymptotically distribution-free under the null hypothesis, and an analytic $p$-value approximation is provided for easy type-I error control. Simulation studies show that RING-CPD effectively detects change points across a wide range of alternatives and is also robust to heavy-tailed distribution and outliers. The new method is illustrated by the detection of seizures in a functional connectivity network dataset, changes of digit images, and travel pattern changes in the New York City Taxi dataset.

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

↑