A semi brute-force search approach for (balanced) clustering

DOI10.1007/s00453-023-01158-4MaRDI QIDQ6185939

Vincent Chau, Vassilios Zissimopoulos, Yicheng Xu, Yifei Zou, Yong Zhang, Chen-Chen Wu

Publication date: 9 January 2024

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

clusteringprobabilistic algorithm\(k\)-means\(k\)-means++balanced clustering

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A constant FPT approximation algorithm for hard-capacitated \(k\)-means
• Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
• Least squares quantization in PCM
• The effectiveness of lloyd-type methods for the k-means problem

This page was built for publication: A semi brute-force search approach for (balanced) clustering