Preparation of the Book “Extensions of Dynamic Programming for Data Mining and Combinatorial Optimization” (initiative project) OverviewDevelopment of extensions of dynamic programming approach for study of (I) decision trees and rules (counting the number of optimal trees and rules, multi-stage optimization, construction of the set of Pareto optimal points, study of relationships between two cost functions and between cost and uncertainty) (II) element-based trees over rectangular meshes (counting of the number of optimal trees, multi-stage optimization, construction of the set of Pareto optimal points and study of relationships between two cost functions), (III) combinatorial optimization problems that allow usual dynamic programming approach (counting the number of optimal solutions, multi-stage optimization).Experimental study of various problems connected with decision trees, decision rules, and element-based trees. Details Development of extensions of dynamic programming approach for study of decision trees and rules (counting the number of optimal trees and rules, multi-stage optimization, construction of the set of Pareto optimal points, study of relationships between two cost functions and between cost and uncertainty), element-based trees over rectangular meshes (counting of the number of optimal trees, multi-stage optimization, construction of the set of Pareto optimal points and study of relationships between two cost functions), combinatorial optimization problems that allow usual dynamic programming approach (counting the number of optimal solutions, multi-stage optimization). Experimental study of various problems connected with decision trees, decision rules, and element-based trees.
