.png){kind=icon}
返回
Sequential change-point detection: Computation versus statistical performance
.png){kind=icon}
OA
AI
DOI：10.1002/wics.1628.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Change-point detection studies the problem of detecting the changes in the underlying distribution of the data stream as soon as possible after the change happens. Modern large-scale, high-dimensional, and complex streaming data call for computationally (memory) efficient sequential change-point detection algorithms that are also statistically powerful. This gives rise to a computation versus statistical power trade-off, an aspect less emphasized in the past in classic literature. This tutorial takes this new perspective and reviews several sequential change-point detection procedures, ranging from classic sequential change-point detection algorithms to more recent non-parametric procedures that consider computation, memory efficiency, and model robustness in the algorithm design. Our survey also contains classic performance analysis, which provides useful techniques for analyzing new procedures.This article is categorized under:Statistical Models > Time Series ModelsAlgorithms and Computational Methods > AlgorithmsData: Types and Structure > Time Series, Stochastic Processes, and Functional Data
Keyword:
anomaly detection
sequential change-point detection
statistical signal processing
期刊
W
IF:
5.4
论文数:
201
被引数:
5.1K
机构
引用论文
ASYMPTOTIC DISTRIBUTION-FREE CHANGE- POINT DETECTION FOR MULTIVARIATE AND NON-EUCLIDEAN DATA.png)
ANNALS OF STATISTICS
OAAI
ANNALS OF STATISTICSIF3.7
OAAI分享收藏分享收藏
查看更多内容