Using assignment constraints to avoid empty clusters in k-means clustering

MaRDI QIDQ3526664zbMATH OpenFDO

Authors Ayhan Demiriz, Kristin P. Bennett, P. S. Bradley

Publication date 25 September 2008

zbMATH Keywords

clustering optimization problem

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)

Recommendations

• Constrained clustering problems: new optimization algorithms
• scientific article; zbMATH DE number 2247697
• Constrained Clustering Using Column Generation
• Order-constrained solutions in \(K\)-means clustering: even better than being globally optimal
• Side-constrained minimum sum-of-squares clustering: mathematical programming and random projections

Cited in

(4)

• Constrained clustering problems: new optimization algorithms
• A review on declarative approaches for constrained clustering
• Constrained clustering: current and new trends
• Error estimates for deterministic empirical approximations of probability measures

This page was built for publication: Using assignment constraints to avoid empty clusters in \(k\)-means clustering

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