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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have