Faster coreset construction for projective clustering via low-rank approximation

DOI10.1007/978-3-319-94667-2_28MaRDI QIDQ1671019OpenAlexFDO

Authors Rameshwar Pratap, Sandeep Sen

Publication date 6 September 2018

Full work available at URL https://arxiv.org/abs/1606.07992

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Recommendations

• Turning big data into tiny data: constant-size coresets for \(k\)-means, PCA and projective clustering
• Coresets and sketches for high dimensional subspace approximation problems
• scientific article; zbMATH DE number 7053357
• Projective clustering in high dimensions using core-sets
• Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering

Cited in

(2)

• Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering
• Turning big data into tiny data: constant-size coresets for \(k\)-means, PCA and projective clustering

This page was built for publication: Faster coreset construction for projective clustering via low-rank approximation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1671019)