Sampling-based dimension reduction for subspace approximation

16 years 3 months ago

Download www.cs.uiowa.edu

We give a randomized bi-criteria algorithm for the problem of finding a k-dimensional subspace that minimizes the Lp-error for given points, i.e., p-th root of the sum of p-th

Amit Deshpande, Kasturi R. Varadarajan

Real-time Traffic

Algorithms | Randomized Bi-criteria Algorithm | STOC 2007 |

claim paper

» Distance Approximating Dimension Reduction of Riemannian Manifolds

» Coresets and Sketches for High Dimensional Subspace Approximation Problems

» Element Rearrangement for TensorBased Subspace Learning

» ARMS automatic residueminimization based sampling for multipoint modeling techniques

» Supervised dimensionality reduction using mixture models

» Latent LowRank Representation for Subspace Segmentation and Feature Extraction

» On the Hardness and Smoothed Complexity of QuasiConcave Minimization

» A General Learning Approach to Multisensor Based Control using Statistic Indices

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2007
Where	STOC
Authors	Amit Deshpande, Kasturi R. Varadarajan

Comments (0)

Sciweavers

Sampling-based dimension reduction for subspace approximation

Algorithms | Randomized Bi-criteria Algorithm | STOC 2007 |

Explore & Download

Productivity Tools

Sciweavers