Help Privacy Policy Disclaimer
  Advanced SearchBrowse




Conference Paper

On the discardability of data in Support Vector Classification problems


Dinuzzo,  F.
Dept. Empirical Inference, Max Planck Institute for Intelligent Systems, Max Planck Society;

Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available

Del Favero, S., Varagnolo, D., Dinuzzo, F., Schenato, L., & Pillonetto, G. (2011). On the discardability of data in Support Vector Classification problems. In 50th IEEE Conference on Decision and Control and European Control Conference (CDC - ECC 2011) (pp. 3210-3215). Piscataway, NJ, USA: IEEE.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0013-B8DA-F
We analyze the problem of data sets reduction for support vector classification. The work is also motivated by distributed problems, where sensors collect binary measurements at different locations moving inside an environment that needs to be divided into a collection of regions labeled in two different ways. The scope is to let each agent retain and exchange only those measurements that are mostly informative for the collective reconstruction of the decision boundary. For the case of separable classes, we provide the exact conditions and an efficient algorithm to determine if an element in the training set can become a support vector when new data arrive. The analysis is then extended to the non-separable case deriving a sufficient discardability condition and a general data selection scheme for classification. Numerical experiments relative to the distributed problem show that the proposed procedure allows the agents to exchange a small amount of the collected data to obtain a highly predictive decision boundary.