Approximate algorithm for minimization of decision tree depth

DOI10.1007/3-540-39205-X_100MaRDI QIDQ4427049zbMATH OpenFDO

Authors Mikhail Moshkov

Publication date 18 September 2003

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/2639/26390611.htm

zbMATH Keywords

data tabledecision tabledecision treedepth

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Knowledge representation (68T30)

Recommendations

• Transactions on Rough Sets I
• Rough Sets and Current Trends in Computing
• Greedy algorithm with weights for decision tree construction
• scientific article; zbMATH DE number 1455626
• A greedy algorithm for construction of decision trees for tables with many-valued decisions -- a comparative study

Cited in

(11)

• Feature minimization within decision trees
• On the decision tree depth
• Decision trees for function evaluation: simultaneous optimization of worst and expected cost
• Minimization of decision trees is hard to approximate
• Minimizing depth of decision trees with hypotheses
• Greedy algorithm with weights for decision tree construction
• Totally optimal decision trees for Boolean functions
• scientific article; zbMATH DE number 1455626 (Why is no real title available?)
• Evaluation of monotone DNF formulas
• Transactions on Rough Sets I
• Rough Sets and Current Trends in Computing

This page was built for publication: Approximate algorithm for minimization of decision tree depth

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