Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
490412 | Procedia Computer Science | 2013 | 7 Pages |
Abstract
In 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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)