Ms.FPOP: A Fast Exact Segmentation Algorithm with a Multiscale Penalty
From MaRDI portal
Cites work
- A pruned dynamic programming algorithm to recover the best segmentations with 1 to \(K_{\max}\) change-points
- Algorithms for the optimal identification of segment neighborhoods
- Asymptotically optimal difference-based estimation of variance in nonparametric regression
- Circular binary segmentation for the analysis of array-based DNA copy number data
- Detecting multiple change-points in the mean of Gaussian process by model selection
- Detecting possibly frequent change-points: wild binary segmentation 2 and steepest-drop model selection
- scientific article; zbMATH DE number 4169866 (Why is no real title available?)
- Minimal penalties and the slope heuristics: a survey
- Multiple Change-Point Estimation With a Total Variation Penalty
- Multiscale change point inference. With discussion and authors' reply
- Narrowest-Over-Threshold Detection of Multiple Change Points and Change-Point-Like Features
- On optimal multiple changepoint algorithms for large data
- On the approximation of curves by line segments using dynamic programming
- Optimal change-point detection and localization
- Optimal detection of changepoints with a linear computational cost
- Relating and comparing methods for detecting changes in mean
- Seeded binary segmentation: a general methodology for fast and optimal changepoint detection
- The DFS fused Lasso: linear-time denoising over general graphs
- Two-stage data segmentation permitting multiscale change points, heavy tails and dependence
This page was built for publication: Ms.FPOP: A Fast Exact Segmentation Algorithm with a Multiscale Penalty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6968039)
