Description

Book 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.

Combinatorial Data Analysis Optimization by Dynamic Programming Monographs on Discrete Mathematics and Applications Series Number 6

    Product form

    £79.65

    Includes FREE delivery

    RRP £88.50 – you save £8.85 (10%)

    Order before 4pm today for delivery by Fri 7 Aug 2026.

    A Hardback by Lawrence Hubert

    1 in stock

      Trusted by thousands of customers. See 2,385+ Customer Reviews

      View other formats and editions of Combinatorial Data Analysis Optimization by Dynamic Programming Monographs on Discrete Mathematics and Applications Series Number 6 by Lawrence Hubert

      Publisher: Society for Industrial and Applied Mathematics
      Publication Date: Publication Date:
      ISBN13: 9780898714784, 978-0898714784
      ISBN10:

      Description

      Book 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.

      Recently viewed products

      © 2026 Book Curl

        • American Express
        • Apple Pay
        • Diners Club
        • Discover
        • Google Pay
        • Maestro
        • Mastercard
        • PayPal
        • Shop Pay
        • Union Pay
        • Visa

        Login

        Forgot your password?

        Don't have an account yet?
        Create account