Semi-Supervised Algorithms for Approximately Optimal and Accurate Clustering

DOI10.4230/LIPIcs.ICALP.2018.57zbMath1499.68305arXiv1803.00926OpenAlexW2963505742MaRDI QIDQ5002733

Sangxia Huang, Ola Svensson, Buddhima Gamlath

Publication date: 28 July 2021

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

zbMATH Keywords

clusteringapproximation algorithms\(k\)-meanssemi-supervised learning\(k\)-median

Mathematics Subject Classification ID

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

Related Items

Unnamed Item

Cites Work

• On coresets for k-means and k-median clustering
• A PTAS for k-means clustering based on weak coresets
• A local search approximation algorithm for k-means clustering
• Approximate Clustering with Same-Cluster Queries
• Geometric median in nearly linear time
• Clustering under approximation stability