A Kernel Multiple Change-point Algorithm via Model Selection
arXiv:1202.3878
Abstract
We tackle the change-point problem with data belonging to a general set. We build a penalty for choosing the number of change-points in the kernel-based method of Harchaoui and Capp{é} (2007). This penalty generalizes the one proposed by Lebarbier (2005) for one-dimensional signals. We prove a non-asymptotic oracle inequality for the proposed method, thanks to a new concentration result for some function of Hilbert-space valued random variables. Experiments on synthetic data illustrate the accuracy of our method, showing that it can detect changes in the whole distribution of data, even when the mean and variance are constant.
References in corpus (5)
- Equivalence of distance-based and RKHS-based statistics in hypothesis testing
- The group fused Lasso for multiple change-point detection
- Locality statistics for anomaly detection in time series of graphs
- Gaussian model selection with an unknown variance
- Large-Margin Metric Learning for Partitioning Problems
Cited by in corpus (17)
- Selective review of offline change point detection methods
- Nonparametric maximum likelihood approach to multiple change-point problems
- Applicability and Interpretability of Hierarchical Agglomerative Clustering With or Without Contiguity Constraints
- Inferring pointwise diffusion properties of single trajectories with deep learning
- Minimal penalties and the slope heuristics: a survey
- Finite sample properties of parametric MMD estimation: robustness to misspecification and dependence
- Early Fault-Tolerant Quantum Algorithms in Practice: Application to Ground-State Energy Estimation
- Unsupervised Detection of Behavioural Drifts with Dynamic Clustering and Trajectory Analysis
- A Nonparametric Approach for Multiple Change Point Analysis of Multivariate Data
- InDiD: Instant Disorder Detection via Representation Learning
- Change Points via Probabilistically Pruned Objectives
- Pruning and Nonparametric Multiple Change Point Detection
- Sketching for Sequential Change-Point Detection
- Theory and Applications of Financial Chaos Index
- Kernel Clustering with Sigmoid-based Regularization for Efficient Segmentation of Sequential Data
- Self-Supervised Transformer Architecture for Change Detection in Radio Access Networks
- New efficient algorithms for multiple change-point detection with kernels