Outlier-Robust Convex Segmentation

AAAI 2015 pp. 2701-2707

doi:10.1609/AAAI.V29I1.9637 /aaai/2015/katz2015aaai-outlier/

Abstract

We derive a convex optimization problem for the task of segmenting sequential data, which explicitly treats presence of outliers. We describe two algorithms for solving this problem, one exact and one a top-down novel approach, and we derive a consistency results for the case of two segments and no outliers. Robustness to outliers is evaluated on two real-world tasks related to speech segmentation. Our algorithms outperform baseline segmentation algorithms.

PDF AAAI Semantic Scholar

Cite

Text

Katz and Crammer. "Outlier-Robust Convex Segmentation." AAAI Conference on Artificial Intelligence, 2015. doi:10.1609/AAAI.V29I1.9637

Markdown

[Katz and Crammer. "Outlier-Robust Convex Segmentation." AAAI Conference on Artificial Intelligence, 2015.](https://mlanthology.org/aaai/2015/katz2015aaai-outlier/) doi:10.1609/AAAI.V29I1.9637

BibTeX

@inproceedings{katz2015aaai-outlier,
  title     = {{Outlier-Robust Convex Segmentation}},
  author    = {Katz, Itamar and Crammer, Koby},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2015},
  pages     = {2701-2707},
  doi       = {10.1609/AAAI.V29I1.9637},
  url       = {https://mlanthology.org/aaai/2015/katz2015aaai-outlier/}
}