# Fast likelihood-based change point detection

arXiv: https://arxiv.org/abs/2301.08892 · HTML: https://mlsanity.com/paper/2301.08892/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 3 of its 23 references that are in the map.
- First posted on arXiv 21 Jan 2023.

## Builds on (most cited first, 3 of 3)

- [Machine Learning in Cyber-Security - Problems, Challenges and Data Sets](https://mlsanity.com/paper/1812.07858/) (2018)
- [Strongly polynomial efficient approximation scheme for segmentation](https://mlsanity.com/paper/1805.11170/) (2018)
- [Fast Sequence Segmentation using Log-Linear Models](https://mlsanity.com/paper/1902.03285/) (2019)

## Abstract (arXiv)

Change point detection plays a fundamental role in many real-world applications, where the goal is to analyze and monitor the behaviour of a data stream. In this paper, we study change detection in binary streams. To this end, we use a likelihood ratio between two models as a measure for indicating change. The first model is a single bernoulli variable while the second model divides the stored data in two segments, and models each segment with its own bernoulli variable. Finding the optimal split can be done in O(n) time, where n is the number of entries since the last change point. This is too expensive for large n. To combat this we propose an approximation scheme that yields (1 - ε) approximation in O(ε-1 log2 n) time. The speed-up consists of several steps: First we reduce the number of possible candidates by adopting a known result from segmentation problems. We then show that for fixed bernoulli parameters we can find the optimal change point in logarithmic time. Finally, we show how to construct a candidate list of size O(ε-1 log n) for model parameters. We demonstrate empirically the approximation quality and the running time of our algorithm, showing that we can gain a significant speed-up with a minimal average loss in optimality.