Combinatorial data analysis: optimization by dynamic programming

by Hubert, Lawrence J.

Type Book

Rate 0.0 /5

Details

Files

Reviews

Download

Title Statements

Full title :Combinatorial data analysis : optimization by dynamic programming / Lawrence Hubert, Phipps Arabie, Jacqueline Meulman.

Summary

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.

Edition Statements

Publication Date:2001.

Publication Statements

Publisher(s):Society for Industrial and Applied Mathematics
Place of Publication:Philadelphia, PA
Language:eng
Publication Date:2001.

The Physical Object

Description:1 online resource (xi, 163 pages)

Edition Identifiers

ISBN:0898714788, 9780898714784, 9780898718553, 0898718554
oclc:ocn694086504
LC Classification:T57.83
Dewey Decimal:519.7/03

Introduction -- General Dynamic Programming Paradigm -- Cluster Analysis -- Object Sequencing and Seriation -- Heuristic Applications of the GDPP -- Extensions and Generalizations -- Appendix : Available Programs.

Subjects

Combinatorial optimization Dynamic programming Least-squares optimization Optimisation combinatoire Programmation dynamique Ultrametric and additive tree represent… Unidimensional and multidimensional sca…