Core-sets: updated survey (Q3297370)

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

Core-sets: updated survey

scientific article; zbMATH DE number 7217550

Language	Label	Description	Also known as
default for all languages	No label defined
English	Core-sets: updated survey	scientific article; zbMATH DE number 7217550

Statements

instance of

scholarly article

0 references

title

Core-Sets: Updated Survey (English)

0 references

author

Dan Feldman

0 references

published in

Sampling Techniques for Supervised or Unsupervised Tasks

0 references

publication date

3 July 2020

0 references

zbMATH Keywords

core-sets

0 references

data summarization

0 references

clustering

0 references

query

0 references

approximation error

0 references

coresets

0 references

sup-sampling

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-030-29349-9_2

0 references

cites work

Maintaining approximate extent measures of moving points

0 references

Approximating extent measures of points.

0 references

Q5290249

0 references

Q4952664

0 references

Approximation algorithms for projective clustering

0 references

Q4411345

0 references

Adaptive Sampling for k-Means Clustering

0 references

Neural Network Learning

0 references

Q4471374

0 references

Optimal core-sets for balls

0 references

Twice-Ramanujan sparsifiers

0 references

Decomposable searching problems I. Static-to-dynamic transformation

0 references

Learnability and the Vapnik-Chervonenkis dimension

0 references

Randomized Dimensionality Reduction for <inline-formula> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula>-Means Clustering

0 references

Improved Combinatorial Algorithms for Facility Location Problems

0 references

A constant-factor approximation algorithm for the $k$-median problem

0 references

Improved bounds on weak ε-nets for convex sets

0 references

On Coresets for <i>k</i>-Median and <i>k</i>-Means Clustering in Metric and Euclidean Spaces and Their Applications

0 references

Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm

0 references

Numerical linear algebra in the streaming model

0 references

Dimensionality reduction for $k$-means clustering and low rank approximation

0 references

Uniform sampling for matrix approximation

0 references

Q3579418

0 references

Matrix approximation and projective clustering via volume sampling

0 references

Sampling algorithms for $l_2$ regression and applications

0 references

FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science

0 references

A unified framework for approximating and clustering data

0 references

Data reduction for weighted and outlier-resistant clustering

0 references

Bi-criteria linear-time approximations for generalized k-mean/median/center

0 references

A PTAS for k-means clustering based on weak coresets

0 references

Private coresets

0 references

Coresets and sketches for high dimensional subspace approximation problems

0 references

Training Gaussian mixture models at scale via coresets

0 references

Turning big data into tiny data: constant-size coresets for $k$-means, PCA and projective clustering

0 references

Q4855364

0 references

Bounded-Hop Energy-Efficient Broadcast in Low-Dimensional Metrics Via Coresets

0 references

FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science

0 references

Coresets for Discrete Integration and Clustering

0 references

Smaller coresets for $k$-median and $k$-means clustering

0 references

On coresets for k-means and k-median clustering

0 references

Projective clustering in high dimensions using core-sets

0 references

$\epsilon$-nets and simplex range queries

0 references

Probability Inequalities for Sums of Bounded Random Variables

0 references

Comparing distributions and shapes using the kernel distance

0 references

Universal ${\epsilon}$-approximators for integrals

0 references

Improved bounds on the sample complexity of learning

0 references

Shape Fitting on Point Sets with Probability Distributions

0 references

The Planar k-Means Problem is NP-Hard

0 references

Randomized Algorithms for Matrices and Data

0 references

Approximations and optimal geometric divide-and-conquer

0 references

New constructions of weak epsilon-nets

0 references

The EM Algorithm and Extensions, 2E

0 references

Data Streams: Algorithms and Applications

0 references

The effectiveness of Lloyd-type methods for the $k$-means problem

0 references

Efficient subspace approximation algorithms

0 references

Q5214265

0 references

Q5743480

0 references

Identifiers

zbMATH Open document ID

1436.62707

0 references

DOI

10.1007/978-3-030-29349-9_2

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Core-sets: updated survey