Learning sparse penalties for change-point detection using max margin interval regression

30th International Conference on Machine Learning, ICML 2013

Volumn , Issue PART 2, 2013, Pages 1209-1217

  Rigaill, Guillem ^a   Hocking, Toby Dylan ^b   Bach, Francis ^b   Vert, Jean Philippe ^c  

^a UNIVERSITÉ D EVRY VAL D ESSONNE   (France)

^b Centre National de la Recherche Scientifique   (France)

^c INSERM U900   (France)

Author keywords

[No Author keywords available]

Indexed keywords

GRADIENT METHODS; RELAXATION PROCESSES;

ACCELERATED PROXIMAL GRADIENT METHODS; CHANGE POINT DETECTION; CHANGE-POINTS; CONVEX RELAXATION; DNA COPY NUMBERS; INTERVAL REGRESSION; NEUROBLASTOMAS; SEGMENTATION MODELS;

LEARNING SYSTEMS;

EID: 84897519123     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (26)

1. Auger, I E and Lawrence, C E. Algorithms for the optimal identification of segment neighborhoods. Bulletin of mathematical biology, 51(1):39-54, 1989. (Pubitemid 19036571)
2. Bai, J. and Perron, P. Computation and analysis of multiple structural change models. J. Appl. Econ., 18:1-22, 2003.
3. Baraud, Y., Giraud, C., and Huet, S. Gaussian model selection with unknown variance. Ann. Statist., 37(2):630-672, 2009.
4. Beck, A. and Teboulle, M. A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Imaging Sciences, 2(1):183-202, 2009.
5. Birgé, L. and Massart, P. Minimal penalties for gaussian model selection. Probability Th. and Related Fields, 138:33-73, 2007.
6. Bottou, Léon and Bousquet, Olivier. The tradeoffs of large scale learning. In Platt, J.C., Koller, D., Singer, Y., and Roweis, S. (eds.), NIPS, pp. 161-168. 2008.
7. Braun, J. V., Braun, R. K., and Muller, H. G. Multiple changepoint fitting via quasilikelihood, with application to DNA sequence segmentation. Biometrika, 87(2):301-314, June 2000.
8. Flamary, R., Jrad, N., Phlypo, R., Congedo, M., and Rakotomamonjy, A. Mixed-norm regularization for brain decoding. HAL tech. report 00708243, 2012.
9. Gillet, O., Essid, S., and Richard, G. On the correlation of automatic audio and visual segmentations of music videos. IEEE Trans. Cir. and Sys. for Video Technol., 17(3):347355, March 2007.
10. Hall, P., Kay, J. W., and Titterinton, D. M. Asymptotically optimal difference-based estimation of variance in nonparametric regression. Biometrika, 77(3):521-528, January 1990.
11. Harchaoui, Zaid and Levy-Leduc, Céline. Catching change-points with lasso. In Platt, J.C., Roller, D., Singer, Y., and Roweis, S. (eds.), NIPS, pp. 617-624. MIT Press, Cambridge, MA, 2008.
12. Hocking, T.D., Schleiermacher, G, Janoueix-Lerosey, I., Delattre, O., Bach, F., and Vert, J.-P. Learning smoothing models using breakpoint annotations. HAL technical report 00663790, 2012.
13. Jackson, B., Scargle, J.D., Barnes, D., Arabhi, S., Alt, A., Gioumousis, P., Gwin, E., San, P., Tan, L., and Tsai, Tun Tao. An algorithm for optimal partitioning of data on an interval. IEEE Signal Processing Letters, 12(2):105-108, February 2005.
14. Killick, R., Fearnhead, P., and Eckley, I. A. Optimal detection of changepoints with a linear computational cost. arXiv.1101.1438, January 2011.
15. Lavielle, M. Using penalized contrasts for the change-point problem. Sig. Proc., 85(8):1501-1510, 2005. (Pubitemid 40762449)
16. Lebarbier, E. Detecting multiple change-points in the mean of gaussian process by model selection. Signal Processing, 85:717-736, 2005. (Pubitemid 40259512)
17. Lee, C.-B. Estimating the number of change points in a sequence of independent normal random variables. Statist. Proba. Lett., 25(3):241-8, 1995.
18. Picard, Franck, Hoebeke, Mark, Lebarbier, Emilie, Miele, Vincent, Rigaill, Guillem, and Robin, Stephane. cghseg: Segmentation methods for array CGH analysis, 2012. R package version 1.0.1.
19. Rigaill, G. Pruned dynamic programming for optimal multiple change-point detection. arXiv:1004.0887, 2010.
20. Schwarz, G. Estimating the dimension of a model. Ann. Statist., 6(2):461-4, 1978.
21. Tibshirani, Robert and Wang, Pei. Spatial smoothing and hot spot detection for CGH data using the fused lasso. Biostatistics, 9(1):18-29, January 2008.
22. Vapnik, V., Golowich, S., and Smola, A. J. Support vector method for function approximation, regression estimation, and signal processing. In Mozer, M. C., Jordan, M. I., and Petsche, T. (eds.), NIPS, pp. 281-287, 1997.
23. Venkatraman, E S and Olshen, Adam B. A faster circular binary segmentation algorithm for the analysis of array CGH data. Bioinformatics, 23(6):657-663, March 2007.
24. Vert, Jean-Philippe and Bleakley, Kevin. Fast detection of multiple change-points shared by many signals using group LARS. In Lafferty, J., Williams, C. K. I., Shawe-Taylor, J., Zemel, R. S., and Cullota, A. (eds.), NIPS, pp. 2343-2351, 2010.
25. Yao, Y.-C. Estimating the number of change-points via Schwarz' criterion. Statistics & Probability Letters, 6(3):181-189, February 1988.
26. Zhang, N. R. and Siegmund, D. O. A modified Bayes information criterion with applications to the analysis of comparative genomic hybridization data. Biometrics, 63(1):22-32, 2007.