Point probe decision trees for geometric concept classes

DOI10.1007/3-540-57155-8_239MaRDI QIDQ5060103zbMATH OpenOpenAlexFDO

Authors Esther M. Arkin, Joseph S. B. Mitchell, David M. Mount, Christine D. Piatko, Michael T. Goodrich, Steven Skiena

Publication date 18 January 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-57155-8_239

Mathematics Subject Classification ID

Machine vision and scene understanding (68T45)

Recommendations

• Decision Trees for Geometric Models
• Model-based probing strategies for convex polygons
• On the Difficulty of Designing Good Classifiers
• Parallel strategies for geometric probing
• Probing a scene of nonconvex polyhedra

Cites work

• An optimal algorithm for intersecting line segments in the plane
• Constructing optimal binary decision trees is NP-complete
• On the ratio of optimal integral and fractional covers
• Optimal Binary Identification Procedures

Cited in

(5)

• Recognizing polygonal parts width measurements
• Exact learning from an honest teacher that answers membership queries
• Decision Trees for Geometric Models
• scientific article; zbMATH DE number 1406082 (Why is no real title available?)
• On Polynomial Time Constructions of Minimum Height Decision Tree

This page was built for publication: Point probe decision trees for geometric concept classes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5060103)