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

一种快速检测未知变化后分布变化的分箱方法

A Binning Approach to Quickest Change Detection with Unknown Post-Change Distribution

Tze Siong Lau, Wee Peng Tay, Venugopal V. Veeravalli

摘要:

最快检测分布变化的问题被认为是在假设变化前的分布是已知的,和变化后的分布只知道属于一个家庭的分布区别于离散化版本的变化前的分布。提出了一种顺序变化检测过程,该过程将样本空间划分为有限数量的箱,并监视落入这些箱中的每个箱中的样本的数量以检测变化。提出了一种近似广义似然比检验的检验统计量。结果表明,建议的检验统计量可以有效地计算使用递归更新计划,并提供了一个程序,用于选择在该计划中的箱数。各种渐近性质的检验统计量推导出的平均检测延迟和平均游程长度之间的性能权衡虚警的见解。对合成数据和真实数据的测试表明,我们的方法在性能上与现有的非参数变化检测方法相当或更好。

英文摘要:

The problem of quickest detection of a change in distribution is considered under the assumption that the pre-change distribution is known, and the post-change distribution is only known to belong to a family of distributions distinguishable from a discretized version of the pre-change distribution. A sequential change detection procedure is proposed that partitions the sample space into a finite number of bins, and monitors the number of samples falling into each of these bins to detect the change. A test statistic that approximates the generalized likelihood ratio test is developed. It is shown that the proposed test statistic can be efficiently computed using a recursive update scheme, and a procedure for choosing the number of bins in the scheme is provided. Various asymptotic properties of the test statistic are derived to offer insights into its performance trade-off between average detection delay and average run length to a false alarm. Testing on synthetic and real data demonstrates that our approach is comparable or better in performance to existing non-parametric change detection methods.

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

↑