Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Lee, D.D., Seung, H.S.: Algorithms for non-negative matrix factorization. In: Advances in Neural Information Processing Systems, pp. 556–562 (2001)
Cai, D., He, X., Han, J., Huang, T.S.: Graph regularized nonnegative matrix factorization for data representation. IEEE Trans. Pattern Anal. Mach. Intell. 33(8), 1548–1560 (2011)
Chung, F.R.: Spectral graph theory (CBMS regional conference series in mathematics). Am. Math. Soc., vol. 92 (1997)
Belkin, M., Niyogi, P.: Laplacian Eigenmaps and spectral techniques for embedding and clustering. NIPS 14, 585–591 (2001)
Guan, N., Tao, D., Luo, Z., Yuan, B.: Manifold regularized discriminative nonnegative matrix factorization with fast gradient descent. IEEE Trans. Image Process. 20(7), 2030–2048 (2011)
Long, X., Lu, H., Peng, Y., Li, W.: Graph regularized discriminative non-negative matrix factorization for face recognition. Multimedia Tools Appl. 72(3), 2679–2699 (2014)
Kong, D., Ding, C., Huang, H.: Robust nonnegative matrix factorization using l21-norm. In: Proceedings of the 20th ACM International Conference on Information and Knowledge Management, pp. 673–682 (2011)
Hoyer, P.O.: Non-negative matrix factorization with sparseness constraints. J. Mach. Learn. Res. 5, 1457–1469 (2004)
Li, Y., Ngom, A.: Versatile sparse matrix factorization and its applications in high-dimensional biological data analysis. In: Ngom, A., Formenti, E., Hao, J.-K., Zhao, X.-M., van Laarhoven, T. (eds.) PRIB 2013. LNCS, vol. 7986, pp. 91–101. Springer, Heidelberg (2013)
Lee, D.D., Seung, H.S.: Learning the parts of objects by non-negative matrix factorization. Nature 401(6755), 788–791 (1999)
Ding, C., Li, T., Jordan, M.: Convex and semi-nonnegative matrix factorizations. IEEE Trans. Pattern Anal. Mach. Intell. 32(1), 45–55 (2010)
Kim, H., Park, H.: Sparse non-negative matrix factorizations via alternating non-negativity-constrained least squares for microarray data analysis. Bioinformatics 23(12), 1495–1502 (2007)
Ding, C., Li, T., Peng, W., Park, H.: Orthogonal nonnegative matrix t-factorizations for clustering. In: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 126–135 (2006)
Li, S.Z., Hou, X.W., Zhang, H., Cheng, Q.: Learning spatially localized, parts-based representation. In: Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, CVPR 2001, vol. 201, no. 1, pp. I-207–I-212 (2001)
Chen, X., Gu, L., Li, S.Z., Zhang, H.-J.: Learning representative local features for face detection. In: Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, CVPR 2001, vol. 1121, no. 1, pp. I-1126–I-1131 (2001)
Pascual-Montano, A., Carazo, J.M., Kochi, K., Lehmann, D., Pascual-Marqui, R.D.: Nonsmooth nonnegative matrix factorization (nsNMF). IEEE Trans. Pattern Anal. Mach. Intell. 28(3), 403–415 (2006)
Xu, W., Liu, X., Gong, Y.: Document clustering based on non-negative matrix factorization. In: Proceedings of the 26th Annual International ACM SIGIR Conference on Research and Development in Informaion Retrieval, pp. 267–273 (2003)
Acknowledgment
This work was supported in part by the NSFC under grant Nos. 61572284, 61502272, 61572283 and 61272339; the Shandong Provincial Natural Science Foundation, under grant Nos. BS2014DX004 and BS2014DX005; Shenzhen Municipal Science and Technology Innovation Council (No. JCYJ20140417172417174); the Project of Shandong Province Higher Educational Science and Technology Program (No. J13LN31).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Hou, MX., Gao, YL., Liu, JX., Shang, JL., Zheng, CH. (2016). Comparison of Non-negative Matrix Factorization Methods for Clustering Genomic Data. In: Huang, DS., Jo, KH. (eds) Intelligent Computing Theories and Application. ICIC 2016. Lecture Notes in Computer Science(), vol 9772. Springer, Cham. https://doi.org/10.1007/978-3-319-42294-7_25
Download citation
DOI: https://doi.org/10.1007/978-3-319-42294-7_25
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-42293-0
Online ISBN: 978-3-319-42294-7
eBook Packages: Computer ScienceComputer Science (R0)