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

روابط وملفات

الوثيقة في المستودع الخارجي عرض في AskZad

التعريف والنوع

رقم الوثيقة: fee1fb00-f779-4dd7-a245-514ad1277f8c
رقم العقد: 0
نوع الوسائط: Crawler
نوع المحتوى: الرسائل العلمية
صيغة المصدر: رسائل دكتوراة
نوع الملف: pdf text
أسماء الملفات: 1699757_1.pdf

بيانات النشر

ألقاب المؤلفين: [{"name_ar":" Mikhail Moshkov","title_ar":"اشراف","title_en":"Supervision"},{"name_ar":"شاهد حسين","title_ar":"اعداد","title_en":"Preparation"}]
اللغة: English

المصدر والدورية

اسم المصدر: Extensions of Dynamic Programming: Decision Trees, Combinatorial Optimization, and Data Mining

المحتوى والصفحات

عدد الصفحات: 0
كلمات الباحثين: cost functions , Decision Trees , dynamic programming

إشراف وإعداد

الإشراف: Mikhail Moshkov
الإعداد: شاهد حسين

الاقتباسات الببليوغرافية

APA

Mikhail Moshkov و شاهد حسين. (2016). Extensions of Dynamic Programming: Decision Trees, Combinatorial Optimization, and Data Mining. أطروحة(رسائل دكتوراة). جامعة الملك عبدالله للعلوم والتقنية. السعودية.

MLA

Mikhail Moshkov و شاهد حسين. Extensions of Dynamic Programming: Decision Trees, Combinatorial Optimization, and Data Mining. 2016. جامعة الملك عبدالله للعلوم والتقنية، رسائل دكتوراة.