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

Handle URI:
http://hdl.handle.net/10754/552479
Title:
Totally Optimal Decision Trees for Monotone Boolean Functions with at Most Five Variables
Authors:
Chikalov, Igor; Hussain, Shahid ( 0000-0002-1698-2809 ) ; Moshkov, Mikhail ( 0000-0003-0085-9483 )
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.
KAUST Department:
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Citation:
Totally Optimal Decision Trees for Monotone Boolean Functions with at Most Five Variables 2013, 22:359 Procedia Computer Science
Publisher:
Elsevier BV
Journal:
Procedia Computer Science
Conference/Event name:
17th International Conference in Knowledge Based and Intelligent Information and Engineering Systems, KES 2013
Issue Date:
2013
DOI:
10.1016/j.procs.2013.09.113
Type:
Conference Paper
ISSN:
18770509
Additional Links:
http://linkinghub.elsevier.com/retrieve/pii/S187705091300906X
Appears in Collections:
Conference Papers; Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

Full metadata record

DC FieldValue Language
dc.contributor.authorChikalov, Igoren
dc.contributor.authorHussain, Shahiden
dc.contributor.authorMoshkov, Mikhailen
dc.date.accessioned2015-05-07T14:17:16Zen
dc.date.available2015-05-07T14:17:16Zen
dc.date.issued2013en
dc.identifier.citationTotally Optimal Decision Trees for Monotone Boolean Functions with at Most Five Variables 2013, 22:359 Procedia Computer Scienceen
dc.identifier.issn18770509en
dc.identifier.doi10.1016/j.procs.2013.09.113en
dc.identifier.urihttp://hdl.handle.net/10754/552479en
dc.description.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.en
dc.publisherElsevier BVen
dc.relation.urlhttp://linkinghub.elsevier.com/retrieve/pii/S187705091300906Xen
dc.rightsArchived with thanks to Procedia Computer Science. http://creativecommons.org/licenses/by-nc-nd/3.0/en
dc.subjectTotally optimal decision treesen
dc.subjectmonotone Boolean functionsen
dc.subjectnumber of nodes and depth of decision treesen
dc.titleTotally Optimal Decision Trees for Monotone Boolean Functions with at Most Five Variablesen
dc.typeConference Paperen
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Divisionen
dc.identifier.journalProcedia Computer Scienceen
dc.conference.date2013-09-09 to 2013-09-11en
dc.conference.name17th International Conference in Knowledge Based and Intelligent Information and Engineering Systems, KES 2013en
dc.conference.locationKitakyushu, JPNen
dc.eprint.versionPublisher's Version/PDFen
kaust.authorChikalov, Igoren
kaust.authorHussain, Shahiden
kaust.authorMoshkov, Mikhailen
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.