资源分类
》 资源 》论文》Scalable Methods for Nonnegative Matrix Factorizations of Near-separable Tall-and-skinny Matrices

Scalable Methods for Nonnegative Matrix Factorizations of Near-separable Tall-and-skinny Matrices

2020-01-19 | |  55 |   32 |   0

Abstract

Numerous algorithms are used for nonnegative matrix factorization under the assumption that the matrix is nearly separable. In this paper, we show how to make these algorithms scalable for data matrices that have many more rows than columns, so-called “tall-and-skinny matrices.” One key component to these improved methods is an orthogonal matrix transformation that preserves the separability of the NMF problem. Our final methods need to read the data matrix only once and are suitable for streaming, multi-core, and MapReduce architectures. We demonstrate the efficacy of these algorithms on terabyte-sized matrices from scientific computing and bioinformatics.

上一篇：Inferring synaptic conductances from spike trains under a biophysically inspired point process model

下一篇：Incremental Clustering: The Case for Extra Clusters

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...