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

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

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

Full description

Bibliographic Details
Main Author: Hussain, Shahid
Other Authors: Moshkov, Mikhail
Language:en
Published: 2016
Subjects:
dynamic programming
Decision Trees
cost functions
bi-criteria optimization
multi-stage optimization
Data Mining
Online Access:Hussain, S. (2016). Extensions of Dynamic Programming: Decision Trees, Combinatorial Optimization, and Data Mining. KAUST Research Repository. https://doi.org/10.25781/KAUST-8602N
http://hdl.handle.net/10754/615875

Internet

Hussain, S. (2016). Extensions of Dynamic Programming: Decision Trees, Combinatorial Optimization, and Data Mining. KAUST Research Repository. https://doi.org/10.25781/KAUST-8602N
http://hdl.handle.net/10754/615875

Similar Items