# Chance constrained conic-segmentation support vector machine with uncertain data

arXiv: https://arxiv.org/abs/2107.13319 · HTML: https://mlsanity.com/paper/2107.13319/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 0 of its 27 references that are in the map.
- First posted on arXiv 28 Jul 2021.

## Abstract (arXiv)

Support vector machines (SVM) is one of the well known supervised classes of learning algorithms. Furthermore, the conic-segmentation SVM (CS-SVM) is a natural multiclass analogue of the standard binary SVM, as CS-SVM models are dealing with the situation where the exact values of the data points are known. This paper studies CS-SVM when the data points are uncertain or mislabelled. With some properties known for the distributions, a chance-constrained CS-SVM approach is used to ensure the small probability of misclassification for the uncertain data. The geometric interpretation is presented to show how CS-SVM works. Finally, we present experimental results to investigate the chance constrained CS-SVM's performance.