Improving dynamic programming strategies for partitioning

DOI10.1007/S00357-004-0017-9MaRDI QIDQ818974zbMATH OpenOpenAlexFDO

Authors Bart-Jan van Os, Jacqueline Meulman

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

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Dynamic programming (90C39)

Recommendations

• Dynamic programming and convex clustering
• A dynamic programming algorithm for haplotype block partitioning
• scientific article; zbMATH DE number 907944
• Partitioning a finite set by a dynamic programming method
• scientific article; zbMATH DE number 3843005

Cited in

(13)

• Dynamic programming and convex clustering
• Taxicab correspondence analysis
• Dynamic programming and diagnostic classification
• A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning
• Optimization strategies for two-mode partitioning
• Computing exact clustering posteriors with subset convolution
• Braids of partitions
• Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis
• scientific article; zbMATH DE number 907944 (Why is no real title available?)
• An optimising approach to alternative clustering schemes
• An improved column generation algorithm for minimum sum-of-squares clustering
• A bisection method for solving distance-based clustering problems globally
• A p-median based approach to constrained clustering

Describes a project that uses

Uses Software

• J-MEANS

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q818974)