Comments on "An analytical algorithm for generalized low-rank approximations of matrices"

Authors:
Yafeng Hu;Hairong Lv;Xianda Zhang
Affiliations:
Department of Automation, Tsinghua University, Beijing 100084, China;Department of Automation, Tsinghua University, Beijing 100084, China;Department of Automation, Tsinghua University, Beijing 100084, China
Venue:
Pattern Recognition
Year:
2008

Citing 4
Cited 0

Generalized low rank approximations of matrices

ICML '04 Proceedings of the twenty-first international conference on Machine learning
Non-iterative generalized low rank approximation of matrices

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

CVPR '06 Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1
Rapid and brief communication: An analytical algorithm for generalized low-rank approximations of matrices

Pattern Recognition

Quantified Score

Hi-index	0.01

Visualization

Abstract

Low rank approximations of matrices have been widely used in pattern recognition and machine learning. Based on a sequence of matrices, a generalized low rank approximation problem was presented and an iterative scheme was given by Liang and Shi recently proposed an analytical scheme for this approximation problem. In this paper, we identify the weakness in their scheme and prove that their algorithm is incorrect.