Skip to content
Register Sign in Wishlist
Combinatorial Data Analysis

Combinatorial Data Analysis
Optimization by Dynamic Programming

£48.99

Part of Monographs on Discrete Mathematics and Applications

  • Date Published: March 2001
  • availability: This item is not supplied by Cambridge University Press in your region. Please contact Soc for Industrial & Applied Mathematics for availability.
  • format: Hardback
  • isbn: 9780898714784

£ 48.99
Hardback

This item is not supplied by Cambridge University Press in your region. Please contact Soc for Industrial & Applied Mathematics for availability.
Unavailable Add to wishlist

Looking for an inspection copy?

This title is not currently available on inspection

Description
Product filter button
Description
Contents
Resources
Courses
About the Authors
  • 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.

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity

    ×

    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?

    ×

    Product details

    • Date Published: March 2001
    • format: Hardback
    • isbn: 9780898714784
    • length: 175 pages
    • dimensions: 261 x 183 x 13 mm
    • weight: 0.553kg
    • availability: This item is not supplied by Cambridge University Press in your region. Please contact Soc for Industrial & Applied Mathematics for availability.
  • Table of Contents

    Preface
    1. Introduction
    2. General Dynamic Programming Paradigm
    3. Cluster Analysis
    4. Object Sequencing and Seriation
    5. Heuristic Applications of the GDPP
    6. Extensions and Generalizations
    Appendix: Available Programs
    Bibliography
    Author Index
    Subject Index.

  • Authors

    Lawrence Hubert, University of Illinois, Urbana-Champaign

    Phipps Arabie, Rutgers University, New Jersey

    Jacqueline Meulman, Universiteit Leiden

Sign In

Please sign in to access your account

Cancel

Not already registered? Create an account now. ×

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email lecturers@cambridge.org

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×

Find content that relates to you

Join us online

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.

Cancel

Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

×
Please fill in the required fields in your feedback submission.
×