Faster Algorithms for the Constrained k-Means Problem

DOI10.4230/LIPIcs.STACS.2016.16zbMath1380.68439arXiv1504.02564OpenAlexW2964083987MaRDI QIDQ4601868

Amit Kumar, Ragesh Jaiswal, Anup Bhattacharya

Publication date: 24 January 2018

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

zbMATH Keywords

samplingapproximation algorithm\(k\)-means\(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) Randomized algorithms (68W20)

Related Items

Improved PTAS for the constrained \(k\)-means problem, A unified framework for clustering constrained data without locality property