On approximate geometric k-clustering
From MaRDI portal
Publication:1577548
DOI10.1007/S004540010019zbMATH Open0959.68126OpenAlexW1998905999MaRDI QIDQ1577548FDOQ1577548
Authors: Jiří Matoušek 
Publication date: 24 August 2000
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s004540010019
Recommendations
Cited In (49)
- Sublinear‐time approximation algorithms for clustering via random sampling
- An efficient \(K\)-means clustering algorithm for tall data
- Using the Alpha Geodesic Distance in Shapes K-Means Clustering
- A unified framework for clustering constrained data without locality property
- A linear time algorithm for approximate 2-means clustering
- Local search yields a PTAS for fixed-dimensional \(k\)-means problem with penalties
- Local search approximation algorithms for the sum of squares facility location problems
- GEOMETRIC ALGORITHMS FOR THE CONSTRAINED 1-D K-MEANS CLUSTERING PROBLEMS AND IMRT APPLICATIONS
- A FAST IMPLEMENTATION OF THE ISODATA CLUSTERING ALGORITHM
- Title not available (Why is that?)
- Approximation algorithm for squared metric facility location problem with nonuniform capacities
- Approximation algorithms for stochastic clustering
- Quantization-based clustering algorithm
- A refined approximation for Euclidean \(k\)-means
- Linear-size universal discretization of geometric center-based problems in fixed dimensions
- GEOMETRIC ALGORITHMS FOR DENSITY-BASED DATA CLUSTERING
- Scalable kernel \(k\)-means clustering with Nyström approximation: relative-error bounds
- Efficient approximation algorithms for clustering point-sets
- Title not available (Why is that?)
- Testing of Clustering
- Approximation algorithms for spherical \(k\)-means problem using local search scheme
- Effective Heuristic Techniques for Combined Robust Clustering Problem
- Approximation schemes for clustering problems
- Local search approximation algorithms for the \(k\)-means problem with penalties
- A local search approximation algorithm for \(k\)-means clustering
- Approximating min-sum k -clustering in metric spaces
- Testing of Clustering
- Faster algorithms for the constrained \(k\)-means problem
- Almost optimal solutions to \(k\)-clustering problems
- A streaming algorithm for \(k\)-means with approximate coreset
- A generalized minimum cost \(k\)-clustering
- Clustering for edge-cost minimization (extended abstract)
- Title not available (Why is that?)
- K-means clustering via a nonconvex optimization approach
- An exact algorithm for stable instances of the \(k\)-means problem with penalties in fixed-dimensional Euclidean space
- Approximation algorithms for robust clustering problems using local search techniques
- Range-clustering queries
- Bi-criteria linear-time approximations for generalized k-mean/median/center
- A simple \(D^2\)-sampling based PTAS for \(k\)-means and other clustering problems
- Randomized Spectral Clustering in Large-Scale Stochastic Block Models
- Clustering through continuous facility location problems
- Clustering motion
- Data reduction for weighted and outlier-resistant clustering
- Local Search Yields a PTAS for $k$-Means in Doubling Metrics
- \(k\)-plane clustering
- On geometric prototype and applications
- A FAST k-MEANS IMPLEMENTATION USING CORESETS
- Better guarantees for \(k\)-means and Euclidean \(k\)-median by primal-dual algorithms
- Adaptive geometrically balanced clustering of \({\mathcal H}\)-matrices
This page was built for publication: On approximate geometric \(k\)-clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1577548)
