ABSTRACT
Change point detection is widely used for finding transitions between states of data generation within a time series. Methods for change point detection currently assume this transition is instantaneous and therefore focus on finding a single point of data to classify as a change point. However, this assumption is flawed because many time series actually display short periods of transitions between different states of data generation. Previous work has shown Bayesian Online Change Point Detection (BOCPD) to be the most effective method for change point detection on a wide range of different time series. This paper explores adapting the change point detection algorithms to detect abrupt changes over short periods of time. We design a segment-based mechanism to examine a window of data points within a time series, rather than a single data point, to determine if the window captures abrupt change. We test our segment-based Bayesian change detection algorithm on 36 different time series and compare it to the original BOCPD algorithm. Our results show that, for some of these 36 time series, the segment-based approach for detecting abrupt changes can much more accurately identify change points based on standard metrics.
Supplemental Material
- Ryan Prescott Adams and David JC MacKay. 2007. Bayesian online changepoint detection. arXiv preprint arXiv:0710.3742 (2007).Google Scholar
- Samaneh Aminikhanghahi and Diane J Cook. 2017. A survey of methods for time series change point detection. Knowledge and information systems 51, 2 (2017), 339--367. Google ScholarDigital Library
- Samaneh Aminikhanghahi and Diane J Cook. 2017. Using change point detection to automate daily activity segmentation. In 2017 IEEE International Conference on Pervasive Computing and Communications Workshops (PerCom Workshops). IEEE, 262--267.Google ScholarCross Ref
- Michele Basseville. 1988. Detecting changes in signals and systems-a survey. Automatica 24, 3 (1988), 309--326. Google ScholarDigital Library
- Sooyoung Cheon and Jaehee Kim. 2010. Multiple change-point detection of multivariate mean vectors with the Bayesian approach. Computational Statistics & Data Analysis 54, 2 (2010), 406--415. Google ScholarDigital Library
- Mark Everingham, Luc Van Gool, Christopher KI Williams, John Winn, and Andrew Zisserman. 2010. The pascal visual object classes (voc) challenge. International journal of computer vision 88, 2 (2010), 303--338. Google ScholarDigital Library
- Zhenmei Ma, Shaozhong Kang, Lu Zhang, Ling Tong, and Xiaoling Su. 2008. Analysis of impacts of climate variability and human activity on streamflow for a river basin in arid region of northwest China. Journal of hydrology 352, 3--4 (2008), 239--249.Google ScholarCross Ref
- Aleksey S Polunchenko and Alexander G Tartakovsky. 2012. State-of-the-art in sequential change-point detection. Methodology and computing in applied probability 14, 3 (2012), 649--684.Google Scholar
- C. J. Van Rijsbergen. 1979. Information Retrieval. Butterworths (1979). Google ScholarDigital Library
- David Rybach, Christian Gollan, Ralf Schluter, and Hermann Ney. 2009. Audio segmentation for speech recognition using segment features. In 2009 IEEE International Conference on Acoustics, Speech and Signal Processing. IEEE, 4197--4200. Google ScholarDigital Library
- Gábor J Székely. 2003. E-statistics: The energy of statistical samples. Bowling Green State University, Department of Mathematics and Statistics Technical Report 3, 05 (2003), 1--18.Google Scholar
- Alexander G Tartakovsky and George V Moustakides. 2010. State-of-the-art in Bayesian changepoint detection. Sequential Analysis 29, 2 (2010), 125--145.Google ScholarCross Ref
- Sven Thies and Peter Molnár. 2018. Bayesian change point analysis of Bitcoin returns. Finance Research Letters 27 (2018), 223--227.Google ScholarCross Ref
- Gerrit JJ van den Burg and Christopher KI Williams. 2020. An evaluation of change point detection algorithms. arXiv preprint arXiv:2003.06222 (2020).Google Scholar
- S Zacks. 1983. Survey of classical and Bayesian approaches to the change-point problem: fixed sample and sequential procedures ofGoogle Scholar
Index Terms
- Reevaluating the Change Point Detection Problem with Segment-based Bayesian Online Detection
Recommendations
Practical Aspects of False Alarm Control for Change Point Detection: Beyond Average Run Length
AbstractA popular method for detecting changes in the probability distribution of a sequence of observations is CUSUM, which proceeds by sequentially evaluating a log-likelihood ratio test statistic and comparing it to a predefined threshold; a change ...
A novel approach to detection of intrusions in computer networks via adaptive sequential and batch-sequential change-point detection methods
Large-scale computer network attacks in their final stages can readily be identified by observing very abrupt changes in the network traffic. In the early stage of an attack, however, these changes are hard to detect and difficult to distinguish from ...
Using labeled data to evaluate change detectors in a multivariate streaming environment
We consider the problem of detecting changes in a multivariate data stream. A change detector is defined by a detection algorithm and an alarm threshold. A detection algorithm maps the stream of input vectors into a univariate detection stream. The ...
Comments