Pages that link to "Item:Q3580976"

The following pages link to On coresets for k-means and k-median clustering (Q3580976):

Displaying 50 items.

• Clustering through continuous facility location problems (Q346248) (← links)
• Streaming with minimum space: an algorithm for covering by two congruent balls (Q393049) (← links)
• Some results on approximate 1-median selection in metric spaces (Q418725) (← links)
• A simple \(D^2\)-sampling based PTAS for \(k\)-means and other clustering problems (Q486976) (← links)
• One-dimensional \(k\)-center on uncertain data (Q497686) (← links)
• An almost space-optimal streaming algorithm for coresets in fixed dimensions (Q547286) (← links)
• Efficient approximation algorithms for clustering point-sets (Q733558) (← links)
• Dynamic coresets (Q834605) (← links)
• How to get close to the median shape (Q870425) (← links)
• A quantization framework for smoothed analysis of Euclidean optimization problems (Q893320) (← 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)
• Single facility collection depots location problem in the plane (Q1025297) (← links)
• Aggregation error for location models: Survey and analysis (Q1026594) (← links)
• Faster algorithms for the constrained \(k\)-means problem (Q1702850) (← links)
• An efficient \(K\)-means clustering algorithm for tall data (Q1987188) (← links)
• Attainable accuracy guarantee for the \(k\)-medians clustering in [0, 1] (Q2010139) (← links)
• Lossy kernelization of same-size clustering (Q2097218) (← links)
• Linear-size universal discretization of geometric center-based problems in fixed dimensions (Q2125228) (← links)
• An efficient sum query algorithm for distance-based locally dominating functions (Q2196604) (← links)
• Parameterized \(k\)-clustering: tractability island (Q2221803) (← 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)
• A linear time algorithm for approximate 2-means clustering (Q2573339) (← links)
• Compressive statistical learning with random feature moments (Q2664824) (← links)
• On some variants of Euclidean \(k\)-supplier (Q2670484) (← links)
• On the \(k\)-means/median cost function (Q2671798) (← links)
• Algorithms for k-median Clustering over Distributed Streams (Q2817895) (← links)
• Accurate Low-Space Approximation of Metric k-Median for Insertion-Only Streams (Q2971636) (← links)
• Clustering with Internal Connectedness (Q3078394) (← links)
• Core-Sets: Updated Survey (Q3297370) (← links)
• A Family of Unsupervised Sampling Algorithms (Q3297372) (← links)
• Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering (Q3304733) (← links)
• Sublinear‐time approximation algorithms for clustering via random sampling (Q3419620) (← links)
• Fixed Parameter Approximations for k-Center Problems in Low Highway Dimension Graphs (Q3449507) (← links)
• Facility Location in Dynamic Geometric Data Streams (Q3541125) (← links)
• An Almost Space-Optimal Streaming Algorithm for Coresets in Fixed Dimensions (Q3541136) (← links)
• (Q4558482) (← links)
• A Streaming Algorithm for k-Means with Approximate Coreset (Q4631688) (← links)
• (Q4633019) (← links)
• Local Search Yields a PTAS for $k$-Means in Doubling Metrics (Q4634026) (← 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)
• Data Exploration by Representative Region Selection: Axioms and Convergence (Q4958552) (← links)
• Some Estimates on the Discretization of Geometric Center-Based Problems in High Dimensions (Q4965103) (← links)
• On the Optimization Models for Automatic Grouping of Industrial Products by Homogeneous Production Batches (Q4965131) (← links)
• Semi-Supervised Algorithms for Approximately Optimal and Accurate Clustering (Q5002733) (← links)
• Computational complexity of the problem of choosing typical representatives in a 2-clustering of a finite set of points in a metric space (Q5090149) (← links)
• Coresets for Fuzzy K-Means with Applications (Q5091038) (← links)