On the Difficulty of Designing Good Classifiers

DOI10.1137/S009753979630814XzbMath0959.68044OpenAlexW1983741890MaRDI QIDQ4507352

Vincent Mirelli, Christos H. Papadimitriou, Michelangelo Grigni

Publication date: 18 October 2000

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s009753979630814x

zbMATH Keywords

hardness of approximationparameterized complexitylinear decision tree

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

SEPARABILITY OF POINT SETS BY k-LEVEL LINEAR CLASSIFICATION TREES ⋮ On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems

This page was built for publication: On the Difficulty of Designing Good Classifiers