Partitioning a finite set by a dynamic programming method

摘要

Optimization of the partitions of a finite set with a non-additive aggregation cost function (by a criterion similar to the criterion of "bottleneck" problems, i.e., a minimax test)is studied. Two dynamic programming variants, viz., a general optimization scheme for set functions and a dynamic programming method for partitioning a "problem space" into intervals, are examined. The clusters obtained in data processing are applied to a prediction problem.