Totally Optimal Decision Trees for Monotone Boolean Functions with at Most Five Variables
Permanent link to this recordhttp://hdl.handle.net/10754/552479
MetadataShow full item record
AbstractIn this paper, we present the empirical results for relationships between time (depth) and space (number of nodes) complexity of decision trees computing monotone Boolean functions, with at most five variables. We use Dagger (a tool for optimization of decision trees and decision rules) to conduct experiments. We show that, for each monotone Boolean function with at most five variables, there exists a totally optimal decision tree which is optimal with respect to both depth and number of nodes.
CitationTotally Optimal Decision Trees for Monotone Boolean Functions with at Most Five Variables 2013, 22:359 Procedia Computer Science
JournalProcedia Computer Science
Conference/Event name17th International Conference in Knowledge Based and Intelligent Information and Engineering Systems, KES 2013