@article {15711,
	title = {Algorithm 805: computation and uses of the semidiscrete matrix decomposition},
	journal = {ACM Trans. Math. Softw.},
	volume = {26},
	year = {2000},
	month = {2000/09//},
	pages = {415 - 435},
	abstract = {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 {\textpm}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.},
	keywords = {compression, latent semantic indexing, Matrix decomposition, semidiscrete decompositin, singular value decomposition},
	isbn = {0098-3500},
	doi = {10.1145/358407.358424},
	url = {http://doi.acm.org/10.1145/358407.358424},
	author = {Kolda,Tamara G. and O{\textquoteright}Leary, Dianne P.}
}
