Boris Aronov, Delia Garijo Royo , Yurai Núñez Rodríguez, David Rappaport, Carlos Seara Ojea , Jaime Urrutia Fucugauchi
Given a set of red points R and blue points B we seek to determine a linear separator of the sets, although the sets may be linearly inseparable. Thus we obtain a partition into two parts, where each part may contain some misclassified points. We determine the error of the partition based on the amount of work needed to move the misclassified points. We consider several different measures of work and provide algorithms to find linear separators that minimize the error under these different measures.
© 2008-2024 Fundación Dialnet · Todos los derechos reservados