Fetching the paper…
Reading the bibliography…
We study the effect of Johnson-Lindenstrauss transforms in various projective clustering problems, generalizing recent results which only applied to center-based clustering [MMR19].
Extensions of Lipschitz mappings into a Hilbert space
William Johnson and Joram Lindenstrauss · 1984
Earlier work this paper cites.
Approximate nearest neighbors: Towards removing the curse of dimensionality
Piotr Indyk and Rajeev Motwani · 1998
Earlier work this paper cites.
Approximate clustering via core-sets
Mihai Badoiu, Sariel Har-Peled, and Piotr Indyk · 2002
Earlier work this paper cites.
Projective clustering in high-dimensions using core-sets
Sariel Har-Peled and Kasturi Varadarajan · 2002
Earlier work this paper cites.
Approximation algorithms for projective clustering
Panjak K Agarwal and Cecilia M Procopiuc · 2003
Earlier work this paper cites.
An elementary proof of a theorem of johnson and lindenstrauss
Sanjoy Dasgupta and Anupam Gupta · 2003
Earlier work this paper cites.
No, coreset, no cry
Sariel Har-Peled · 2004
Earlier work this paper cites.
On coresets for k k -means and k k -median clustering
Sariel Har-Peled and Soham Mazumdar · 2004
Earlier work this paper cites.
Geometric approximation via coresets
Pankaj K. Agarwal, Sariel Har-Peled, and Kasturi R. Varadarajan · 2005
Earlier work this paper cites.
No coreset, no cry: Ii
Michael Edwards and Kasturi Varadarajan · 2005
Earlier work this paper cites.
Matrix approximation and projective clustering via volume sampling
Amit Deshpande, Luis Rademacher, Santosh Vempala, and Grant Wang · 2006
Earlier work this paper cites.
Improved approximation algorithms for large matrices via random projections
Tamas Sarlos · 2006
Earlier work this paper cites.
Efficient subspace approximation algorithms
Nariankadu D. Shyamalkumar and Kasturi Varadarajan · 2007
Earlier work this paper cites.
On coresets for k-median and k-means clustering in metric and euclidean spaces and their applications
Ke Chen · 2009
Earlier work this paper cites.
Random projections for k k -means clustering
Christos Boutsidis, Anastasios Zouzias, and Petros Drineas · 2010
Earlier work this paper cites.
Universal epsilon-approximators for integrals
Michael Langberg and Leonard J. Schulman · 2010
Cited alongside, same era.
A unified framework for approximating and clustering data
Dan Feldman and Michael Langberg · 2011
Cited alongside, same era.
Randomized algorithms for matrices and data
Michael W. Mahoney · 2011
Cited alongside, same era.
Approximate nearest neighbor: Towards removing the curse of dimensionality
Sariel Har-Peled, Piotr Indyk, and Rajeev Motwani · 2012
Cited alongside, same era.
Efficient subspace approximation algorithms
Nariankadu D. Shuamalkumar and Katsuri Varadarajan · 2012
Cited alongside, same era.
A near-linear algorithm for projective clustering of integer points
Kasturi Varadarajan and Xin Xiao · 2012
Cited alongside, same era.
Strong coresets for k k -median and subspace approximation
Christian Sohler and David Woodruff · 2018
Later among the works it cites.
Oblivious dimension reduction for k k -means: Beyond subspaces and the johnson-lindenstrauss lemma
Luca Becchetti, Marc Bury, Vincent Cohen-Addad, Fabrizio Grandoni, and Chris Schwiegelshohn · 2019
Later among the works it cites.
Performance of johnson-lindenstrauss transform for k k -means and k k -medians clustering
Konstantin Makarychev, Yuri Makarychev, and Ilya Razenshteyn · 2019
Later among the works it cites.
Optimal terminal dimensionality reduction in euclidean space
Shyam Nayaranan and Jelani Nelson · 2019
Later among the works it cites.
Coresets for clustering in graphs of bounded treewidth
Daniel Baker, Vladimir Braverman, Lingxiao Huang, Shaofeng H-C Jiang, Robert Krauthgamer, and Xuan Wu · 2020
Later among the works it cites.
Introduction to core-sets: an updated survey
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
On the sensitivity of shape fitting problems
Kasturi Varadarajan and Xin Xiao · 2012
Cited alongside, same era.
Turning big data into tiny data: constant-size coresets for k-means, pca and projective clustering
Dan Feldman, Melanie Schmidt, and Christian Sohler · 2013
Cited alongside, same era.
Sketching as a tool for numerical linear algebra
David P. Woodruff · 2014
Cited alongside, same era.
Dimensionality reduction for k k -means clustering and low rank approximation
Michael B. Cohen, Sam Elder, Cameron Musco, Christopher Musco, and Mădălina Persu · 2015
Cited alongside, same era.
Approximation and streaming algorithms for projective clustering via random projections
Michael Kerber and Sharath Raghvendra · 2015
Cited alongside, same era.
New frameworks for offline and streaming coreset constructions
Vladimir Braverman, Dan Feldman, and Harry Lang · 2016
Cited alongside, same era.
Dan Feldman · 2020
Later among the works it cites.
Turning big data into tiny data: constant-size coresets for k-means, pca, and projective clustering
Dan Feldman, Melanie Schmidt, and Christian Sohler · 2020
Later among the works it cites.
Coresets for clustering in euclidean spaces: importance sampling is nearly optimal
Lingxiao Huang and Nisheeth K. Vishnoi · 2020
Later among the works it cites.
A new coreset framework for clustering
Vincent Cohen-Addad, David Saulpic, and Chris Schwiegelshohn · 2021
Later among the works it cites.
Terminal embeddings in sublinear time
Yeshwanth Cherapanamjeri and Jelani Nelson · 2021
Later among the works it cites.
Dimensionality reduction for wasserstein barycenter
Zachary Izzo, Sandeep Silwal, and Samson Zhou · 2021
Later among the works it cites.
Randomized dimensionality reduction for facility location and single-linkage clustering
Shyam Narayanan, Sandeep Silwal, Piotr Indyk, and Or Zamir · 2021
Later among the works it cites.
Towards optimal lower bounds for k k -median and k k -means coresets
Vincent Cohen-Addad, Kasper Green Larsen, David Saulpic, and Chris Schwiegelshohn · 2022
Closest in time.
New coresets for projective clustering and applications
Murad Tukan, Xuan Wu, Samson Zhou, Vladimir Braverman, and Dan Feldman · 2022
Closest in time.