Trading accuracy for simplicity in decision trees

zbMath0811.68112MaRDI QIDQ1332700

Ivan Bratko, Marko Bohanec

Publication date: 1 May 1995

Published in: Machine Learning (Search for Journal in Brave)

zbMATH Keywords

dynamic programmingknowledge representationpruning algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Dynamic programming (90C39) Knowledge representation (68T30) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (6)

Evaluation of decision trees: a multi-criteria approach ⋮ An experimental evaluation of simplicity in rule learning ⋮ An efficient algorithm for optimal pruning of decision trees ⋮ Post-pruning in decision tree induction using multiple performance measures ⋮ Bi-criteria optimization of decision trees with applications to data analysis ⋮ Stochastic dynamic programming with factored representations

This page was built for publication: Trading accuracy for simplicity in decision trees