A Dynamic Programming Algorithm for the Fused Lasso and L 0-Segmentation
暂无分享,去创建一个
[1] R. Bellman. On the approximation of curves by line segments using dynamic programming , 1961, CACM.
[2] Lawrence R. Rabiner,et al. A tutorial on hidden Markov models and selected applications in speech recognition , 1989, Proc. IEEE.
[3] Durbin,et al. Biological Sequence Analysis , 1998 .
[4] Sean R. Eddy,et al. Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids , 1998 .
[5] Alan S. Willsky,et al. Nonlinear evolution equations as fast and exact solvers of estimation problems , 2005, IEEE Transactions on Signal Processing.
[6] Stephen P. Boyd,et al. Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.
[7] R. Tibshirani,et al. PATHWISE COORDINATE OPTIMIZATION , 2007, 0708.1485.
[8] R. Tibshirani,et al. Spatial smoothing and hot spot detection for CGH data using the fused lasso. , 2008, Biostatistics.
[9] Quentin F. Stout,et al. Unimodal regression via prefix isotonic regression , 2008, Comput. Stat. Data Anal..
[10] Stephen P. Boyd,et al. 1 Trend Filtering , 2009, SIAM Rev..