Sciweavers

AAAI
2015

Outlier-Robust Convex Segmentation

8 years 1 months ago
Outlier-Robust Convex Segmentation
We address the task of segmenting sequential data using convex optimization problem, which is specifically designed to work in the context of outliers in the data. We propose two algorithms for solving this problem, one exact and one a top-down hierarchical approach. Robustness to outliers is evaluated on a real-world task related to speech segmentation. Our algorithms outperform baseline segmentation algorithms.
Itamar Katz, Koby Crammer
Added 27 Mar 2016
Updated 27 Mar 2016
Type Journal
Year 2015
Where AAAI
Authors Itamar Katz, Koby Crammer
Comments (0)