Pages that link to "Item:Q866968"
From MaRDI portal
The following pages link to Smaller coresets for \(k\)-median and \(k\)-means clustering (Q866968):
Displaying 28 items.
- Streaming with minimum space: an algorithm for covering by two congruent balls (Q393049) (← links)
- Dynamic coresets (Q834605) (← links)
- Small space representations for metric min-sum \(k\)-clustering and their applications (Q968274) (← links)
- Practical methods for shape fitting and kinetic data structures using coresets (Q1006384) (← links)
- Aggregation error for location models: Survey and analysis (Q1026594) (← links)
- A strong coreset algorithm to accelerate OPF as a graph-based machine learning in large-scale problems (Q2124197) (← links)
- Metric \(k\)-median clustering in insertion-only streams (Q2231758) (← links)
- Probabilistic \(k\)-median clustering in data streams (Q2344214) (← links)
- Learning big (image) data via coresets for dictionaries (Q2513397) (← links)
- Accurate Low-Space Approximation of Metric k-Median for Insertion-Only Streams (Q2971636) (← links)
- Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering (Q3304733) (← links)
- On Coresets for <i>k</i>-Median and <i>k</i>-Means Clustering in Metric and Euclidean Spaces and Their Applications (Q3575154) (← links)
- On coresets for k-means and k-median clustering (Q3580976) (← links)
- A FAST k-MEANS IMPLEMENTATION USING CORESETS (Q3604141) (← links)
- Local Search Yields Approximation Schemes for $k$-Means and $k$-Median in Euclidean and Minor-Free Metrics (Q4634032) (← links)
- Sublinear-time Algorithms (Q4933363) (← links)
- Tight Bounds for the Subspace Sketch Problem with Applications (Q5009789) (← links)
- Coresets for Fuzzy K-Means with Applications (Q5091038) (← links)
- (Q5091191) (← links)
- (Q5111721) (← links)
- Approximate Range Queries for Clustering (Q5116522) (← links)
- (Q5874528) (← links)
- (Q5875522) (← links)
- Clustering with faulty centers (Q6092308) (← links)
- Linear-time approximation scheme for \(k\)-means clustering of axis-parallel affine subspaces (Q6103169) (← links)
- A novel method for optimizing spectral rotation embedding \(K\)-means with coordinate descent (Q6125254) (← links)
- On coresets for fair clustering in metric and Euclidean spaces and their applications (Q6152182) (← links)
- Turning Grain Maps into Diagrams (Q6173521) (← links)
