5 research outputs found
Minimizing the error of linear separators on linearly inseparable data
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.Ministerio de Educación y Ciencia MTM2008-05866-C03-0
Separating bichromatic point sets in the plane by restricted orientation convex hulls
The version of record is available online at: http://dx.doi.org/10.1007/s10898-022-01238-9We explore the separability of point sets in the plane by a restricted-orientation convex hull, which is an orientation-dependent, possibly disconnected, and non-convex enclosing shape that generalizes the convex hull. Let R and B be two disjoint sets of red and blue points in the plane, and O be a set of k=2 lines passing through the origin. We study the problem of computing the set of orientations of the lines of O for which the O-convex hull of R contains no points of B. For k=2 orthogonal lines we have the rectilinear convex hull. In optimal O(nlogn) time and O(n) space, n=|R|+|B|, we compute the set of rotation angles such that, after simultaneously rotating the lines of O around the origin in the same direction, the rectilinear convex hull of R contains no points of B. We generalize this result to the case where O is formed by k=2 lines with arbitrary orientations. In the counter-clockwise circular order of the lines of O, let ai be the angle required to clockwise rotate the ith line so it coincides with its successor. We solve the problem in this case in O(1/T·NlogN) time and O(1/T·N) space, where T=min{a1,…,ak} and N=max{k,|R|+|B|}. We finally consider the case in which O is formed by k=2 lines, one of the lines is fixed, and the second line rotates by an angle that goes from 0 to p. We show that this last case can also be solved in optimal O(nlogn) time and O(n) space, where n=|R|+|B|.Carlos Alegría: Research supported by MIUR Proj. “AHeAD” no 20174LF3T8. David Orden:
Research supported by Project PID2019-104129GB-I00 / AEI / 10.13039/501100011033 of the Spanish
Ministry of Science and Innovation. Carlos Seara: Research supported by Project PID2019-104129GB-I00 /
AEI / 10.13039/501100011033 of the Spanish Ministry of Science and Innovation. Jorge Urrutia: Research
supported in part by SEP-CONACYThis project has received funding from the European Union’s Horizon 2020 research and innovation
programme under the Marie Skłodowska–Curie Grant Agreement No 734922.Peer ReviewedPostprint (published version