On k-Median clustering in high dimensions
From MaRDI portal
Publication:3581519
DOI10.1145/1109557.1109687zbMath1192.68882OpenAlexW4241216959MaRDI QIDQ3581519
Publication date: 16 August 2010
Published in: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1109557.1109687
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Approximation algorithms (68W25)
Related Items (16)
Linear-size universal discretization of geometric center-based problems in fixed dimensions ⋮ Clustering through continuous facility location problems ⋮ Better guarantees for \(k\)-median with service installation costs ⋮ Some results on approximate 1-median selection in metric spaces ⋮ Approximation schemes for \(k\)-facility location ⋮ Faster algorithms for the constrained \(k\)-means problem ⋮ Facility Location in Dynamic Geometric Data Streams ⋮ Median-Truncated Gradient Descent: A Robust and Scalable Nonconvex Approach for Signal Estimation ⋮ Kantorovich–Rubinstein Distance Minimization: Application to Location Problems ⋮ A simple \(D^2\)-sampling based PTAS for \(k\)-means and other clustering problems ⋮ Small space representations for metric min-sum \(k\)-clustering and their applications ⋮ Sublinear-time Algorithms ⋮ Unnamed Item ⋮ Clustering with Internal Connectedness ⋮ Some Estimates on the Discretization of Geometric Center-Based Problems in High Dimensions ⋮ $$L^p$$ Continuity and Microlocal Properties for Pseudodifferential Operators
This page was built for publication: On k-Median clustering in high dimensions
