One-pass additive-error subset selection for _p subspace approximation and (k, p)-clustering
From MaRDI portal
(Redirected from Publication:6046948)
One-pass additive-error subset selection for \(\ell p\) subspace approximation and \((k, p)\)-clustering
One-pass additive-error subset selection for \(\ell p\) subspace approximation and \((k, p)\)-clustering
Cites work
- scientific article; zbMATH DE number 6381735 (Why is no real title available?)
- A PTAS for ℓp-Low Rank Approximation
- A general purpose unequal probability sampling plan
- A simple \(D^2\)-sampling based PTAS for \(k\)-means and other clustering problems
- Adaptive Sampling and Fast Low-Rank Matrix Approximation
- Adaptive Sampling for k-Means Clustering
- An improved approximation algorithm for the column subset selection problem
- CUR matrix decompositions for improved data analysis
- Competitive recommendation systems
- Core-sets: updated survey
- Coresets and sketches for high dimensional subspace approximation problems
- Exact bound for the convergence of metropolis chains
- Fast monte-carlo algorithms for finding low-rank approximations
- Frequent directions: simple and deterministic matrix sketching
- Improved analysis of D^2-sampling based PTAS for k-means and other clustering problems
- Improving CUR matrix decomposition and the Nyström approximation via adaptive sampling
- Input sparsity time low-rank approximation via ridge leverage score sampling
- Least squares quantization in PCM
- Matrix approximation and projective clustering via volume sampling
- NP-hardness of Euclidean sum-of-squares clustering
- Non-adaptive adaptive sampling on turnstile streams
- Optimal column-based low-rank matrix reconstruction
- Random sampling with a reservoir
- Randomized Algorithms for Matrices and Data
- Relative errors for deterministic low-rank matrix approximations
- Relative-Error CUR Matrix Decompositions
- Sampling-based dimension reduction for subspace approximation
- Tensor-CUR Decompositions for Tensor-Based Data
- The planar \(k\)-means problem is NP-hard
This page was built for publication: One-pass additive-error subset selection for \(\ell_p\) subspace approximation and \((k, p)\)-clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6046948)
