Artículo
Minimizing the error of linear separators on linearly inseparable data
Autor/es | Aronov, Boris
Garijo Royo, Delia Núñez Rodríguez, Yurai Rappaport, David Seara, Carlos Urrutia, Jorge |
Departamento | Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII) |
Fecha de publicación | 2012 |
Fecha de depósito | 2020-06-19 |
Publicado en |
|
Resumen | Given linearly inseparable sets R of red points and B of blue points, we consider several
measures of how far they are from being separable. Intuitively, given a potential separator
(‘‘classifier’’), we measure its quality ... Given linearly inseparable sets R of red points and B of blue points, we consider several measures of how far they are from being separable. Intuitively, given a potential separator (‘‘classifier’’), we measure its quality (‘‘error’’) according to how much work it would take to move the misclassified points across the classifier to yield separated sets. We consider several measures of work and provide algorithms to find linear classifiers that minimize the error under these different measures. |
Agencias financiadoras | Ministerio de Educación y Ciencia (MEC). España |
Identificador del proyecto | MTM2008-05866-C03-01 |
Cita | Aronov, B., Garijo Royo, D., Núñez Rodríguez, Y., Rappaport, D., Seara, C. y Urrutia, J. (2012). Minimizing the error of linear separators on linearly inseparable data. Discrete Applied Mathematics, 160 (10-11), 1441-1452. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
Minimizing the error of linear ... | 245.5Kb | [PDF] | Ver/ | |