A shape-based cutting and clustering algorithm for multiple change-point detection
The reduced complexity algorithm using data-cutting is designed for change-point detection problem. The suspected change-points are selected by the cutting step and the later steps are only implemented on the set of the suspected change-points. As result, the time cost of the proposed method is less than \(O(n)\). The effiency of the proposed algorithm is demonstrated on the scenario reduction for the planning of the grid company which needs analysis of huge amount of data including voltage, current and load for each transformers in a city electric distribution network. The proposed shape-based cutting and clustering algorithm enables auto-segmentation of the objective planning periods, which determine the boundary conditions of the electric distribution network operation.
- Shape-based BS algorithm for multiple change-points detection
- A pruned dynamic programming algorithm to recover the best segmentations with 1 to \(K_{\max}\) change-points
- A pruned recursive solution to the multiple change point problem
- On optimal multiple changepoint algorithms for large data
- Optimal detection of changepoints with a linear computational cost
- Adaptive piecewise polynomial estimation via trend filtering
- Additive models with trend filtering
- An application of changepoint methods in studying the effect of age on survival in breast cancer.
- Application of modified information criterion to multiple change point problems
- Circular binary segmentation for the analysis of array-based DNA copy number data
- Detecting Sparse Signals in Random Fields, With an Application to Brain Mapping
- Detection of the number, locations and magnitudes of jumps
- Estimating the number of change points in a sequence of independent normal random variables
- Fitting multiple change-point models to data
- Group Lasso for structural break time series
- scientific article; zbMATH DE number 425941 (Why is no real title available?)
- scientific article; zbMATH DE number 4169866 (Why is no real title available?)
- scientific article; zbMATH DE number 3766903 (Why is no real title available?)
- scientific article; zbMATH DE number 720689 (Why is no real title available?)
- scientific article; zbMATH DE number 1048663 (Why is no real title available?)
- Least angle regression. (With discussion)
- Locally adaptive regression splines
- Multiple change-point detection via a screening and ranking algorithm
- Multiple change-point detection: a selective overview
- Multiple Change-Point Estimation With a Total Variation Penalty
- Multiple Change-Points Estimation in Linear Regression Models via Sparse Group Lasso
- Multiple testing of local maxima for detection of peaks in 1D
- Multiple testing of local maxima for detection of peaks in ChIP-Seq data
- Parametric statistical change point analysis. With applications to genetics, medicine, and finance
- Spatial smoothing and hot spot detection for CGH data using the fused lasso
- The Influence Curve and Its Role in Robust Estimation
- The screening and ranking algorithm to detect DNA copy number variations
- Wild binary segmentation for multiple change-point detection
- Constrained energy variation for change point detection
- Shape-based BS algorithm for multiple change-points detection
- A sequential feature selection approach to change point detection in mean-shift change point models
- Change-point detection for interval-valued sequences based on the covering rectangle method
- A clustering-based integrated narrowest significance pursuit method for change-point estimation in panel data with application
This page was built for publication: A shape-based cutting and clustering algorithm for multiple change-point detection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2293636)
