On the \(k\)-means/median cost function

DOI10.1016/j.ipl.2022.106252OpenAlexW4210685527MaRDI QIDQ2671798

Anup Bhattacharya, Ragesh Jaiswal, Yoav Freund

Publication date: 3 June 2022

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1704.05232

zbMATH Keywords

randomized algorithms\(k\)-means clustering\(D^2\)-samplingcoresets\(k\)-median clustering

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Uses Software

• k-means++
• StreamKM++

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tight lower bound instances for \(k\)-means++ in two dimensions
• Fair coresets and streaming algorithms for fair \(k\)-means
• Approximate clustering via core-sets
• On coresets for k-means and k-median clustering
• Adaptive Sampling for k-Means Clustering
• Smaller coresets for k-median and k-means clustering
• StreamKM++
• A unified framework for approximating and clustering data
• Turning Big data into tiny data: Constant-size coresets for k-means, PCA and projective clustering

This page was built for publication: On the \(k\)-means/median cost function