Seeded binary segmentation: a general methodology for fast and optimal changepoint detection
From MaRDI portal
Publication:5879532
Recommendations
- Wild binary segmentation for multiple change-point detection
- On optimal segmentation and parameter tuning for multiple change-point detection and inference
- Change-point detection, segmentation, and related topics
- Detecting possibly frequent change-points: wild binary segmentation 2 and steepest-drop model selection
- Ensemble binary segmentation for irregularly spaced data with change-points
- Short communication: Detecting possibly frequent change-points: wild binary segmentation 2 and steepest-drop model selection
- A pruned dynamic programming algorithm to recover the best segmentations with 1 to \(K_{\max}\) change-points
- Multiple change-point detection for non-stationary time series using wild binary segmentation
- Multiscale change-point segmentation: beyond step functions
- Multiscale change-point segmentation: beyond step functions
Cited in
(8)- Short communication: Detecting possibly frequent change-points: wild binary segmentation 2 and steepest-drop model selection
- Generalized multiple change-point detection in the structure of multivariate, possibly high-dimensional, data sequences
- Optimal change-point detection and localization
- A communication-efficient, online changepoint detection method for monitoring distributed sensor networks
- Cross-validation for change-point regression: pitfalls and solutions
- Efficient sparsity adaptive changepoint estimation
- Multiple change point detection in functional data with applications to biomechanical fatigue data
- Data-driven selection of the number of change-points via error rate control
This page was built for publication: Seeded binary segmentation: a general methodology for fast and optimal changepoint detection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5879532)
