Fast dimension reduction based on NMF

  • Authors:
  • Pavel Krömer;Jan Platoš;Václav Snášel

  • Affiliations:
  • Department of Computer Science, Faculty of Electrical Engineering and Computer Science, VŠB, Technical University of Ostrava, Ostrava, Poruba, Czech Republic;Department of Computer Science, Faculty of Electrical Engineering and Computer Science, VŠB, Technical University of Ostrava, Ostrava, Poruba, Czech Republic;Department of Computer Science, Faculty of Electrical Engineering and Computer Science, VŠB, Technical University of Ostrava, Ostrava, Poruba, Czech Republic

  • Venue:
  • ISICA'10 Proceedings of the 5th international conference on Advances in computation and intelligence
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Non-negative matrix factorization is an important method in the analysis of high dimensional datasets. It has a number of applications including pattern recognition, data clustering, information retrieval or computer security. One of its significant drawback lies in its computational complexity. In this paper, we discuss a novel method to allow fast approximate transformation from input space to feature space defined by non-negative matrix factorization.