Extensions of Dynamic Programming: Decision Trees, Combinatorial Optimization, and Data Mining

Handle URI:
http://hdl.handle.net/10754/615875
Title:
Extensions of Dynamic Programming: Decision Trees, Combinatorial Optimization, and Data Mining
Authors:
Hussain, Shahid ( 0000-0002-1698-2809 )
Abstract:
This thesis is devoted to the development of extensions of dynamic programming to the study of decision trees. The considered extensions allow us to make multi-stage optimization of decision trees relative to a sequence of cost functions, to count the number of optimal trees, and to study relationships: cost vs cost and cost vs uncertainty for decision trees by construction of the set of Pareto-optimal points for the corresponding bi-criteria optimization problem. The applications include study of totally optimal (simultaneously optimal relative to a number of cost functions) decision trees for Boolean functions, improvement of bounds on complexity of decision trees for diagnosis of circuits, study of time and memory trade-off for corner point detection, study of decision rules derived from decision trees, creation of new procedure (multi-pruning) for construction of classifiers, and comparison of heuristics for decision tree construction. Part of these extensions (multi-stage optimization) was generalized to well-known combinatorial optimization problems: matrix chain multiplication, binary search trees, global sequence alignment, and optimal paths in directed graphs.
Advisors:
Moshkov, Mikhail ( 0000-0003-0085-9483 )
Committee Member:
Alouini, Mohamed-Slim ( 0000-0003-4827-1793 ) ; Shihada, Basem ( 0000-0003-4434-4334 ) ; Boros, Endre
KAUST Department:
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Program:
Computer Science
Issue Date:
10-Jul-2016
Type:
Dissertation
Appears in Collections:
Dissertations

Full metadata record

DC FieldValue Language
dc.contributor.advisorMoshkov, Mikhailen
dc.contributor.authorHussain, Shahiden
dc.date.accessioned2016-07-10T08:44:28Z-
dc.date.available2016-07-10T08:44:28Z-
dc.date.issued2016-07-10-
dc.identifier.urihttp://hdl.handle.net/10754/615875-
dc.description.abstractThis thesis is devoted to the development of extensions of dynamic programming to the study of decision trees. The considered extensions allow us to make multi-stage optimization of decision trees relative to a sequence of cost functions, to count the number of optimal trees, and to study relationships: cost vs cost and cost vs uncertainty for decision trees by construction of the set of Pareto-optimal points for the corresponding bi-criteria optimization problem. The applications include study of totally optimal (simultaneously optimal relative to a number of cost functions) decision trees for Boolean functions, improvement of bounds on complexity of decision trees for diagnosis of circuits, study of time and memory trade-off for corner point detection, study of decision rules derived from decision trees, creation of new procedure (multi-pruning) for construction of classifiers, and comparison of heuristics for decision tree construction. Part of these extensions (multi-stage optimization) was generalized to well-known combinatorial optimization problems: matrix chain multiplication, binary search trees, global sequence alignment, and optimal paths in directed graphs.en
dc.language.isoenen
dc.subjectdynamic programmingen
dc.subjectDecision Treesen
dc.subjectcost functionsen
dc.subjectbi-criteria optimizationen
dc.subjectmulti-stage optimizationen
dc.subjectData Miningen
dc.titleExtensions of Dynamic Programming: Decision Trees, Combinatorial Optimization, and Data Miningen
dc.typeDissertationen
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Divisionen
thesis.degree.grantorKing Abdullah University of Science and Technologyen_GB
dc.contributor.committeememberAlouini, Mohamed-Slimen
dc.contributor.committeememberShihada, Basemen
dc.contributor.committeememberBoros, Endreen
thesis.degree.disciplineComputer Scienceen
thesis.degree.nameDoctor of Philosophyen
dc.person.id102019en
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.