Descripción del título
Combinatorial data analysis...
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
Monografía
monografia Rebiun37047640 https://catalogo.rebiun.org/rebiun/record/Rebiun37047640 m eo d cr bn |||m|||a 101020s2001 pau ob 001 0 eng d 00049656 0-89871-855-4 DT06 siam DT06 SIAM CUNEF 991000509044008131 CaBNVSL. CaBNVSL. CaBNVSL eng 519.7/03 21 Hubert, Lawrence J. 1944-) Combinatorial data analysis optimization by dynamic programming Lawrence Hubert, Phipps Arabie, Jacqueline Meulman Philadelphia, Pa. Society for Industrial and Applied Mathematics (SIAM, 3600 Market Street, Floor 6, Philadelphia, PA 19104) 2001 Philadelphia, Pa. Philadelphia, Pa. Society for Industrial and Applied Mathematics (SIAM, 3600 Market Street, Floor 6, Philadelphia, PA 19104) 1 electronic text (xi, 163 p.) digital file 1 electronic text (xi, 163 p.) Text txt computer c online resource cr SIAM monographs on discrete mathematics and applications Bibliographic Level Mode of Issuance: Monograph Includes bibliographical references (p. 149-155) and indexes Introduction -- General Dynamic Programming Paradigm -- Cluster Analysis -- Object Sequencing and Seriation -- Heuristic Applications of the GDPP -- Extensions and Generalizations -- Appendix : Available Programs 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 Also available in print version Mode of access: World Wide Web System requirements: Adobe Acrobat Reader English Dynamic programming Combinatorial optimization Arabie, Phipps Meulman, Jacqueline Society for Industrial and Applied Mathematics 0-89871-478-8 SIAM monographs on discrete mathematics and applications