Efficient subspace approximation algorithms
From MaRDI portal
Publication:664540
DOI10.1007/s00454-011-9384-2zbMath1232.68167OpenAlexW3137387293MaRDI QIDQ664540
Nariankadu D. Shyamalkumar, Kasturi R. Varadarajan
Publication date: 2 March 2012
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-011-9384-2
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Randomized algorithms (68W20)
Related Items (2)
Sampling-based dimension reduction for subspace approximation with outliers ⋮ Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algebraic optimization: The Fermat-Weber location problem
- How to get close to the median shape
- A note on the robustness of multivariate medians
- On the complexity of some basic problems in computational convexity. I. Containment problems
- Continuous location of dimensional structures.
- High-dimensional shape fitting in linear time
- Geometric optimization problems likely not contained in \(\mathbb A\mathbb P\mathbb X\)
- Note on the computational complexity of \(j\)-radii of polytopes in \(\mathbb R^ n\)
- Computational complexity of inner and outer \(j\)-radii of polytopes in finite-dimensional normed spaces
- On the complexity of some geometric problems in unbounded dimension
- Sampling-based dimension reduction for subspace approximation
- Approximate clustering via core-sets
- Matrix approximation and projective clustering via volume sampling
- Sampling algorithms for l2 regression and applications
- Adaptive Sampling and Fast Low-Rank Matrix Approximation
- Projective clustering in high dimensions using core-sets
- Principal Manifolds and Nonlinear Dimensionality Reduction via Tangent Space Alignment
- Approximating the Radii of Point Sets
- Fast monte-carlo algorithms for finding low-rank approximations
- Fast Construction of Nets in Low-Dimensional Metrics and Their Applications
This page was built for publication: Efficient subspace approximation algorithms
