Small Space Representations for Metric Min-Sum k-Clustering and Their Applications

DOI10.1007/978-3-540-70918-3_46MaRDI QIDQ3590961zbMATH OpenOpenAlexFDO

Authors Christian Sohler, Artur Czumaj

Publication date 3 September 2007

Published in STACS 2007 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-70918-3_46

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Approximation algorithms (68W25)

Recommendations

• Small space representations for metric min-sum k-clustering and their applications
• Approximating min-sum k -clustering in metric spaces
• On Coresets for k-Median and k-Means Clustering in Metric and Euclidean Spaces and Their Applications
• On coresets for k-means and k-median clustering
• Sublinear‐time approximation algorithms for clustering via random sampling

Cited in

(7)

• Streaming Embeddings with Slack
• Approximation algorithms for min-sum \(k\)-clustering and balanced \(k\)-median
• Greedy Strategy Works for k-Center Clustering with Outliers and Coreset Construction
• Approximating min-sum k -clustering in metric spaces
• Approximation algorithms for min-sum \(k\)-clustering and balanced \(k\)-median
• Approximation schemes for Min-Sum \(k\)-Clustering
• Small space representations for metric min-sum k-clustering and their applications

This page was built for publication: Small Space Representations for Metric Min-Sum k-Clustering and Their Applications

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