On learning decision trees with large output domains

DOI10.1007/PL00009188zbMATH Open0895.68127OpenAlexW1984365642MaRDI QIDQ1386355FDOQ1386355

Nader H. Bshouty, C. Tamon, David K. Wilson

Publication date: 20 September 1998

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00009188

zbMATH Keywords

decision treeslearnability

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cited In (2)

• End-to-end learning of decision trees and forests
• Simple Learning Algorithms for Decision Trees and Multivariate Polynomials

   Recommendations

• Learning decision trees from random examples 👍 👎
• Simple Learning Algorithms for Decision Trees and Multivariate Polynomials 👍 👎
• Learning boxes in high dimension 👍 👎

This page was built for publication: On learning decision trees with large output domains

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