Subspace Sampling and Relative-Error Matrix Approximation: Column-Row-Based Methods

13 years 8 months ago

Download cs-www.cs.yale.edu

Much recent work in the theoretical computer science, linear algebra, and machine learning has considered matrix decompositions of the following form: given an m

Petros Drineas, Michael W. Mahoney, S. Muthukrishn

Real-time Traffic

Algorithms | ESA 2006 | Low-rank Matrix Representation | Matrix | Matrix Decompositions |

claim paper

» RelativeError CUR Matrix Decompositions

» Krylov Subspace Descent for Deep Learning

» Bayesian Overlapping Subspace Clustering

» Efficient methods for topic model inference on streaming document collections

Post Info
More Details (n/a)

Added	22 Aug 2010
Updated	22 Aug 2010
Type	Conference
Year	2006
Where	ESA
Authors	Petros Drineas, Michael W. Mahoney, S. Muthukrishnan

Comments (0)

Sciweavers

Subspace Sampling and Relative-Error Matrix Approximation: Column-Row-Based Methods

Algorithms | ESA 2006 | Low-rank Matrix Representation | Matrix | Matrix Decompositions |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers