An efficient extension to mixture techniques for prediction and decision trees

DOI10.1023/A:1007670818503MaRDI QIDQ1961318zbMATH OpenFDO

Authors Yanyan Li

Publication date 17 January 2000

Published in Machine Learning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/A:1007670818503

zbMATH Keywords

edge-based prunings

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Recommendations

• Learning with mixtures of trees.
• scientific article; zbMATH DE number 2086338
• Predicting nearly as well as the best pruning of a decision tree through dynamic programming scheme
• Predicting nearly as well as the best pruning of a planar decision graph.
• scientific article; zbMATH DE number 1453050

Cited in

(8)

• Improving mixture tree construction using better EM algorithms
• Predicting nearly as well as the best pruning of a planar decision graph.
• On approximating weighted sums with exponentially many terms
• Learning with mixtures of trees.
• scientific article; zbMATH DE number 2086338 (Why is no real title available?)
• Conditional mix incrementing algorithm for grapheme-to-phoneme conversion
• scientific article; zbMATH DE number 1453050 (Why is no real title available?)
• Predicting nearly as well as the best pruning of a decision tree through dynamic programming scheme

This page was built for publication: An efficient extension to mixture techniques for prediction and decision trees

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