Orthogonal Nonnegative Matrix Factorization: Multiplicative Updates on Stiefel Manifolds

  • Authors:
  • Jiho Yoo;Seungjin Choi

  • Affiliations:
  • Department of Computer Science, Pohang University of Science and Technology, Pohang, Korea 790-784;Department of Computer Science, Pohang University of Science and Technology, Pohang, Korea 790-784

  • Venue:
  • IDEAL '08 Proceedings of the 9th International Conference on Intelligent Data Engineering and Automated Learning
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Nonnegative matrix factorization (NMF) is a popular method for multivariate analysis of nonnegative data, the goal of which is decompose a data matrix into a product of two factor matrices with all entries in factor matrices restricted to be nonnegative. NMF was shown to be useful in a task of clustering (especially document clustering). In this paper we present an algorithm for orthogonal nonnegative matrix factorization, where an orthogonality constraint is imposed on the nonnegative decomposition of a term-document matrix. We develop multiplicative updates directly from true gradient on Stiefel manifold, whereas existing algorithms consider additive orthogonality constraints. Experiments on several different document data sets show our orthogonal NMF algorithms perform better in a task of clustering, compared to the standard NMF and an existing orthogonal NMF.