Back to Search
Start Over
Totally Optimal Decision Trees for Monotone Boolean Functions with at Most Five Variables.
- Source :
- Procedia Computer Science; Aug2013, Vol. 22, p359-365, 7p
- Publication Year :
- 2013
-
Abstract
- 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. [Copyright &y& Elsevier]
Details
- Language :
- English
- ISSN :
- 18770509
- Volume :
- 22
- Database :
- Supplemental Index
- Journal :
- Procedia Computer Science
- Publication Type :
- Academic Journal
- Accession number :
- 90525703
- Full Text :
- https://doi.org/10.1016/j.procs.2013.09.113