On the stochastic gradient descent matrix factorization in application to the supervised classification of microarrays

• Main Author: Vladimir Nikolaevich Nikulin
• Format: Article
• Language: Russian
• Published: Institute of Computer Science 2013-04-01
• Series: Компьютерные исследования и моделирование
• Subjects: matrix factorization; unsupervised learning; number of factors; nonnegativity; bioinformatics; leaveone-out; classification
• Online Access: http://crm.ics.org.ru/uploads/crmissues/crm_2013_2/13202.pdf

Microarray datasets are highly dimensional, with a small number of collected samples in comparison to thousands of features. This poses a significant challenge that affects the interpretation, applicability and validation of the analytical results. Matrix factorizations have proven to be a useful method for describing data in terms of a small number of meta-features, which reduces noise, while still capturing the essential features of the data. Three novel and mutually relevant methods are presented in this paper: 1) gradient-based matrix factorization with two adaptive learning rates (in accordance with the number of factor matrices) and their automatic updates; 2) nonparametric criterion for the selection of the number of factors; and 3) nonnegative version of the gradient-based matrix factorization which doesn't require any extra computational costs in difference to the existing methods. We demonstrate effectiveness of the proposed methods to the supervised classification of gene expression data.