Singular value decomposition in additive, multiplicative, and logistic forms

  • Authors:
  • Stan Lipovetsky;W. Michael Conklin

  • Affiliations:
  • GfK Custom Research Inc., 8401 Golden Valley Road, PO Box 27900, Minneapolis, MN 55427-0900, USA;GfK Custom Research Inc., 8401 Golden Valley Road, PO Box 27900, Minneapolis, MN 55427-0900, USA

  • Venue:
  • Pattern Recognition
  • Year:
  • 2005

Quantified Score

Hi-index 0.01

Visualization

Abstract

Singular value decomposition (SVD) is widely used in data processing, reduction, and visualization. Applied to a positive matrix, the regular additive SVD by the first several dual vectors can yield irrelevant negative elements of the approximated matrix. We consider a multiplicative SVD modification that corresponds to minimizing the relative errors and produces always positive matrices at any approximation step. Another logistic SVD modification can be used for decomposition of the matrices of proportions, when a regular SVD can yield the elements beyond the zero-one range, while the modified SVD decomposition produces all the elements within the correct range at any step of approximation. Several additional modifications of matrix approximation are also considered.