Fetching the paper…
Reading the bibliography…
A coreset for a set of points is a small subset of weighted points that approximately preserves important properties of the original set.
On the uniform convergence of relative frequencies of events to their probabilities
VN Vapnik and A Ya Chervonenkis · 1971
Earlier work this paper cites.
Sharper bounds for gaussian and empirical processes
Michel Talagrand · 1994
Earlier work this paper cites.
Sphere packing numbers for subsets of the boolean n-cube with bounded vapnik-chervonenkis dimension
David Haussler · 1995
Earlier work this paper cites.
Improved bounds on the sample complexity of learning
Yi Li, Philip M. Long, and Aravind Srinivasan · 2001
Earlier work this paper cites.
Approximate clustering via core-sets
Mihai Badoiu, Sariel Har-Peled, and Piotr Indyk · 2002
Earlier work this paper cites.
On coresets for k-means and k-median clustering
Sariel Har-Peled and Soham Mazumdar · 2004
Earlier work this paper cites.
Coresets in dynamic geometric data streams
Gereon Frahling and Christian Sohler · 2005
Earlier work this paper cites.
Robust shape fitting via peeling and grating coresets
Pankaj K. Agarwal, Sariel Har-Peled, and Hai Yu · 2006
Earlier work this paper cites.
Matrix approximation and projective clustering via volume sampling
Amit Deshpande, Luis Rademacher, Santosh S. Vempala, and Grant Wang · 2006
Earlier work this paper cites.
Coresets for weighted facilities and their applications
Dan Feldman, Amos Fiat, and Micha Sharir · 2006
Earlier work this paper cites.
Sampling-based dimension reduction for subspace approximation
Amit Deshpande and Kasturi R. Varadarajan · 2007
Earlier work this paper cites.
Coresets, sparse greedy approximation, and the frank-wolfe algorithm
Kenneth L. Clarkson · 2008
Earlier work this paper cites.
Sampling algorithms and coresets for ℓ p \ell_{p} regression
Anirban Dasgupta, Petros Drineas, Boulos Harb, Ravi Kumar, and Michael W. Mahoney · 2008
Earlier work this paper cites.
A fast k-means implementation using coresets
Gereon Frahling and Christian Sohler · 2008
Cited alongside, same era.
Coresets and approximate clustering for bregman divergences
Marcel R. Ackermann and Johannes Blömer · 2009
Cited alongside, same era.
Coresets and sketches for high dimensional subspace approximation problems
Dan Feldman, Morteza Monemizadeh, Christian Sohler, and David P. Woodruff · 2010
Cited alongside, same era.
Coresets and sketches for high dimensional subspace approximation problems
Dan Feldman, Morteza Monemizadeh, Christian Sohler, and David P Woodruff · 2010
Cited alongside, same era.
A unified framework for approximating and clustering data
Dan Feldman and Michael Langberg · 2011
Cited alongside, same era.
Relative ( p , ϵ \epsilon )-approximations in geometry
Sariel Har-Peled and Micha Sharir · 2011
Cited alongside, same era.
Input sparsity and hardness for robust subspace approximation
Kenneth L. Clarkson and David P. Woodruff · 2015
Later among the works it cites.
New frameworks for offline and streaming coreset constructions
Vladimir Braverman, Dan Feldman, and Harry Lang · 2016
Closest in time.
Near optimal linear algebra in the online and sliding window models
Vladimir Braverman, Petros Drineas, Cameron Musco, Christopher Musco, Jalaj Upadhyay, David P. Woodruff, and Samson Zhou · 2018
Closest in time.
Epsilon-coresets for clustering (with outliers) in doubling metrics
Lingxiao Huang, Shaofeng H.-C. Jiang, Jian Li, and Xuan Wu · 2018
Closest in time.
On coresets for logistic regression
Alexander Munteanu, Chris Schwiegelshohn, Christian Sohler, and David P. Woodruff · 2018
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
https://gist.github.com/h3xx/1976236 , 2012
2012
Cited alongside, same era.
Data reduction for weighted and outlier-resistant clustering
Dan Feldman and Leonard J. Schulman · 2012
Cited alongside, same era.
A near-linear algorithm for projective clustering integer points
Kasturi R. Varadarajan and Xin Xiao · 2012
Cited alongside, same era.
On the sensitivity of shape fitting problems
Kasturi R. Varadarajan and Xin Xiao · 2012
Cited alongside, same era.
A public domain dataset for human activity recognition using smartphones, 2013
Davide Anguita, Alessandro Ghio, Luca Oneto, Xavier Parra, and Jorge L. Reyes-Ortiz · 2013
Cited alongside, same era.
A public domain dataset for human activity recognition using smartphones., 2013
Davide Anguita, Alessandro Ghio, Luca Oneto, Xavier Parra, and Jorge Luis Reyes-Ortiz · 2013
Cited alongside, same era.
Improved coresets for kernel density estimates
Jeff M. Phillips and Wai Ming Tai · 2018
Closest in time.
Strong coresets for k-median and subspace approximation: Goodbye dimension
Christian Sohler and David P. Woodruff · 2018
Closest in time.
Coresets meet EDCS: algorithms for matching and vertex cover on massive graphs
Sepehr Assadi, MohammadHossein Bateni, Aaron Bernstein, Vahab S. Mirrokni, and Cliff Stein · 2019
Closest in time.
Improved algorithms for time decay streams
Vladimir Braverman, Harry Lang, Enayat Ullah, and Samson Zhou · 2019
Closest in time.
https://dumps.wikimedia.org/enwiki/latest/ , 2019
2019
Closest in time.
Turning big data into tiny data: Constant-size coresets for k-means, pca, and projective clustering
Dan Feldman, Melanie Schmidt, and Christian Sohler · 2020
Closest in time.
Coresets for clustering in euclidean spaces: importance sampling is nearly optimal
Lingxiao Huang and Nisheeth K. Vishnoi · 2020
Closest in time.
Data-independent neural pruning via coresets
Ben Mussay, Margarita Osadchy, Vladimir Braverman, Samson Zhou, and Dan Feldman · 2020
Closest in time.