Improving Dynamic Programming Strategies for Partitioning |
| |
Authors: | BJ van Os JJ Meulman |
| |
Institution: | (1) Leiden University, The Netherlands |
| |
Abstract: | Improvements to the dynamic programming (DP) strategy for partitioning (nonhierarchical classification) as discussed in Hubert, Arabie, and Meulman (2001) are proposed. First, it is shown how the number of evaluations in the DP process can be decreased
without affecting generality. Both a completely nonredundant and a quasi-nonredundant
method are proposed. Second, an efficient implementation of both approaches is discussed.
This implementation is shown to have a dramatic increase in speed over the original program.
The flexibility of the approach is illustrated by analyzing three data sets. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|