Low-rank approximations with sparse factors I: Basic algorithms and error analysis

SIAM Journal on Matrix Analysis and Applications

Volumn 23, Issue 3, 2002, Pages 706-727

  Zhang, Zhenyue ^a   Zha, Hongyuan ^a   Simon, Horst ^a  

^a ZHEJIANG UNIVERSITY   (China)

Author keywords

Low rank matrix approximation; Perturbation analysis; Singular value decomposition; Sparse factorization

Indexed keywords

EID: 0036018630     PISSN: 08954798     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895479899359631     Document Type: Article

References (17)

1. Using linear algebra for intelligent information retrieval
2. On the optimality of the backward greedy algorithm for the subset selection problem
3. Latent class analysis of two-way contingency tables by Bayesian methods
4. Probabilistic latent semantic indexing
5. A semidiscrete matrix decomposition for latent semantic indexing in information retrieval
6. Learning the parts of objects by non-negative matrix factorization
7. Sparse approximate solutions to linear systems
8. Digital image compression by outer product expansion
9. Low rank approximation of a Hankel matrix by structured total least norm
10. Low-rank matrix approximation using the Lanczos bidiagonalization process with applications
11. Four algorithms for the efficient computation of truncated pivoted QR approximation to a sparse matrix
12. Matrices with low-rank-plus-shift structure: Partial SVD and latent semantic indexing