On the difficulty of designing good classifiers

DOI10.1007/3-540-61332-3_161zbMath1529.68113OpenAlexW1904399400MaRDI QIDQ6184672

Vincent Mirelli, Michelangelo Grigni, Christos H. Papadimitriou

Publication date: 29 January 2024

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

Full work available at URL: https://doi.org/10.1007/3-540-61332-3_161

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• On the complexity of polyhedral separability
• Structure preserving reductions among convex optimization problems
• Constructing optimal binary decision trees is NP-complete
• Beyond NP-completeness for problems of bounded width (extended abstract)
• On the hardness of approximating minimization problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the difficulty of designing good classifiers