Partitioning a finite set by a dynamic programming method

Authors
Chentsov, AG Chentsov, PA
Citation
Ag. Chentsov et Pa. Chentsov, Partitioning a finite set by a dynamic programming method, AUT REMOT R, 61(4), 2000, pp. 658-670
Citations number
7
Categorie Soggetti
AI Robotics and Automatic Control
Journal title
AUTOMATION AND REMOTE CONTROL
ISSN journal
00051179 → ACNP
Volume
61
Issue
4
Year of publication
2000
Part
2
Pages
658 - 670
Database
ISI
SICI code
0005-1179(200004)61:4<658:PAFSBA>2.0.ZU;2-E
Abstract
Optimization of the partitions of a finite set with a nonadditive aggregati on cost function (by a criterion similar to the criterion of "bottleneck" p roblems, i.e., a minimax test) is studied. Two dynamic programming variants , viz., a general optimization scheme for set functions and a dynamic progr amming method for partitioning a "problem space" into intervals, are examin ed. The clusters obtained in data processing are applied to a prediction pr oblem.