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

✍ Scribed by Lawrence Hubert, Phipps Arabie, Jacqueline Meulman

Year: 1987
Tongue: English
Leaves: 173
Category: Library

No coin nor oath required. For personal study only.

✦ Synopsis

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 combinatorial search is carried out by a recursive optimization process based on the general principles of dynamic programming (DP). The authors provide a comprehensive and self-contained review delineating a very general DP paradigm or schema that can serve two functions. First, the paradigm can be applied in various special forms to encompass all previously proposed applications suggested in the classification literature. Second, the paradigm can lead directly to many more novel uses. An appendix is included as a user's manual for a collection of programs available as freeware.

📜 SIMILAR VOLUMES

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

✍ 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

Evaluation and Optimization of Electoral

📁 Evaluation and Optimization of Electoral Systems (Monographs on Discrete Mathematics and Applications)

✍ Pietro Grilli di Cortona, Cecilia Manzi, Aline Pennisi, Federica Ricca, Bruno Si 📂 Library 📅 1987 🌐 English

This monograph offers a systematic quantitative approach to the analysis, evaluation, and design of electoral systems. Today, electoral reform is of concern to newborn democracies as well as many old ones. The authors use mathematical models and automatic procedures, when possible, to solve some of

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