A Random Algorithm for Low-Rank Decomposition of Large-Scale Matrices With Missing Entries

A random submatrix method (RSM) is proposed to calculate the low-rank decomposition U(m×r)V(n×r)(T) (r < m, n) of the matrix Y∈R(m×n) (assuming m > n generally) with known entry percentage 0 < ρ ≤ 1. RSM is very fast as only O(mr(2)ρ(r)) or O(n(3)ρ(3r)) floating-point operations (flops) are...

Description complète

Détails bibliographiques
Publié dans:IEEE transactions on image processing : a publication of the IEEE Signal Processing Society. - 1992. - 24(2015), 11 vom: 24. Nov., Seite 4502-11
Auteur principal: Liu, Yiguang (Auteur)
Autres auteurs: Lei, Yinjie, Li, Chunguang, Xu, Wenzheng, Pu, Yifei
Format: Article en ligne
Langue:English
Publié: 2015
Accès à la collection:IEEE transactions on image processing : a publication of the IEEE Signal Processing Society
Sujets:Journal Article Research Support, Non-U.S. Gov't