Generalized Low Rank Approximations of Matrices
Abstract
We consider the problem of computing low rank approximations of matrices. The novelty of our approach is that the low rank approximations are on a sequenceof matrices. Unlike the problem of low rank approximations of a single matrix, which was well studied in the past, the proposed algorithm in this paper does notadmit a closed form solution in general. We did extensive experiments on face imagedata to evaluate the effectiveness of the proposed algorithm and compare thecomputed low rank approximations with those obtained from traditional Singular Value Decomposition based method.
Cite
Text
Ye. "Generalized Low Rank Approximations of Matrices." International Conference on Machine Learning, 2004. doi:10.1145/1015330.1015347Markdown
[Ye. "Generalized Low Rank Approximations of Matrices." International Conference on Machine Learning, 2004.](https://mlanthology.org/icml/2004/ye2004icml-generalized/) doi:10.1145/1015330.1015347BibTeX
@inproceedings{ye2004icml-generalized,
title = {{Generalized Low Rank Approximations of Matrices}},
author = {Ye, Jieping},
booktitle = {International Conference on Machine Learning},
year = {2004},
doi = {10.1145/1015330.1015347},
url = {https://mlanthology.org/icml/2004/ye2004icml-generalized/}
}