Combinatorial Data Analysis: Optimization by Dynamic Programming (Monographs on Discrete Mathematics and Applications, Series Number 6) - Hardcover
Synopsis
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.
"synopsis" may belong to another edition of this title.
About the Author
Lawrence Hubert is Professor of Psychology and Statistics at the University of Illinois at Urbana-Champaign, USA; Phipps Arabie is Professor of Management and Psychology at Rutgers University, USA; Jacqueline Meulman is Professor of Applied Data Theory in the Faculty of Social and Behavioral Sciences of Leiden University, The Netherlands.
"About this title" may belong to another edition of this title.
Search results for Combinatorial Data Analysis: Optimization by Dynamic...
Stock Image
Combinatorial Data Analysis: Optimization by Dynamic Programming (Monographs on Discrete Mathematics and Applications, Series Number 6)
Seller: AwesomeBooks, Wallingford, United Kingdom
Seller rating 5 out of 5 stars
Hardcover. Condition: Very Good. Combinatorial Data Analysis: Optimization by Dynamic Programming (Monographs on Discrete Mathematics and Applications, Series Number 6) This book is in very good condition and will be shipped within 24 hours of ordering. The cover may have some limited signs of wear but the pages are clean, intact and the spine remains undamaged. This book has clearly been well maintained and looked after thus far. Money back guarantee if you are not satisfied. See all our books here, order more than 1 book and get discounted shipping. Seller Inventory # 7719-9780898714784
Buy Used
US$ 43.86
Shipping:
US$ 6.55
From United Kingdom to U.S.A.
Quantity: 2 available
Stock Image
Combinatorial Data Analysis: Optimization by Dynamic Programming (Monographs on Discrete Mathematics and Applications, Series Number 6)
Seller: Bahamut Media, Reading, United Kingdom
Seller rating 5 out of 5 stars
Hardcover. Condition: Very Good. This book is in very good condition and will be shipped within 24 hours of ordering. The cover may have some limited signs of wear but the pages are clean, intact and the spine remains undamaged. This book has clearly been well maintained and looked after thus far. Money back guarantee if you are not satisfied. See all our books here, order more than 1 book and get discounted shipping. Seller Inventory # 6545-9780898714784
Buy Used
US$ 43.86
Shipping:
US$ 9.16
From United Kingdom to U.S.A.
Quantity: 3 available
Seller Image
Combinatorial Data Analysis: Optimization by Dynamic Programming (Monographs on Discrete Mathematics and Applications, Series Number 6)
Published by
Society for Industrial and Applied Mathematics, 2001
ISBN 10: 0898714788
ISBN 13: 9780898714784
New
Hardcover
Seller: Leopolis, Kraków, Poland
Seller rating 5 out of 5 stars
Hardcover. Condition: New. 4to (26 cm), 175 pp. Publisher's laminated boards. "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." (publisher's description). Seller Inventory # 008576