Symmetric Nonnegative Matrix Factorization: Algorithms and Applications to Probabilistic Clustering

Authors:
Zhaoshui He;Shengli Xie;Rafal Zdunek;Guoxu Zhou;Andrzej Cichocki
Affiliations:
Faculty of Automation, Guangdong University of Technology, Guangzhou, China;Faculty of Automation, Guangdong University of Technology, Guangzhou, China;Institute of Telecommunications, Teleinformatics, and Acoustics, Wroclaw University of Technology, Wroclaw, Poland;Laboratory for Advanced Brain Signal Processing, RIKEN Brain Science Institute, Saitama, Japan;RIKEN Brain Science Institute, Saitama, Japan
Venue:
IEEE Transactions on Neural Networks - Part 1
Year:
2011

Citing 0
Cited 1

An efficient hybrid spectrum access algorithm in OFDM-based wideband cognitive radio networks

Neurocomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Nonnegative matrix factorization (NMF) is an unsupervised learning method useful in various applications including image processing and semantic analysis of documents. This paper focuses on symmetric NMF (SNMF), which is a special case of NMF decomposition. Three parallel multiplicative update algorithms using level 3 basic linear algebra subprograms directly are developed for this problem. First, by minimizing the Euclidean distance, a multiplicative update algorithm is proposed, and its convergence under mild conditions is proved. Based on it, we further propose another two fast parallel methods: $\alpha$-SNMF and $\beta$ -SNMF algorithms. All of them are easy to implement. These algorithms are applied to probabilistic clustering. We demonstrate their effectiveness for facial image clustering, document categorization, and pattern clustering in gene expression.