Cargando…

Scalable non-negative matrix tri-factorization

BACKGROUND: Matrix factorization is a well established pattern discovery tool that has seen numerous applications in biomedical data analytics, such as gene expression co-clustering, patient stratification, and gene-disease association mining. Matrix factorization learns a latent data model that tak...

Descripción completa

Detalles Bibliográficos
Autores principales: Čopar, Andrej, žitnik, Marinka, Zupan, Blaž
Formato: Online Artículo Texto
Lenguaje:English
Publicado: BioMed Central 2017
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5746986/
https://www.ncbi.nlm.nih.gov/pubmed/29299064
http://dx.doi.org/10.1186/s13040-017-0160-6
_version_ 1783289208127881216
author Čopar, Andrej
žitnik, Marinka
Zupan, Blaž
author_facet Čopar, Andrej
žitnik, Marinka
Zupan, Blaž
author_sort Čopar, Andrej
collection PubMed
description BACKGROUND: Matrix factorization is a well established pattern discovery tool that has seen numerous applications in biomedical data analytics, such as gene expression co-clustering, patient stratification, and gene-disease association mining. Matrix factorization learns a latent data model that takes a data matrix and transforms it into a latent feature space enabling generalization, noise removal and feature discovery. However, factorization algorithms are numerically intensive, and hence there is a pressing challenge to scale current algorithms to work with large datasets. Our focus in this paper is matrix tri-factorization, a popular method that is not limited by the assumption of standard matrix factorization about data residing in one latent space. Matrix tri-factorization solves this by inferring a separate latent space for each dimension in a data matrix, and a latent mapping of interactions between the inferred spaces, making the approach particularly suitable for biomedical data mining. RESULTS: We developed a block-wise approach for latent factor learning in matrix tri-factorization. The approach partitions a data matrix into disjoint submatrices that are treated independently and fed into a parallel factorization system. An appealing property of the proposed approach is its mathematical equivalence with serial matrix tri-factorization. In a study on large biomedical datasets we show that our approach scales well on multi-processor and multi-GPU architectures. On a four-GPU system we demonstrate that our approach can be more than 100-times faster than its single-processor counterpart. CONCLUSIONS: A general approach for scaling non-negative matrix tri-factorization is proposed. The approach is especially useful parallel matrix factorization implemented in a multi-GPU environment. We expect the new approach will be useful in emerging procedures for latent factor analysis, notably for data integration, where many large data matrices need to be collectively factorized. ELECTRONIC SUPPLEMENTARY MATERIAL: The online version of this article (doi:10.1186/s13040-017-0160-6) contains supplementary material, which is available to authorized users.
format Online
Article
Text
id pubmed-5746986
institution National Center for Biotechnology Information
language English
publishDate 2017
publisher BioMed Central
record_format MEDLINE/PubMed
spelling pubmed-57469862018-01-03 Scalable non-negative matrix tri-factorization Čopar, Andrej žitnik, Marinka Zupan, Blaž BioData Min Research BACKGROUND: Matrix factorization is a well established pattern discovery tool that has seen numerous applications in biomedical data analytics, such as gene expression co-clustering, patient stratification, and gene-disease association mining. Matrix factorization learns a latent data model that takes a data matrix and transforms it into a latent feature space enabling generalization, noise removal and feature discovery. However, factorization algorithms are numerically intensive, and hence there is a pressing challenge to scale current algorithms to work with large datasets. Our focus in this paper is matrix tri-factorization, a popular method that is not limited by the assumption of standard matrix factorization about data residing in one latent space. Matrix tri-factorization solves this by inferring a separate latent space for each dimension in a data matrix, and a latent mapping of interactions between the inferred spaces, making the approach particularly suitable for biomedical data mining. RESULTS: We developed a block-wise approach for latent factor learning in matrix tri-factorization. The approach partitions a data matrix into disjoint submatrices that are treated independently and fed into a parallel factorization system. An appealing property of the proposed approach is its mathematical equivalence with serial matrix tri-factorization. In a study on large biomedical datasets we show that our approach scales well on multi-processor and multi-GPU architectures. On a four-GPU system we demonstrate that our approach can be more than 100-times faster than its single-processor counterpart. CONCLUSIONS: A general approach for scaling non-negative matrix tri-factorization is proposed. The approach is especially useful parallel matrix factorization implemented in a multi-GPU environment. We expect the new approach will be useful in emerging procedures for latent factor analysis, notably for data integration, where many large data matrices need to be collectively factorized. ELECTRONIC SUPPLEMENTARY MATERIAL: The online version of this article (doi:10.1186/s13040-017-0160-6) contains supplementary material, which is available to authorized users. BioMed Central 2017-12-29 /pmc/articles/PMC5746986/ /pubmed/29299064 http://dx.doi.org/10.1186/s13040-017-0160-6 Text en © The Author(s) 2017 Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. The Creative Commons Public Domain Dedication waiver (http://creativecommons.org/publicdomain/zero/1.0/) applies to the data made available in this article, unless otherwise stated.
spellingShingle Research
Čopar, Andrej
žitnik, Marinka
Zupan, Blaž
Scalable non-negative matrix tri-factorization
title Scalable non-negative matrix tri-factorization
title_full Scalable non-negative matrix tri-factorization
title_fullStr Scalable non-negative matrix tri-factorization
title_full_unstemmed Scalable non-negative matrix tri-factorization
title_short Scalable non-negative matrix tri-factorization
title_sort scalable non-negative matrix tri-factorization
topic Research
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5746986/
https://www.ncbi.nlm.nih.gov/pubmed/29299064
http://dx.doi.org/10.1186/s13040-017-0160-6
work_keys_str_mv AT coparandrej scalablenonnegativematrixtrifactorization
AT zitnikmarinka scalablenonnegativematrixtrifactorization
AT zupanblaz scalablenonnegativematrixtrifactorization