Abstract
In segmentation models, the number of change-points is typically chosen using a penalized cost function. In this work, we propose to learn the penalty and its constants in databases of signals with weak change-point annotations. We propose a convex relaxation for the resulting interval regression problem, and solve it using accelerated proximal gradient methods. We show that this method achieves state-of-the-art change-point detection in a database of annotated DNA copy number profiles from neuroblastoma tumors.
Original language | English (US) |
---|---|
Pages | 1209-1217 |
Number of pages | 9 |
State | Published - 2013 |
Externally published | Yes |
Event | 30th International Conference on Machine Learning, ICML 2013 - Atlanta, GA, United States Duration: Jun 16 2013 → Jun 21 2013 |
Conference
Conference | 30th International Conference on Machine Learning, ICML 2013 |
---|---|
Country/Territory | United States |
City | Atlanta, GA |
Period | 6/16/13 → 6/21/13 |
ASJC Scopus subject areas
- Human-Computer Interaction
- Sociology and Political Science