Greedy algorithm with weights for decision tree construction

MaRDI QIDQ3005908zbMATH OpenFDO

Authors Mikhail Moshkov

Publication date 10 June 2011

Full work available at URL http://iospress.metapress.com/content/n7xr11n106455226/fulltext.html

zbMATH Keywords

decision tabledecision treegreedy algorithmweight

Mathematics Subject Classification ID

Data structures (68P05) Approximation algorithms (68W25)

Recommendations

• Rough Sets and Current Trends in Computing
• scientific article; zbMATH DE number 1983159
• Transactions on Rough Sets I
• scientific article; zbMATH DE number 2032381
• Approximating optimal binary decision trees

Cited in

(10)

• Decision trees for function evaluation: simultaneous optimization of worst and expected cost
• Trading off worst and expected cost in decision tree problems
• Approximating decision trees with value dependent testing costs
• Approximating optimal binary decision trees
• On greedy algorithms for decision trees
• Approximating Optimal Binary Decision Trees
• scientific article; zbMATH DE number 1983159 (Why is no real title available?)
• scientific article; zbMATH DE number 2032381 (Why is no real title available?)
• Transactions on Rough Sets I
• Rough Sets and Current Trends in Computing

This page was built for publication: Greedy algorithm with weights for decision tree construction

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