Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering (Q3304733)

!

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

Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering

scientific article; zbMATH DE number 7226864

Language	Label	Description	Also known as
default for all languages	No label defined
English	Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering	scientific article; zbMATH DE number 7226864

Statements

instance of

scholarly article

0 references

title

Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering (English)

0 references

0 references

0 references

0 references

SIAM Journal on Computing

0 references

publication date

3 August 2020

0 references

full work available at URL

https://arxiv.org/abs/1807.04518

0 references

zbMATH Keywords

PCA

0 references

$k$-means

0 references

projective clustering

0 references

coresets

0 references

streaming

0 references

big data

0 references

describes a project that uses

0 references

0 references

0 references

MaRDI publication profile

0 references

cites work

Mergeable summaries

0 references

The hardness of approximation of Euclidean $k$-means

0 references

NP-hardness of Euclidean sum-of-squares clustering

0 references

Adaptive Sampling for k-Means Clustering

0 references

Approximating extent measures of points.

0 references

StreamKM++, a clustering algorithm for data streams

0 references

Q2934696

0 references

Learnability and the Vapnik-Chervonenkis dimension

0 references

An improved approximation algorithm for the column subset selection problem

0 references

Decomposable searching problems I. Static-to-dynamic transformation

0 references

Twice-Ramanujan sparsifiers

0 references

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

0 references

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

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

Local Search Yields Approximation Schemes for $k$-Means and $k$-Median in Euclidean and Minor-Free Metrics

0 references

Optimal Approximate Matrix Product in Terms of Stable Rank

0 references

Numerical linear algebra in the streaming model

0 references

Clustering large graphs via the singular value decomposition

0 references

Matrix approximation and projective clustering via volume sampling

0 references

Algorithms and hardness for subspace approximation

0 references

Adaptive Sampling and Fast Low-Rank Matrix Approximation

0 references

The VC dimension of $k$-fold union

0 references

FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science

0 references

BICO: BIRCH meets coresets for $k$-means clustering

0 references

A unified framework for approximating and clustering data

0 references

A PTAS for k-means clustering based on weak coresets

0 references

Coresets and sketches for high dimensional subspace approximation problems

0 references

Local search yields a PTAS for $k$-means in doubling metrics

0 references

Coresets in dynamic geometric data streams

0 references

Data reduction for weighted and outlier-resistant clustering

0 references

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

0 references

Calculating the Singular Values and Pseudo-Inverse of a Matrix

0 references

Largest $j$-simplices in $n$-polytopes

0 references

Frequent directions: simple and deterministic matrix sketching

0 references

Singular value decomposition and least squares solutions

0 references

FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science

0 references

Coresets for Discrete Integration and Clustering

0 references

Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions

0 references

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

0 references

On coresets for k-means and k-median clustering

0 references

Relative $(p,\varepsilon )$-approximations in geometry

0 references

Linear-time approximation schemes for clustering problems in any dimensions

0 references

Improved bounds on the sample complexity of learning

0 references

Universal ${\epsilon}$-approximators for integrals

0 references

Improved and simplified inapproximability for $k$-means

0 references

Randomized Algorithms for Matrices and Data

0 references

The Planar k-Means Problem is NP-Hard

0 references

On the complexity of locating linear facilities in the plane

0 references

Data streams: algorithms and applications.

0 references

A fast and efficient algorithm for low-rank approximation of a matrix

0 references

Q4486034

0 references

On the Early History of the Singular Value Decomposition

0 references

Efficient subspace approximation algorithms

0 references

Q5743480

0 references

On the sensitivity of shape fitting problems

0 references

Lower Bounds for Approximation by Nonlinear Manifolds

0 references

Identifiers

zbMATH Open document ID

1451.68244

0 references

DOI

10.1137/18M1209854

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering