Optimizing the induction of alternating decision trees

DOI10.1007/3-540-45357-1_50MaRDI QIDQ2768928zbMATH OpenFDO

Authors Bernhard Pfahringer, Geoffrey Holmes, Richard Kirkby

Publication date 10 February 2002

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

Full work available at URL https://doi.org/10.1007/3-540-45357-1_50

zbMATH Keywords

alternating decision tree

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Database theory (68P15) Learning and adaptive systems in artificial intelligence (68T05) Computing methodologies and applications (68U99)

Recommendations

• On Optimization of Decision Trees
• Decision tree induction based on efficient tree restructuring
• scientific article; zbMATH DE number 1931832
• scientific article; zbMATH DE number 2219839
• Algorithms for optimal dyadic decision trees
• Characterization and parallelization of decision-tree induction
• Approximating optimal binary decision trees
• Approximating Optimal Binary Decision Trees

Cited in

(2)

• Modular learning models in forecasting natural phenomena.
• scientific article; zbMATH DE number 1931832 (Why is no real title available?)

This page was built for publication: Optimizing the induction of alternating decision trees

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