REVIEW 8 cited by
An Evaluation of Change Point Detection Algorithms
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Change point detection is an important part of time series analysis, as the presence of a change point indicates an abrupt and significant change in the data generating process. While many algorithms for change point detection have been proposed, comparatively little attention has been paid to evaluating their performance on real-world time series. Algorithms are typically evaluated on simulated data and a small number of commonly-used series with unreliable ground truth. Clearly this does not provide sufficient insight into the comparative performance of these algorithms. Therefore, instead of developing yet another change point detection method, we consider it vastly more important to properly evaluate existing algorithms on real-world data. To achieve this, we present a data set specifically designed for the evaluation of change point detection algorithms that consists of 37 time series from various application domains. Each series was annotated by five human annotators to provide ground truth on the presence and location of change points. We analyze the consistency of the human annotators, and describe evaluation metrics that can be used to measure algorithm performance in the presence of multiple ground truth annotations. Next, we present a benchmark study where 14 algorithms are evaluated on each of the time series in the data set. Our aim is that this data set will serve as a proving ground in the development of novel change point detection algorithms.
Forward citations
Cited by 8 Pith papers
-
ARC: Augmented-Rank Conformalization for Changepoint Localization --- Finite-Sample Validity and Distribution-Robust Efficiency
Rank-based conformal scores make changepoint localization sets finite-sample valid for any frozen weights and exactly invariant to monotone data transforms, transferring certified set lengths across the entire monotone orbit.
-
MOPED: A moving sum method for change point detection in pairwise extremal dependence
MOPED uses moving sums of tail pairwise dependence matrix estimates to detect multiple change points in extremal dependence, with a multiscale variant that pools thresholds and bandwidths.
-
Large Language Models for Predictive Analysis: How Far Are They?
Existing LLMs perform poorly on predictive analysis, with the best model scoring 24.11/28 and most models failing to generate executable code.
-
Evolving Markov Chains: Unsupervised Mode Discovery and Recognition from Data Streams
EMCs estimate kth-order conditional probabilities online with O(m^k) updates per observation, and use Hellinger-distance drift detection plus a mode memory to discover and recognize switching behavioral modes in data streams.
-
Bayesian optimal change point detection in high-dimensions
Maximum pairwise Bayes factor detectors for high-dimensional Gaussian mean and covariance change points are shown to be consistent with nearly minimax localization rates.
-
O-MAGIC: Online Change-Point Detection for Dynamic Systems
O-MAGIC detects parameter change points in nonlinear ODE systems online by combining manifold-constrained Gaussian process inference with a sequential generalized likelihood ratio test.
-
A unifying framework for generalised Bayesian online learning in non-stationary environments
BONE is a unifying framework that expresses many existing Bayesian online learning methods as combinations of five design choices, plus a new runlength-based method that handles both gradual and sudden changes.
-
Active Learning for Multiple Change Point Detection in Non-stationary Time Series with Deep Gaussian Processes
A new algorithm combines deep Gaussian process predictions, sliding-window spectral analysis, and an acquisition function that balances spectral change and uncertainty to detect change points while actively choosing w...
Discussion (0). Continue with ORCID to comment.