Robust change point detection method via adaptive LAD-LASSO
- 326 Downloads
Change point problem is one of the hot issues in statistics, econometrics, signal processing and so on. LAD estimator is more robust than OLS estimator, especially when datasets subject to heavy tailed errors or outliers. LASSO is a popular choice for shrinkage estimation. In the paper, we combine the two classical ideas together to put forward a robust detection method via adaptive LAD-LASSO to estimate change points in the mean-shift model. The basic idea is converting the change point estimation problem into variable selection problem with penalty. An enhanced two-step procedure is proposed. Simulation and a real example show that the novel method is really feasible and the fast and effective computation algorithm is easier to realize.
KeywordsChange point detection Adaptive LAD-LASSO Variable selection Robustness Screening
Mathematics Subject Classification62F35 62J07
This work was supported in part by the National Natural Science Foundation of China (Grant No. 71271128 and Grant No. 71540038), the Natural Science Foundation of Shandong Province in China (Grant No. ZR2014AL006) and the Talent Research Fund of Taishan University (Grant No. Y-01-2016002). The authors thank the Editor and the three Referees for their very helpful comments and suggestions.
- Angelosante D, Giannakis GI (2012) Group lassoing change-points in piecewise-constant AR processes. EURASIP J Adv Signal Process 70(1):1–16Google Scholar
- Gao X, Huang J (2010b) A robust penalized method for the analysis of noisy DNA copy number data. BMC Genomics 11(517):1–10Google Scholar
- Harchaoui Z, Lévy-Leduc C (2008) Catching change-points with lasso. Adv Neural Inf Process Syst 20:161–168Google Scholar