Extensions of dynamic programming for combinatorial optimization and data mining

✍ Scribed by AbouEisha H. et al.

Publisher: SPRINGER INTERNATIONAL PU
Year: 2019
Tongue: English
Leaves: 277
Series: Intelligent systems reference library 146
Category: Library

No coin nor oath required. For personal study only.

✦ Table of Contents

Content: Introduction.- Tools for Study of Pareto Optimal Points.- Some Tools for Decision Tables.- Different Kinds of Decision Trees.- Multi-stage Optimization of Decision Trees with Some Applications.- More Applications of Multi-stage Optimizationof Decision Trees.- Bi-Criteria Optimization Problem for Decision Trees: Cost vs Cost.- Bi-Criteria Optimization Problem for Decision Trees: Cost vs Uncertainty.- Different Kinds of Rules and Systems of Rules

✦ Subjects

Dynamic programming.;Combinatorial optimization.;Data mining.

📜 SIMILAR VOLUMES

Extensions of Dynamic Programming for Co

📁 Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining

✍ Hassan AbouEisha, Talha Amin, Igor Chikalov, Shahid Hussain, Mikhail Moshkov 📂 Library 📅 2019 🏛 Springer International Publishing 🌐 English

<p><p></p><p>Dynamic programming is an efficient technique for solving optimization problems. It is based on breaking the initial problem down into simpler ones and solving these sub-problems, beginning with the simplest ones. A conventional dynamic programming algorithm returns an optimal object fr

Combinatorial Data Analysis: Optimizatio

📁 Combinatorial Data Analysis: Optimization by Dynamic Programming

✍ Lawrence Hubert, Phipps Arabie, Jacqueline Meulman 📂 Library 📅 1987 🏛 Society for Industrial Mathematics 🌐 English

Combinatorial Data Analysis. Optimizatio

📁 Combinatorial Data Analysis. Optimization by Dynamic Programming

✍ Hubert L., Arable P., Meulman J. 📂 Library 🌐 English

Society for Industrial and Applied Mathematics, 2001, -174 pp.<div class="bb-sep"></div>The first part of this monograph's title, Combinatorial Data Analysis (CDA), refers to a wide class of methods for the study of relevant data sets in which the arrangement of a collection of objects is absolutely

Combinatorial Data Analysis: Optimizatio

📁 Combinatorial Data Analysis: Optimization by Dynamic Programming (Monographs on Discrete Mathematics and Applications)

✍ Lawrence Hubert, Phipps Arabie, Jacqueline Meulman 📂 Library 📅 1987 🏛 Society for Industrial Mathematics 🌐 English

I wanted to learn about combinatorial optimization for a particular application in cluster analysis, and this book hit the mark. This is a clearly written overview of the application of general dynamic programming to cluster analysis, object sequencing and seriation, and other data analysis problems

Combinatorial Data Analysis: Optimizatio

📁 Combinatorial Data Analysis: Optimization by Dynamic Programming (Monographs on Discrete Mathematics and Applications)

✍ Lawrence Hubert, Phipps Arabie, Jacqueline Meulman 📂 Library 📅 1987 🏛 Society for Industrial Mathematics 🌐 English

Combinatorial Data Analysis: Optimizatio

📁 Combinatorial Data Analysis: Optimization by Dynamic Programming (Monographs on Discrete Mathematics and Applications)

✍ Lawrence Hubert, Phipps Arabie, Jacqueline Meulman 📂 Library 📅 1987 🌐 English

Combinatorial data analysis (CDA) refers to a wide class of methods for the study of relevant data sets in which the arrangement of a collection of objects is absolutely central. The focus of this monograph is on the identification of arrangements, which are then further restricted to where the comb