On Coresets for k-Median and k-Means Clustering in Metric and Euclidean Spaces and Their Applications
From MaRDI portal
Publication:3575154
Recommendations
- On coresets for k-means and k-median clustering
- Coresets for \((k, \ell ) \)-median clustering under the Fréchet distance
- Smaller coresets for k-median and k-means clustering
- Smaller coresets for \(k\)-median and \(k\)-means clustering
- Towards optimal lower bounds for k-median and k-means coresets
- \(k\)-median clustering under discrete Fréchet and Hausdorff distances
- K-medoids and other criteria for crisp clustering
- A FAST k-MEANS IMPLEMENTATION USING CORESETS
- Coresets for Fuzzy K-Means with Applications
Cited in
(73)- Faster balanced clusterings in high dimension
- A bi-criteria analysis for fuzzy \(C\)-means problem
- On parameterized approximation algorithms for balanced clustering
- Approximation and complexity of the capacitated geometric median problem
- A strong coreset algorithm to accelerate OPF as a graph-based machine learning in large-scale problems
- An efficient sum query algorithm for distance-based locally dominating functions
- Metric \(k\)-median clustering in insertion-only streams
- A unified framework for clustering constrained data without locality property
- A faster algorithm for truth discovery via range cover
- Probabilistic k-median clustering in data streams
- Concentration of kernel matrices with application to kernel spectral clustering
- Metric 1-median selection: query complexity vs. approximation ratio
- Probabilistic \(k\)-median clustering in data streams
- BICO: BIRCH meets coresets for \(k\)-means clustering
- Clustering for metric and nonmetric distance measures
- Accurate low-space approximation of metric k-median for insertion-only streams
- Core-sets: updated survey
- Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering
- A lower bound for metric 1-median selection
- On coresets for k-means and k-median clustering
- Better streaming algorithms for clustering problems
- Small Space Representations for Metric Min-Sum k-Clustering and Their Applications
- A PTAS for k-means clustering based on weak coresets
- Clustering problems on sliding windows
- A streaming algorithm for k-means with approximate coreset
- Scalable kernel \(k\)-means clustering with Nyström approximation: relative-error bounds
- Coresets and approximate clustering for Bregman divergences
- Local search yields a PTAS for \(k\)-means in doubling metrics
- scientific article; zbMATH DE number 2090269 (Why is no real title available?)
- On geometric prototype and applications
- Efficient approximation schemes for uniform-cost clustering problems in planar graphs
- $k$-median clustering under discrete Fréchet and Hausdorff distances
- Coresets for Fuzzy K-Means with Applications
- On the fixed-parameter tractability of capacitated clustering
- scientific article; zbMATH DE number 7561535 (Why is no real title available?)
- Approximate range queries for clustering
- An efficient sum query algorithm for distance-based locally dominating functions
- Coresets for clustering in Euclidean spaces: importance sampling is nearly optimal
- scientific article; zbMATH DE number 7164768 (Why is no real title available?)
- Smaller coresets for \(k\)-median and \(k\)-means clustering
- scientific article; zbMATH DE number 7053357 (Why is no real title available?)
- scientific article; zbMATH DE number 7651196 (Why is no real title available?)
- Improved Algorithms for Time Decay Streams
- scientific article; zbMATH DE number 7650129 (Why is no real title available?)
- \(k\)-median clustering under discrete Fréchet and Hausdorff distances
- A unified framework of FPT approximation algorithms for clustering problems
- FPT Approximation for Constrained Metric k-Median/Means
- Clustering with faulty centers
- Coresets for \((k, \ell ) \)-median clustering under the Fréchet distance
- Linear-time approximation scheme for k-means clustering of axis-parallel affine subspaces
- On coresets for fair clustering in metric and Euclidean spaces and their applications
- Tight FPT approximation for socially fair clustering
- Polynomial approximate discretization of geometric centers in high-dimensional Euclidean space
- k-median/means with outliers revisited: a simple fpt approximation
- FPT approximation for capacitated clustering with outliers
- Finding ultrametric minimum-diameter spanning trees
- Fast approximations and coresets for (k,)-median under dynamic time warping
- Multiplication of 0-1 matrices via clustering
- Turning big data into tiny data: coresets for unsupervised learning problems
- Clustering under a knapsack constraint: parameterized approximation for the knapsack median problem
- Polynomial-time approximation schemes for facility location on planar graphs
- Clustering what matters in constrained settings (improved outlier to outlier-free reductions)
- Clustering what matters in constrained settings: improved outlier to outlier-free reductions
- An empirical evaluation of k-means coresets
- Faster approximation schemes for (constrained) k-means with outliers
- On coresets for fair clustering in metric and Euclidean spaces and their applications
- Parameterized approximation schemes for fair-range clustering
- Coresets for weight-constrained anisotropic assignment and clustering
- Clustering point sets revisited
- Coresets for robust clustering via black-box reductions to vanilla case
- Smaller coresets for k-median and k-means clustering
- A quantization framework for smoothed analysis of Euclidean optimization problems
- Small space representations for metric min-sum k-clustering and their applications
This page was built for publication: On Coresets for k-Median and k-Means Clustering in Metric and Euclidean Spaces and Their Applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3575154)
