Improving dynamic programming strategies for partitioning

DOI10.1007/s00357-004-0017-9zbMath1331.90093OpenAlexW2081490466MaRDI QIDQ818974

Jacqueline J. Meulman, Bart-Jan van Os

Publication date: 22 March 2006

Published in: Journal of Classification (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00357-004-0017-9

Mathematics Subject Classification ID

Related Items (6)

An optimising approach to alternative clustering schemes ⋮ Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis ⋮ An improved column generation algorithm for minimum sum-of-squares clustering ⋮ Taxicab correspondence analysis ⋮ A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning ⋮ Computing exact clustering posteriors with subset convolution

Uses Software

• J-MEANS

This page was built for publication: Improving dynamic programming strategies for partitioning