A Generalized Divergence Measure for Nonnegative Matrix Factorization
Neural Computation
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
Extended SMART algorithms for non-negative matrix factorization
ICAISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Soft Computing
Relational co-clustering via manifold ensemble learning
Proceedings of the 21st ACM international conference on Information and knowledge management
Hi-index | 0.00 |
Objective: Nonnegative matrix factorization (NMF) has been proven to be a powerful clustering method. Recently Cichocki and coauthors have proposed a family of new algorithms based on the @a-divergence for NMF. However, it is an open problem to choose an optimal @a. Methods and materials: In this paper, we tested such NMF variant with different @a values on clustering cancer gene expression data for optimal @a selection experimentally with 11 datasets. Results and conclusion: Our experimental results show that @a=1 and 2 are two special optimal cases for real applications.