A Novel Data Clustering Method Based on Smooth Non-negative Matrix Factorization

摘要

Non-negative matrix factorization (NMF) is a very popular dimensionality reduction method that has been widely used in computer vision and data clustering. However, NMF does not consider the intrinsic geometric information of a data set and also does not produce smooth and stable solutions. To resolve these problems, we propose a Graph regularized Lp Smooth Non-negative Matrix Factorization (GSNMF) method by incorporating graph regu-larization with Lp smooth constraint. The graph regularization can discover the hidden semantics and simultaneously respect the intrinsic geometric structure information of a data set. The Lp smooth constraint can combine the merits of isotropic (L_2-norm) and anisotropic (L_1-norm) diffusion smoothing, and produce a smooth and more accurate solution to the optimization problem. Experimental results on some data sets demonstrate that the proposed method outperforms related state-of-the-art NMF methods.