Convex programs with an additional reverse convex constraint
Journal of Optimization Theory and Applications
Primal-relaxed dual global optimization approach
Journal of Optimization Theory and Applications
Neural Computation
Coding Facial Expressions with Gabor Wavelets
FG '98 Proceedings of the 3rd. International Conference on Face & Gesture Recognition
Document clustering based on non-negative matrix factorization
Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval
ICPR '04 Proceedings of the Pattern Recognition, 17th International Conference on (ICPR'04) Volume 1 - Volume 01
CVPRW '04 Proceedings of the 2004 Conference on Computer Vision and Pattern Recognition Workshop (CVPRW'04) Volume 12 - Volume 12
Non-negative Matrix Factorization with Sparseness Constraints
The Journal of Machine Learning Research
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
Reverse-Convex programming for sparse image codes
EMMCVPR'05 Proceedings of the 5th international conference on Energy Minimization Methods in Computer Vision and Pattern Recognition
The Interplay of Optimization and Machine Learning Research
The Journal of Machine Learning Research
Data Clustering with Semi-binary Nonnegative Matrix Factorization
ICAISC '08 Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing
Using underapproximations for sparse nonnegative matrix factorization
Pattern Recognition
Robust automatic data decomposition using a modified sparse NMF
MIRAGE'07 Proceedings of the 3rd international conference on Computer vision/computer graphics collaboration techniques
Supervised input space scaling for non-negative matrix factorization
Signal Processing
Efficient Nonnegative Matrix Factorization via projected Newton method
Pattern Recognition
ISNN'12 Proceedings of the 9th international conference on Advances in Neural Networks - Volume Part II
Learning stateful models for network honeypots
Proceedings of the 5th ACM workshop on Security and artificial intelligence
Exploiting sparse representations for robust analysis of noisy complex video scenes
ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part VI
Group sparse topical coding: from code to topic
Proceedings of the sixth ACM international conference on Web search and data mining
Sparse activity and sparse connectivity in supervised learning
The Journal of Machine Learning Research
Sparse representation for robust abnormality detection in crowded scenes
Pattern Recognition
Hi-index | 0.00 |
We exploit the biconvex nature of the Euclidean non-negative matrix factorization (NMF) optimization problem to derive optimization schemes based on sequential quadratic and second order cone programming. We show that for ordinary NMF, our approach performs as well as existing state-of-the-art algorithms, while for sparsity-constrained NMF, as recently proposed by P. O. Hoyer in JMLR 5 (2004), it outperforms previous methods. In addition, we show how to extend NMF learning within the same optimization framework in order to make use of class membership information in supervised learning problems.