SIAM Homepage | Search Catalog | New Books | Author Index | Series Index | Title Index | View My Shopping Cart



The catalog and shopping cart are hosted for SIAM by EasyCart. Your transaction is secure. If you have any questions about your order, contact siambooks@siam.org.

Purchase Now!

Combinatorial Data Analysis: Optimization by Dynamic ProgrammingCombinatorial Data Analysis: Optimization by Dynamic Programming

Lawrence Hubert, Phipps Arabie, and Jacqueline Meulman



Monographs on Discrete Mathematics and Applications 6

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.

The incorporation of a wide variety of CDA tasks under one common optimization framework based on DP is one of the book's strongest points. The authors include verifiably optimal solutions to nontrivially sized problems over the array of data analysis tasks discussed.

Audience

Combinatorial Data Analysis: Optimization by Dynamic Programming provides an applied documentation source, as well as an introduction to a collection of associated computer programs, that will be of interest to applied statisticians and data analysts as well as notationally sophisticated users.

Contents

Preface; Chapter 1: Introduction; Chapter 2: General Dynamic Programming Paradigm; Chapter 3: Cluster Analysis; Chapter 4: Object Sequencing and Seriation; Chapter 5: Heuristic Applications of the GDPP; Chapter 6: Extensions and Generalizations; Appendix: Available Programs; Bibliography; Author Index; Subject Index.

2001 / xii + 163 pages / Hardcover / ISBN-13: 978-0-898714-78-4 / ISBN-10: 0-89871-478-8 /
List Price $82.50 / SIAM Member Price $57.75 / Order Code DT06
Price
Quantity desired
   



Search our catalog for:

Shopping cart provided by: EasyCart.com
Select quantity and list or member price and then click the "Click to Order" button to add books to your shopping cart.
Banner art adapted from a figure by Hinke M. Osinga and Bernd Krauskopf (University of Auckland, NZ.)