Improving Dynamic Programming Strategies for Partitioning

@article{Os2004ImprovingDP,
  title={Improving Dynamic Programming Strategies for Partitioning},
  author={B. J. van Os and Jacqueline J. Meulman},
  journal={J. Classification},
  year={2004},
  volume={21},
  pages={207-230}
}
Improvements to the dynamic programming (DP) strategy for p artitioning (nonhierarchical classification) as discussed in Hubert, Arabi e, 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 nonredund a t 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 s peed… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.
9 Citations
29 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 29 references

Complexity Theory: An Introduction for Practitio

  • E DAYW.H.
  • 1996
Highly Influential
3 Excerpts

J-means: A New Local

  • P. HANSON, N. MLADENOVIC
  • 2001
1 Excerpt

“ Minimum Sum of Squares Clustering in a Low Dimensional Space

  • P. HANSEN, B. JAUMARD, N. MLADENOVIC
  • Journal of Classification
  • 1998
1 Excerpt

Similar Papers

Loading similar papers…