SEPARABILITY OF POINT SETS BY k-LEVEL LINEAR CLASSIFICATION TREES

DOI10.1142/S0218195912500021zbMath1251.68279OpenAlexW2043368640MaRDI QIDQ4650094

Carlos Seara, Joseph S. B. Mitchell, Delia Garijo, Esther M. Arkin, Alberto Márquez

Publication date: 23 November 2012

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195912500021

zbMATH Keywords

classificationdecision treesmachine learningbinary space partitionsred-blue separation

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Learning and adaptive systems in artificial intelligence (68T05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Unnamed Item
• Minimum polygonal separation
• On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees
• Separability by two lines and by nearly straight polygonal chains
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• On the Difficulty of Designing Good Classifiers
• SOME LOWER BOUNDS ON GEOMETRIC SEPARABILITY PROBLEMS
• Separating objects in the plane by wedges and strips

This page was built for publication: SEPARABILITY OF POINT SETS BY k-LEVEL LINEAR CLASSIFICATION TREES