Core-sets: updated survey
From MaRDI portal
Recommendations
Cites work
- -nets and simplex range queries
- A constant-factor approximation algorithm for the k-median problem
- A PTAS for k-means clustering based on weak coresets
- A unified framework for approximating and clustering data
- Adaptive Sampling for k-Means Clustering
- Approximating extent measures of points.
- Approximation algorithms for projective clustering
- Approximations and optimal geometric divide-and-conquer
- Bi-criteria linear-time approximations for generalized k-mean/median/center
- Bounded-Hop Energy-Efficient Broadcast in Low-Dimensional Metrics Via Coresets
- Comparing distributions and shapes using the kernel distance
- Coresets and sketches for high dimensional subspace approximation problems
- Coresets for Discrete Integration and Clustering
- Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
- Data reduction for weighted and outlier-resistant clustering
- Data Streams: Algorithms and Applications
- Decomposable searching problems I. Static-to-dynamic transformation
- Dimensionality reduction for k-means clustering and low rank approximation
- Efficient subspace approximation algorithms
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- scientific article; zbMATH DE number 5764828 (Why is no real title available?)
- scientific article; zbMATH DE number 1947381 (Why is no real title available?)
- scientific article; zbMATH DE number 2079414 (Why is no real title available?)
- scientific article; zbMATH DE number 814821 (Why is no real title available?)
- scientific article; zbMATH DE number 1445346 (Why is no real title available?)
- scientific article; zbMATH DE number 7164768 (Why is no real title available?)
- scientific article; zbMATH DE number 5019895 (Why is no real title available?)
- scientific article; zbMATH DE number 7053357 (Why is no real title available?)
- Improved bounds on the sample complexity of learning
- Improved bounds on weak ε-nets for convex sets
- Improved Combinatorial Algorithms for Facility Location Problems
- Learnability and the Vapnik-Chervonenkis dimension
- Maintaining approximate extent measures of moving points
- Matrix approximation and projective clustering via volume sampling
- Neural Network Learning
- New constructions of weak epsilon-nets
- Numerical linear algebra in the streaming model
- On Coresets for k-Median and k-Means Clustering in Metric and Euclidean Spaces and Their Applications
- On coresets for k-means and k-median clustering
- Optimal core-sets for balls
- Private coresets
- Probability Inequalities for Sums of Bounded Random Variables
- Projective clustering in high dimensions using core-sets
- Randomized Algorithms for Matrices and Data
- Randomized Dimensionality Reduction for <inline-formula> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula>-Means Clustering
- Sampling algorithms for l₂ regression and applications
- Shape Fitting on Point Sets with Probability Distributions
- Smaller coresets for \(k\)-median and \(k\)-means clustering
- The effectiveness of Lloyd-type methods for the \(k\)-means problem
- The EM Algorithm and Extensions, 2E
- The Planar k-Means Problem is NP-Hard
- Training Gaussian mixture models at scale via coresets
- Turning big data into tiny data: constant-size coresets for k-means, PCA and projective clustering
- Twice-Ramanujan sparsifiers
- Uniform sampling for matrix approximation
- Universal \({\epsilon}\)-approximators for integrals
Cited in
(9)- Making sense of economics datasets with evolutionary coresets
- Private coresets
- Coresets for the Nearest-Neighbor Rule
- On coresets for support vector machines
- One-pass additive-error subset selection for \(\ell_p\) subspace approximation and \((k, p)\)-clustering
- Coresets for \((k, \ell ) \)-median clustering under the Fréchet distance
- A data-dependent approach for high-dimensional (robust) Wasserstein alignment
- No-substitution k-means clustering with adversarial order
- Provable imbalanced point clustering
This page was built for publication: Core-sets: updated survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3297370)
