Combinatorial Data Analysis: Optimization by Dynamic Programming

Lawrence Hubert‏ · Phipps Arabie‏ · Jacqueline Meulman‏

جنوری 2001 · SIAM

اس ای بک کے بارے میں

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