Pages that link to "Item:Q3575154"

The following pages link to On Coresets for <i>k</i>-Median and <i>k</i>-Means Clustering in Metric and Euclidean Spaces and Their Applications (Q3575154):

Displaying 45 items.

• A lower bound for metric 1-median selection (Q340556) (← links)
• Smaller coresets for \(k\)-median and \(k\)-means clustering (Q866968) (← 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)
• Faster balanced clusterings in high dimension (Q2006774) (← links)
• A bi-criteria analysis for fuzzy \(C\)-means problem (Q2039654) (← links)
• On parameterized approximation algorithms for balanced clustering (Q2111529) (← links)
• Approximation and complexity of the capacitated geometric median problem (Q2117109) (← links)
• A strong coreset algorithm to accelerate OPF as a graph-based machine learning in large-scale problems (Q2124197) (← links)
• An efficient sum query algorithm for distance-based locally dominating functions (Q2196604) (← links)
• Metric \(k\)-median clustering in insertion-only streams (Q2231758) (← links)
• A unified framework for clustering constrained data without locality property (Q2300724) (← links)
• A faster algorithm for truth discovery via range cover (Q2324248) (← links)
• Probabilistic \(k\)-median clustering in data streams (Q2344214) (← links)
• Concentration of kernel matrices with application to kernel spectral clustering (Q2656607) (← links)
• Metric 1-Median Selection: Query Complexity vs. Approximation Ratio (Q2817856) (← links)
• Clustering for metric and nonmetric distance measures (Q2930341) (← links)
• Accurate Low-Space Approximation of Metric k-Median for Insertion-Only Streams (Q2971636) (← links)
• Core-Sets: Updated Survey (Q3297370) (← links)
• Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering (Q3304733) (← links)
• On coresets for k-means and k-median clustering (Q3580976) (← 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)
• On Geometric Prototype and Applications (Q5009580) (← links)
• (Q5075771) (← links)
• Coresets for Fuzzy K-Means with Applications (Q5091038) (← links)
• (Q5091191) (← links)
• (Q5091192) (← links)
• Approximate Range Queries for Clustering (Q5116522) (← links)
• An efficient sum query algorithm for distance-based locally dominating functions (Q5136267) (← links)
• (Q5214265) (← links)
• (Q5743480) (← links)
• (Q5874528) (← links)
• Improved Algorithms for Time Decay Streams (Q5875480) (← links)
• (Q5875522) (← links)
• A unified framework of FPT approximation algorithms for clustering problems (Q6065394) (← links)
• FPT Approximation for Constrained Metric k-Median/Means (Q6089659) (← links)
• Clustering with faulty centers (Q6092308) (← links)
• Linear-time approximation scheme for \(k\)-means clustering of axis-parallel affine subspaces (Q6103169) (← links)
• On coresets for fair clustering in metric and Euclidean spaces and their applications (Q6152182) (← links)
• Tight FPT approximation for socially fair clustering (Q6161442) (← links)
• Polynomial approximate discretization of geometric centers in high-dimensional Euclidean space (Q6161667) (← links)
• \(k\)-median/means with outliers revisited: a simple fpt approximation (Q6591646) (← links)
• FPT approximation for capacitated clustering with outliers (Q6658317) (← links)