Application of graph regularized non-negative matrix factorization in characteristic gene selection

1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Nonnegative matrix factorization (NMF) has become a popular method and widely used in many fields, for the reason that NMF algorithm can deal with many high dimension, non-negative problems. However, in real gene expression data applications, we often have to deal with the geometric structure problems. Thus a Graph Regularized version of NMF is needed. In this paper, we propose a Graph Regularized Non-negative Matrix Factorization (GRNMF) with emphasizing graph regularized on error function to extract characteristic gene set. This method considers the samples in low-dimensional manifold which embedded in a high-dimensional ambient space, and reveals the data geometric structure embedded in the original data. Experiment results on tumor datasets and plants gene expression data demonstrate that our GRNMF model can extract more differential genes than other existing state-of-the-art methods.

Cite

CITATION STYLE

APA

Wang, D., Gao, Y. L., Liu, J. X., Yu, J. G., & Wen, C. G. (2015). Application of graph regularized non-negative matrix factorization in characteristic gene selection. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9226, pp. 601–611). Springer Verlag. https://doi.org/10.1007/978-3-319-22186-1_60

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free