Smaller coresets for k-median and k-means clustering
From MaRDI portal
Recommendations
- Smaller coresets for \(k\)-median and \(k\)-means clustering
- On coresets for k-means and k-median clustering
- On Coresets for k-Median and k-Means Clustering in Metric and Euclidean Spaces and Their Applications
- A PTAS for k-means clustering based on weak coresets
- Probabilistic \(k\)-median clustering in data streams
Cited in
(34)- Streaming with minimum space: an algorithm for covering by two congruent balls
- Temporal clustering
- scientific article; zbMATH DE number 7651196 (Why is no real title available?)
- Sublinear-time Algorithms
- Dynamic coresets
- Coresets for Fuzzy K-Means with Applications
- Practical methods for shape fitting and kinetic data structures using coresets
- On the fixed-parameter tractability of capacitated clustering
- Small space representations for metric min-sum \(k\)-clustering and their applications
- Accurate low-space approximation of metric \(k\)-median for insertion-only streams
- Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering
- On coresets for fair clustering in metric and Euclidean spaces and their applications
- scientific article; zbMATH DE number 7650129 (Why is no real title available?)
- A strong coreset algorithm to accelerate OPF as a graph-based machine learning in large-scale problems
- Metric \(k\)-median clustering in insertion-only streams
- Probabilistic k-median clustering in data streams
- Probabilistic \(k\)-median clustering in data streams
- Coresets for \((k, \ell ) \)-median clustering under the Fréchet distance
- On Coresets for k-Median and k-Means Clustering in Metric and Euclidean Spaces and Their Applications
- Local Search Yields Approximation Schemes for $k$-Means and $k$-Median in Euclidean and Minor-Free Metrics
- Turning Grain Maps into Diagrams
- On coresets for k-means and k-median clustering
- A PTAS for k-means clustering based on weak coresets
- Coresets for clustering in excluded-minor graphs and beyond
- Coresets for clustering in geometric intersection graphs
- Approximate range queries for clustering
- Aggregation error for location models: Survey and analysis
- Learning big (image) data via coresets for dictionaries
- Tight bounds for the subspace sketch problem with applications
- Clustering with faulty centers
- Linear-time approximation scheme for \(k\)-means clustering of axis-parallel affine subspaces
- Smaller coresets for \(k\)-median and \(k\)-means clustering
- A FAST k-MEANS IMPLEMENTATION USING CORESETS
- A novel method for optimizing spectral rotation embedding \(K\)-means with coordinate descent
This page was built for publication: Smaller coresets for \(k\)-median and \(k\)-means clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q866968)
