Efficient subspace approximation algorithms
From MaRDI portal
Publication:664540
DOI10.1007/S00454-011-9384-2zbMATH Open1232.68167OpenAlexW3137387293MaRDI QIDQ664540FDOQ664540
Authors: Nariankadu D. Shyamalkumar, Kasturi 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
Recommendations
- A greedy algorithm for subspace approximation problem
- Algorithms and hardness for subspace approximation
- Coresets and sketches for high dimensional subspace approximation problems
- Fast subspace approximation via greedy least-squares
- Sampling-based dimension reduction for subspace approximation with outliers
Randomized algorithms (68W20) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Cites Work
- Title not available (Why is that?)
- Algebraic optimization: The Fermat-Weber location problem
- Sampling algorithms for \(l_2\) regression and applications
- Fast monte-carlo algorithms for finding low-rank approximations
- Principal Manifolds and Nonlinear Dimensionality Reduction via Tangent Space Alignment
- Fast Construction of Nets in Low-Dimensional Metrics and Their Applications
- Continuous location of dimensional structures.
- A note on the robustness of multivariate medians
- Approximate clustering via core-sets
- On the complexity of some geometric problems in unbounded dimension
- Approximating the Radii of Point Sets
- Geometric optimization problems likely not contained in \(\mathbb A\mathbb P\mathbb X\)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computational complexity of inner and outer \(j\)-radii of polytopes in finite-dimensional normed spaces
- How to get close to the median shape
- On the complexity of some basic problems in computational convexity. I. Containment problems
- High-dimensional shape fitting in linear time
- Note on the computational complexity of \(j\)-radii of polytopes in \(\mathbb R^ n\)
- Subgradient and sampling algorithms for \(\ell_1\) regression
- Sampling-based dimension reduction for subspace approximation
- Matrix approximation and projective clustering via volume sampling
- Adaptive Sampling and Fast Low-Rank Matrix Approximation
- Projective clustering in high dimensions using core-sets
Cited In (12)
- Efficient point-to-subspace query in \(\ell^1\) with application to robust object instance recognition
- Coresets and sketches for high dimensional subspace approximation problems
- A greedy algorithm for subspace approximation problem
- Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering
- High-dimensional shape fitting in linear time
- Efficient subspace approximation algorithms
- Testing proximity to subspaces: approximate \(\ell_\infty\) minimization in constant time
- Optimal expansion of subspaces for eigenvector approximations
- Fast subspace approximation via greedy least-squares
- Algorithms and hardness for subspace approximation
- Sampling-based dimension reduction for subspace approximation with outliers
- Computer algorithms for calculating efficient initial vectors for subspace iteration method
This page was built for publication: Efficient subspace approximation algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q664540)
