Document clustering based on non-negative matrix factorization
Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval
Clustering Incomplete Data Using Kernel-Based Fuzzy C-means Algorithm
Neural Processing Letters
Non-negative matrix factorization based methods for object recognition
Pattern Recognition Letters
ICPR '04 Proceedings of the Pattern Recognition, 17th International Conference on (ICPR'04) Volume 1 - Volume 01
Non-negative Matrix Factorization with Sparseness Constraints
The Journal of Machine Learning Research
Representing image matrices: eigenimages versus eigenvectors
ISNN'05 Proceedings of the Second international conference on Advances in neural networks - Volume Part II
Online-updating regularized kernel matrix factorization models for large-scale recommender systems
Proceedings of the 2008 ACM conference on Recommender systems
An efficient nonnegative matrix factorization approach in flexible kernel space
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Nonlinear non-negative component analysis algorithms
IEEE Transactions on Image Processing
Projective nonnegative graph embedding
IEEE Transactions on Image Processing
Nonnegative matrix factorization via generalized product rule and its application for classification
LVA/ICA'12 Proceedings of the 10th international conference on Latent Variable Analysis and Signal Separation
Kernel-Mapping Recommender system algorithms
Information Sciences: an International Journal
Review article: Max-margin Non-negative Matrix Factorization
Image and Vision Computing
Hi-index | 0.00 |
In this paper, we extend the original non-negative matrix factorization (NMF) to kernel NMF (KNMF). The advantages of KNMF over NMF are: 1) it could extract more useful features hidden in the original data through some kernel-induced nonlinear mappings; 2) it can deal with data where only relationships (similarities or dissimilarities) between objects are known; 3) it can process data with negative values by using some specific kernel functions (e.g. Gaussian). Thus, KNMF is more general than NMF. To further improve the performance of KNMF, we also propose the SpKNMF, which performs KNMF on sub-patterns of the original data. The effectiveness of the proposed algorithms is validated by extensive experiments on UCI datasets and the FERET face database.