Cancer class discovery using non-negative matrix factorization based on alternating non-negativity-constrained least squares

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

Abstract

Many bioinformatics problems deal with chemical concentrations that should be non-negative. Non-negative matrix factorization (NMF) is an approach to take advantage of non-negativity in data. We have recently developed sparse NMF algorithms via alternating nonnegativity-constrained least squares in order to obtain sparser basis vectors or sparser mixing coefficients for each sample, which lead to easier interpretation. However, the additional sparsity constraints are not always required. In this paper, we conduct cancer class discovery using NMF based on alternating non-negativity-constrained least squares (NMF/ANLS) without any additional sparsity constraints after introducing a rigorous convergence criterion for biological data analysis. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Kim, H., & Park, H. (2007). Cancer class discovery using non-negative matrix factorization based on alternating non-negativity-constrained least squares. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4463 LNBI, pp. 477–487). Springer Verlag. https://doi.org/10.1007/978-3-540-72031-7_43

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