Bayesian Model Selection for Change Point Detection and Clustering
We address the new problem of estimating a piece-wise constant signal with the purpose of detecting its change points and the levels of clusters. Our approach is to model it as a nonparametric penalized least square model selection on a family of models indexed over the collection of partitions of the design points and propose a computationally efficient algorithm to approximately solve it. Statistically, minimizing such a penalized criterion yields an approximation to the maximum a posteriori probability (MAP) estimator. The criterion is then analyzed and an oracle inequality is derived using a Gaussian concentration inequality. The oracle inequality is used to derive on one hand conditions for consistency and on the other hand an adaptive upper bound on the expected square risk of the estimator, which statistically motivates our approximation. Finally, we apply our algorithm to simulated data to experimentally validate the statistical guarantees and illustrate its behavior.
Code (0)
등록된 구현이 없습니다.
Tasks
Change Point DetectionClusteringModel SelectionSimilar Papers 제목 키워드 기반
Spatio-temporal Bayesian On-line Changepoint Detection with Model Selection
Bayesian On-line Changepoint Detection is extended to on-line model selection and non-stationary spatio-temporal processes. We propose spatially structured Vector Autoregressions (VARs) for modelling the process between …
Change Point DetectionModel SelectionBayesian Model Selection Approach to Boundary Detection with Non-Local Priors
Based on non-local prior distributions, we propose a Bayesian model selection (BMS) procedure for boundary detection in a sequence of data with multiple systematic mean changes. The BMS method can effectively suppress th…
Boundary DetectionChange Point DetectionModel SelectionReliable data clustering with Bayesian community detection
From neuroscience and genomics to systems biology and ecology, researchers rely on clustering similarity data to uncover modular structure. Yet widely used clustering methods, such as hierarchical clustering, k-means, an…
Community DetectionChangepoint Detection As Model Selection: A General Framework
This dissertation presents a general framework for changepoint detection based on L0 model selection. The core method, Iteratively Reweighted Fused Lasso (IRFL), improves upon the generalized lasso by adaptively reweight…
Online Structural Change-point Detection of High-dimensional Streaming Data via Dynamic Sparse Subspace Learning
High-dimensional streaming data are becoming increasingly ubiquitous in many fields. They often lie in multiple low-dimensional subspaces, and the manifold structures may change abruptly on the time scale due to pattern …
Change Point Detection