%0 Journal Article
%J ACM Trans. Math. Softw.
%D 2000
%T Algorithm 805: computation and uses of the semidiscrete matrix decomposition
%A Kolda,Tamara G.
%A O'Leary, Dianne P.
%K compression
%K latent semantic indexing
%K Matrix decomposition
%K semidiscrete decompositin
%K singular value decomposition
%X We present algorithms for computing a semidiscrete approximation to a matrix in a weighted norm, with the Frobenius norm as a special case. The approximation is formed as a weighted sum of outer products of vectors whose elements are ±1 or 0, so the storage required by the approximation is quite small. We also present a related algorithm for approximation of a tensor. Applications of the algorithms are presented to data compression, filtering, and information retrieval; software is provided in C and in Matlab.
%B ACM Trans. Math. Softw.
%V 26
%P 415 - 435
%8 2000/09//
%@ 0098-3500
%G eng
%U http://doi.acm.org/10.1145/358407.358424
%N 3
%R 10.1145/358407.358424