Clustering with balancing constraints

MaRDI QIDQ3526663zbMATH OpenFDO

Authors Arindam Banerjee, Joydeep Ghosh

Publication date 25 September 2008

zbMATH Keywords

balanced clusteringgraph partitioningmixture modeling

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Faster balanced clusterings in high dimension
• Computing and Combinatorics
• Optimizing MSE for clustering with balanced size constraints
• scientific article; zbMATH DE number 2080486
• A polynomial algorithm for balanced clustering via graph partitioning

Cited in

(9)

• Improved algorithms for distributed balanced clustering
• Faster balanced clusterings in high dimension
• Optimizing MSE for clustering with balanced size constraints
• Comparisons of different methods for balanced data classification under the discrete non-local total variational framework
• Computing and Combinatorics
• Parameterized complexity of categorical clustering with size constraints
• Frugal Gaussian clustering of huge imbalanced datasets through a bin-marginal approach
• Parameterized complexity of categorical clustering with size constraints
• Constrained group balancing: why does it work

This page was built for publication: Clustering with balancing constraints

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