Average-case analysis of classification algorithms for Boolean functions and decision trees

DOI10.1007/3-540-40992-0_15MaRDI QIDQ4473242zbMATH OpenFDO

Authors Tobias Scheffer

Publication date 4 August 2004

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/1968/19680194.htm

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Recommendations

• Probabilistic characterization of random decision trees
• Relationships between Average Depth and Number of Misclassifications for Decision Trees
• scientific article; zbMATH DE number 1400207
• scientific article; zbMATH DE number 1810489
• Learning Monotone Decision Trees in Polynomial Time

Cited in

(4)

• Effects of domain characteristics on instance-based learning algorithms.
• Average case analysis for tree labelling schemes
• Probabilistic characterization of random decision trees
• scientific article; zbMATH DE number 1400207 (Why is no real title available?)

This page was built for publication: Average-case analysis of classification algorithms for Boolean functions and decision trees

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