Robust blind source separation by beta divergence
Neural Computation
A Generalized Divergence Measure for Nonnegative Matrix Factorization
Neural Computation
Projected Gradient Methods for Nonnegative Matrix Factorization
Neural Computation
Fast Projection-Based Methods for the Least Squares Nonnegative Matrix Approximation Problem
Statistical Analysis and Data Mining
Non-negative matrix factorization with α-divergence
Pattern Recognition Letters
ICASSP '09 Proceedings of the 2009 IEEE International Conference on Acoustics, Speech and Signal Processing
Bayesian inference for nonnegative matrix factorisation models
Computational Intelligence and Neuroscience
Convex and Semi-Nonnegative Matrix Factorizations
IEEE Transactions on Pattern Analysis and Machine Intelligence
Online Learning for Matrix Factorization and Sparse Coding
The Journal of Machine Learning Research
Adaptive harmonic spectral decomposition for multiple pitch estimation
IEEE Transactions on Audio, Speech, and Language Processing
IEEE Transactions on Neural Networks
Csiszár’s divergences for non-negative matrix factorization: family of new algorithms
ICA'06 Proceedings of the 6th international conference on Independent Component Analysis and Blind Signal Separation
Cross Burg entropy maximization and its application to ringing suppression in image reconstruction
IEEE Transactions on Image Processing
On the Convergence of Multiplicative Update Algorithms for Nonnegative Matrix Factorization
IEEE Transactions on Neural Networks
Informed source separation through spectrogram coding and data embedding
Signal Processing
Correntropy-Based document clustering via nonnegative matrix factorization
ICANN'12 Proceedings of the 22nd international conference on Artificial Neural Networks and Machine Learning - Volume Part II
Selecting β-divergence for nonnegative matrix factorization by score matching
ICANN'12 Proceedings of the 22nd international conference on Artificial Neural Networks and Machine Learning - Volume Part II
Digital Signal Processing
| Hi-index | 0.00 |
This letter describes algorithms for nonnegative matrix factorization (NMF) with the β-divergence (β-NMF). The β-divergence is a family of cost functions parameterized by a single shape parameter β that takes the Euclidean distance, the Kullback-Leibler divergence, and the Itakura-Saito divergence as special cases (β = 2, 1, 0 respectively). The proposed algorithms are based on a surrogate auxiliary function (a local majorization of the criterion function). We first describe a majorization-minimization algorithm that leads to multiplicative updates, which differ from standard heuristic multiplicative updates by a β-dependent power exponent. The monotonicity of the heuristic algorithm can, however, be proven for β â聢聢 (0, 1) using the proposed auxiliary function. Then we introduce the concept of the majorization-equalization (ME) algorithm, which produces updates that move along constant level sets of the auxiliary function and lead to larger steps than MM. Simulations on synthetic and real data illustrate the faster convergence of the ME approach. The letter also describes how the proposed algorithms can be adapted to two common variants of NMF: penalized NMF (when a penalty function of the factors is added to the criterion function) and convex NMF (when the dictionary is assumed to belong to a known subspace).