Totally Optimal Decision Trees for Monotone Boolean Functions with at Most Five Variables

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 e...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Procedia computer science Jg. 22; S. 359 - 365
Hauptverfasser: Chikalov, Igor, Hussain, Shahid, Moshkov, Mikhail
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier B.V 2013
Schlagworte:
monotone Boolean functions
number of nodes and depth of decision trees
Totally optimal decision trees
number of nodes and depth of decision trees
monotone Boolean functions
Totally optimal decision trees
ISSN:1877-0509, 1877-0509
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:1877-0509
1877-0509
DOI:10.1016/j.procs.2013.09.113