Minimizing the error of linear separators on linearly inseparable data

DOI10.1016/j.dam.2012.03.009zbMath1243.68158OpenAlexW2048831243MaRDI QIDQ427883

Yurai Núñez-Rodríguez, David Rappaport, Boris Aronov, Delia Garijo, Jorge Urrutia, Carlos Seara

Publication date: 18 June 2012

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2012.03.009

zbMATH Keywords

classifierserror minimizerslinearly inseparable

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)

Related Items (5)

Separability of imprecise points ⋮ Regularizing conjunctive features for classification ⋮ Separating bichromatic point sets in the plane by restricted orientation convex hulls ⋮ PAC-learning in the presence of one-sided classification~noise ⋮ Algorithms for Radon partitions with tolerance

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithms for weak and wide separation of sets
• \(k\)-sets in four dimensions
• Computing circular separability
• Maintenance of configurations in the plane
• An optimal convex hull algorithm in any fixed dimension
• \(k\)-violation linear programming
• On levels in arrangements of lines, segments, planes, and triangles
• Improved bounds for planar \(k\)-sets and related problems
• Time bounds for selection
• New applications of random sampling in computational geometry
• Applications of random sampling in computational geometry. II
• On a class of \(O(n^ 2)\) problems in computational geometry
• Computing the intersection-depth to polyhedra
• On the complexity of working set selection
• Taking a Walk in a Planar Arrangement
• Bichromatic separability with two boxes: A general approach
• A dynamic data structure for 3-D convex hulls and 2-D nearest neighbor queries
• On Approximating the Depth and Related Problems
• On k-Hulls and Related Problems
• Linear Programming in Linear Time When the Dimension Is Fixed
• Computing the width of a set
• Random Sampling, Halfspace Range Reporting, and Construction of \lowercase$(\le k)$-Levels in Three Dimensions
• COMPUTING LARGEST CIRCLES SEPARATING TWO SETS OF SEGMENTS
• APPROXIMATING THE DIAMETER, WIDTH, SMALLEST ENCLOSING CYLINDER, AND MINIMUM-WIDTH ANNULUS
• SOME LOWER BOUNDS ON GEOMETRIC SEPARABILITY PROBLEMS
• Low-Dimensional Linear Programming with Violations
• Arbitrary-norm hyperplane separation by variable neighbourhood search
• AN OPTIMAL ALGORITHM FOR COMPUTING (≤K)-LEVELS, WITH APPLICATIONS
• Separating objects in the plane by wedges and strips
• Point sets with many \(k\)-sets
• An improved bound for \(k\)-sets in three dimensions

This page was built for publication: Minimizing the error of linear separators on linearly inseparable data