ML Anthology

Equivalence of Non-Iterative Algorithms for Simultaneous Low Rank Approximations of Matrices

Kohei Inoue, Kiichi Urahama
CVPR 2006 pp. 154-159
doi:10.1109/CVPR.2006.112 /cvpr/2006/inoue2006cvpr-equivalence/

Abstract

Recently four non-iterative algorithms for simultaneous low rank approximations of matrices (SLRAM) have been presented by several researchers. In this paper, we show that those algorithms are equivalent to each other because they are reduced to the eigenvalue problems of row-row and column-column covariance matrices of given matrices. Also, we show a relationship between the non-iterative algorithms and another algorithm which is claimed to be an analytical algorithm for the SLRAM. Experimental results show that the analytical algorithm does not necessarily give the optimal solution of the SLRAM.

CVPR Semantic Scholar

Cite

Text

Inoue and Urahama. "Equivalence of Non-Iterative Algorithms for Simultaneous Low Rank Approximations of Matrices." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2006. doi:10.1109/CVPR.2006.112

Markdown

[Inoue and Urahama. "Equivalence of Non-Iterative Algorithms for Simultaneous Low Rank Approximations of Matrices." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2006.](https://mlanthology.org/cvpr/2006/inoue2006cvpr-equivalence/) doi:10.1109/CVPR.2006.112

BibTeX

@inproceedings{inoue2006cvpr-equivalence,
  title     = {{Equivalence of Non-Iterative Algorithms for Simultaneous Low Rank Approximations of Matrices}},
  author    = {Inoue, Kohei and Urahama, Kiichi},
  booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
  year      = {2006},
  pages     = {154-159},
  doi       = {10.1109/CVPR.2006.112},
  url       = {https://mlanthology.org/cvpr/2006/inoue2006cvpr-equivalence/}
}