1 July 2009 FastNMF: highly efficient monotonic fixed-point nonnegative matrix factorization algorithm with good applicability
Author Affiliations +
Abstract
Nonnegative matrix factorization (NMF) is a recently developed method for dimensionality reduction, feature extraction, and data mining, etc. Currently, no NMF algorithm holds both satisfactory efficiency for applications and enough ease of use. To improve the applicability of NMF, we propose a new monotonic, fixed-point algorithm called FastNMF by implementing least-squares error-based nonnegative factorization essentially according to the basic properties of parabola functions. The minimization problem corresponding to an operation in FastNMF can be analytically solved just by this operation, which is far beyond all existing algorithms' power, and therefore FastNMF holds much higher efficiency, which is validated by a set of experimental results. For the simplicity of design philosophy, FastNMF is still one of the NMF algorithms that are the easiest to use and the most comprehensible. In addition, theoretical analysis and experimental results also show that FastNMF tends to converge to better solutions than the popular multiplicative update-based algorithms as far as approximation accuracy is concerned.
©(2009) Society of Photo-Optical Instrumentation Engineers (SPIE)
Le Li and Yu-Jin Zhang "FastNMF: highly efficient monotonic fixed-point nonnegative matrix factorization algorithm with good applicability," Journal of Electronic Imaging 18(3), 033004 (1 July 2009). https://doi.org/10.1117/1.3184771
Published: 1 July 2009
Lens.org Logo
CITATIONS
Cited by 27 scholarly publications and 1 patent.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Algorithms

Image processing

Algorithm development

Expectation maximization algorithms

Databases

Chemical elements

Data mining

Back to Top