Reducing complexity of decision trees with two variable tests

DOI10.1007/3-540-61863-5_37MaRDI QIDQ3556983zbMATH OpenOpenAlexFDO

Authors Robert A. Pearson, E. K. T. Smith

Publication date 27 April 2010

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

Full work available at URL https://doi.org/10.1007/3-540-61863-5_37

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Approximating decision trees with value dependent testing costs
• Estimates for the depth of decision trees over finite two-valued systems of tests.
• Minimizing depth of decision trees with hypotheses
• Decision tree reduction

Cited in

(1)

• scientific article; zbMATH DE number 2101258 (Why is no real title available?)

This page was built for publication: Reducing complexity of decision trees with two variable tests

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