Given a term-document matrix A, with dimension m on n, the decomposition consists of S = a diagonal matrix with the k largest singular values, U = m left singular vectors of length k, one for each document, and V = n right singular vectors of length k, one for each term. The matrix A' = U * S * V^T is the closest rank k approximation of of matrix A [Eckard and Young].
Instances of this class are immutable. @author Adrian Kuhn, 2008-2009
|
|