Optimization and analysis of decision trees and rules: dynamic programming approach

DOI10.1080/03081079.2013.798902zbMath1272.90108OpenAlexW2051855544MaRDI QIDQ5326154

Talha Amin, Igor Chikalov, Shahid Hussain, Abdulaziz Alkhalid, Beata Zielosko, Mikhail Ju. Moshkov

Publication date: 31 July 2013

Published in: International Journal of General Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081079.2013.798902

zbMATH Keywords

decision rulesdynamic programmingdecision trees

Mathematics Subject Classification ID

Dynamic programming (90C39)

Related Items

Totally optimal decision trees for Boolean functions ⋮ Totally optimal decision rules ⋮ Multi-stage optimization of decision and inhibitory trees for decision tables with many-valued decisions

Uses Software

• UCI-ml
• Dagger
• C4.5

Cites Work

• Unnamed Item
• Unnamed Item
• Rough sets and Boolean reasoning
• A branch-and-bound algorithm to obtain an optimal evaluation tree for monotonic Boolean functions
• Constructing optimal binary decision trees is NP-complete
• Dynamic programming approach to optimization of approximate decision rules
• The synthetic approach to decision table conversion
• Optimizing decision trees through heuristically guided search
• Optimal Binary Identification Procedures