SVD
Singular value decomposition (SVD) complements association analysis by providing another method to identify items that have an affinity for each other. Singular value decomposition of the transaction item matrix reduces the matrix to a manageable number of dimensions, thereby enabling you to group similar transactions and similar items. The partial singular value decomposition in the Association Analysis platform is equivalent to performing principal components analysis (PCA).
Transaction Item Matrix
The transaction item matrix is a matrix for which each row corresponds to a transaction each column corresponds to an item. The entries of the matrix are zeros and ones. If an item occurs in a transaction, the corresponding row and column entry is one. Otherwise, the row and column entry is zero. Because the transaction item matrix usually contains more values of zero than one, it is called a sparse matrix.
Singular Value Decomposition
The partial singular value decomposition approximates the transaction item matrix using three matrices: U, S, and V‘. The relationship between these matrices is defined as follows:
Transaction Item Matrix U * S * V‘
Define nTransactions as the number of transactions (rows) in the transaction item matrix, and nItems as the number of items (columns) in the transaction item matrix, and nVec as the specified number of singular vectors. Note that nVec must be less than or equal to min(nTransactions, nItems). It follows that U is an nTransactions by nVec matrix. S is a diagonal matrix of dimension nVec. The diagonal entries in S are the singular values of the transaction item matrix. V‘ is an nVec by nTransactions matrix. The rows in V‘ are the singular vectors.
The transaction item matrix is centered, scaled, and divided by nTransactions minus 1 before the singular value decomposition is carried out. This analysis is equivalent to a PCA of the correlation matrix of the transaction item matrix.

Help created on 9/19/2017