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 regularization 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 (L2-norm) and anisotropic (L1-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.

[1]  Jing Liu,et al.  Structure preserving non-negative matrix factorization for dimensionality reduction , 2013, Comput. Vis. Image Underst..

[2]  Jane You,et al.  Image clustering by hyper-graph regularized non-negative matrix factorization , 2014, Neurocomputing.

[3]  H. Sebastian Seung,et al.  Algorithms for Non-negative Matrix Factorization , 2000, NIPS.

[4]  H. Sebastian Seung,et al.  Learning the parts of objects by non-negative matrix factorization , 1999, Nature.

[5]  Yu-Jin Zhang,et al.  Nonnegative Matrix Factorization: A Comprehensive Review , 2013, IEEE Transactions on Knowledge and Data Engineering.

[6]  S T Roweis,et al.  Nonlinear dimensionality reduction by locally linear embedding. , 2000, Science.

[7]  Amir Najafi,et al.  Nonlinear Dimensionality Reduction via Path-Based Isometric Mapping , 2013, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[8]  Xinyu Zhang,et al.  Semi-supervised convex nonnegative matrix factorizations with graph regularized for image representation , 2017, Neurocomputing.

[9]  Fan Chung,et al.  Spectral Graph Theory , 1996 .

[10]  Jiawei Han,et al.  Isometric Projection , 2007, AAAI.

[11]  Mikhail Belkin,et al.  Laplacian Eigenmaps and Spectral Techniques for Embedding and Clustering , 2001, NIPS.

[12]  Yong Wang,et al.  Low-Rank Matrix Factorization With Adaptive Graph Regularizer , 2016, IEEE Transactions on Image Processing.

[13]  Jiawei Han,et al.  Document clustering using locality preserving indexing , 2005, IEEE Transactions on Knowledge and Data Engineering.

[14]  Jun Huang,et al.  Hyperspectral image denoising with superpixel segmentation and low-rank representation , 2017, Inf. Sci..

[15]  Dongdong Yu,et al.  Adaptive total-variation for non-negative matrix factorization on manifold , 2017, Pattern Recognit. Lett..

[16]  Xin Liu,et al.  Document clustering based on non-negative matrix factorization , 2003, SIGIR.

[17]  J. Tenenbaum,et al.  A global geometric framework for nonlinear dimensionality reduction. , 2000, Science.

[18]  Liangpei Zhang,et al.  Sparsity-Regularized Robust Non-Negative Matrix Factorization for Hyperspectral Unmixing , 2016, IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing.

[19]  Thomas S. Huang,et al.  Graph Regularized Nonnegative Matrix Factorization for Data Representation. , 2011, IEEE transactions on pattern analysis and machine intelligence.

[20]  Xuelong Li,et al.  Constrained Nonnegative Matrix Factorization for Image Representation , 2012, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[21]  Xinbo Gao,et al.  Semi-Supervised Nonnegative Matrix Factorization via Constraint Propagation , 2016, IEEE Transactions on Cybernetics.

[22]  Fei Wang,et al.  Graph dual regularization non-negative matrix factorization for co-clustering , 2012, Pattern Recognit..