1 |
Friedman J, Hastie T, Hofling H, and Tibshirani R (2007). Pathwise coordinate optimization. The Annals of Applied Statistics, 1 (2), 302-332.
DOI
|
2 |
Hoefling H (2010). A path algorithm for the fused lasso signal approximator. Journal of Computational and Graphical Statistics, 19 (4), 984-1006.
DOI
|
3 |
Olshen AB, Venkatraman ES, Lucito R, and Wigler M (2004). Circular binary segmentation for the analysis of array-based DNA copy number data. Biostatistics, 5 (4), 557-572.
DOI
|
4 |
Son W and Lim J (2019). Modified path algorithm of fused lasso signal approximator for consistent recovery of change points. Jounal of Statistical Planning and Inference, 200, 223-238.
DOI
|
5 |
Fryzlewicz P (2014). Wild binary segmentation for multiple change-point detection. The Annals of Statistics, 42 (6), 2243-2281.
DOI
|
6 |
Hodrick RJ and Prescott EC (1997). Postwar US business cycles: an empirical investigation. Journal of Money, credit, and Banking, 29 (1), 1-16.
DOI
|
7 |
Kim SJ, Koh K, Boyd S, and Gorinevsky D (2009). ℓ1 trend filtering. SIAM Review, 51 (2), 339-360.
DOI
|
8 |
Pettitt AN (1979). A non-parametric approach to the change-point problem. Journal of the Royal Statistical Society: Series C (Applied Statistics), 28 (2), 126-135.
DOI
|
9 |
Rojas CR and Wahlberg B (2014). On change point detection using the fused lasso method. arXiv preprint arXiv:1401.5408.
|
10 |
Tibshirani R, Saunders M, Rosset S, Zhu J, and Knight K (2005). Sparsity and smoothness via the fused lasso. Journal of the Royal Statistical Society: Series B, 67 (1), 91-108.
DOI
|
11 |
Yao YC (1988). Estimating the number of change-points via Schwarz' criterion. Statistics and Probability Letters, 6 (3), 181-189.
DOI
|