Dynamic programming and convex clustering
From MaRDI portal
Recommendations
Cites work
- A Dynamic Programming Algorithm for Cluster Analysis
- Cluster Analysis and Mathematical Programming
- Clustering with relational constraint
- scientific article; zbMATH DE number 3942804 (Why is no real title available?)
- scientific article; zbMATH DE number 3579840 (Why is no real title available?)
- scientific article; zbMATH DE number 3996907 (Why is no real title available?)
- On Grouping for Maximum Homogeneity
- Optimal Set Partitioning
Cited in
(9)- Combinatorial data analysis. Optimization by dynamic programming
- Computing exact clustering posteriors with subset convolution
- Dynamic Visualization and Fast Computation for Convex Clustering via Algorithmic Regularization
- scientific article; zbMATH DE number 4036950 (Why is no real title available?)
- scientific article; zbMATH DE number 907944 (Why is no real title available?)
- scientific article; zbMATH DE number 7370526 (Why is no real title available?)
- scientific article; zbMATH DE number 3892396 (Why is no real title available?)
- scientific article; zbMATH DE number 4195735 (Why is no real title available?)
- Improving dynamic programming strategies for partitioning
This page was built for publication: Dynamic programming and convex clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1314428)