3 citations · 3 across the 2 of their papers we have counts for
3 papers
cs.DS2020
Faster Projective Clustering Approximation of Big Data
Adiel Statman, Liat Rozenberg, Dan Feldman
In projective clustering we are given a set of n points in and wish to cluster them to a set of linear subspaces in according to some given distance function. A…
cs.DS2020
Sparse Coresets for SVD on Infinite Streams
Vladimir Braverman, Dan Feldman, Harry Lang +2
In streaming Singular Value Decomposition (SVD), -dimensional rows of a possibly infinite matrix arrive sequentially as points in . An -coreset is a (much small…
cs.LG2019★ 3 cited
Tight Sensitivity Bounds For Smaller Coresets
Alaa Maalouf, Adiel Statman, Dan Feldman
An -coreset for Least-Mean-Squares (LMS) of a matrix is a small weighted subset of its rows that approximates the sum of squared distanc…