Projective clustering in high dimensions using core-sets
From MaRDI portal
Recommendations
Cited in
(17)- Faster coreset construction for projective clustering via low-rank approximation
- Metacluster-based projective clustering ensembles
- Streaming algorithms for extent problems in high dimensions
- Optimal core-sets for balls
- On the sensitivity of shape fitting problems
- Core-sets: updated survey
- Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering
- scientific article; zbMATH DE number 1445346 (Why is no real title available?)
- On geometric prototype and applications
- High-dimensional shape fitting in linear time
- A unified framework for approximating and clustering data
- scientific article; zbMATH DE number 7053310 (Why is no real title available?)
- Analysis of incomplete data and an intrinsic-dimension Helly theorem
- Efficient subspace approximation algorithms
- Fast subspace approximation via greedy least-squares
- Dynamic coresets
- Small space representations for metric min-sum k-clustering and their applications
This page was built for publication: Projective clustering in high dimensions using core-sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4557567)