Combinatorial Data Analysis: Optimization by Dynamic Programming

Front Cover
SIAM, 2001 - Science - 163 pages
0 Reviews
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.
 

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

DT06ch1
1
DT06ch2
7
DT06ch3
17
DT06ch4
51
DT06ch5
91
DT06ch6
103
DT06app
115
DT06bm
149
Copyright

Other editions - View all

Common terms and phrases