Comparison of Non-negative Matrix Factorization Methods for Clustering Genomic Data

Non-negative matrix factorization (NMF) is a useful method of data dimensionality reduction and has been widely used in many fields, such as pattern recognition and data mining. Compared with other traditional methods, it has unique advantages. And more and more improved NMF methods have been provided in recent years and all of these methods have merits and demerits when used in different applications. Clustering based on NMF methods is a common way to reflect the properties of methods. While there are no special comparisons of clustering experiments based on NMF methods on genomic data. In this paper, we analyze the characteristics of basic NMF and its classical variant methods. Moreover, we show the clustering results based on the coefficient matrix decomposed by NMF methods on the genomic datasets. We also compare the clustering accuracies and the cost of time of these methods.

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

[2]  Chris H. Q. Ding,et al.  Orthogonal nonnegative matrix t-factorizations for clustering , 2006, KDD '06.

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

[4]  Chris H. Q. Ding,et al.  Convex and Semi-Nonnegative Matrix Factorizations , 2010, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[5]  Alioune Ngom,et al.  Versatile Sparse Matrix Factorization and Its Applications in High-Dimensional Biological Data Analysis , 2013, PRIB.

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

[7]  Stan Z. Li,et al.  Learning spatially localized, parts-based representation , 2001, Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR 2001.

[8]  Dietrich Lehmann,et al.  Nonsmooth nonnegative matrix factorization (nsNMF) , 2006, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[9]  Hyunsoo Kim,et al.  Sparse Non-negative Matrix Factorizations via Alternating Non-negativity-constrained Least Squares , 2006 .

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

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

[12]  Patrik O. Hoyer,et al.  Non-negative Matrix Factorization with Sparseness Constraints , 2004, J. Mach. Learn. Res..

[13]  Chris H. Q. Ding,et al.  Robust nonnegative matrix factorization using L21-norm , 2011, CIKM '11.

[14]  Wenbin Li,et al.  Graph regularized discriminative non-negative matrix factorization for face recognition , 2013, Multimedia Tools and Applications.

[15]  Stan Z. Li,et al.  Learning representative local features for face detection , 2001, Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR 2001.

[16]  Zhigang Luo,et al.  Manifold Regularized Discriminative Nonnegative Matrix Factorization With Fast Gradient Descent , 2011, IEEE Transactions on Image Processing.