Combinatorial data analysis. Optimization by dynamic programming
The book discusses the application of dynamic programming type algorithms to problems in combinatorial data analysis. The flexibility of the dynamic programming method is highlighted on a variety of different problems with an emphasis on cluster analysis and object sequencing and seriation. Moreover, in the clustering and sequencing context, the general dynamic programming approach is modified to a heuristic procedure to efficiently handle large data sets. NEWLINENEWLINENEWLINEAn appendix is included that can be used as a users manual describing the operation of nineteen programs available as freeware on one of the authors webpage. The programs are related to the individual algorithms described in the preceding chapters and applicable, for example, for object partitioning, hierarchical clustering, object sequencing and seriation, and the construction of ordered partitions.
scientific article; zbMATH DE number 1614056