Abstract—Due to the popularity of nonnegative matrix factorization and the increasing availability of massive data sets, researchers are facing the problem of factorizing large-scale matrices of dimensions in the orders of millions. Recent research [11] has shown that it is feasible to factorize a million-by-million matrix with billions of nonzero elements on a MapReduce cluster. In this work, we present three different matrix multiplication implementations and scale up three types of nonnegative matrix factorizations on MapReduce. Experiments on both synthetic and real-world datasets show the excellent scalability of our proposed algorithms
Matrix factorization methods are among the most common techniques for detecting latent components in...
This work introduces Divide-Factor-Combine (DFC), a parallel divide-and-conquer framework for noisy ...
Nonnegative matrix factorization (NMF) decomposes a high-dimensional nonnegative matrix into the pro...
The Web abounds with dyadic data that keeps increasing by every single second. Previous work has rep...
As massive data sets become increasingly available, people are facing the problem of how to effectiv...
Numerous algorithms are used for nonnegative matrix factorization under the as-sumption that the mat...
A robust algorithm for non-negative matrix factorization (NMF) is presented in this paper with the p...
The efficient, distributed factorization of large matrices on clusters of commodity machines is cruc...
Low rank matrix factorization is an important step in many high dimensional machine learning algorit...
AbstractIn the past decades, advances in high-throughput technologies have led to the generation of ...
This dissertation shows that nonnegative matrix factorization (NMF) can be extended to a general and...
Non-negative matrix factorization (NMF) has become a standard tool in data mining, information retri...
Since data sizes of analytical applications are continuously growing, many data scientists are switc...
As Web 2.0 and enterprise-cloud applications have proliferated, data mining algorithms increasingly ...
International audienceWe present a matrix-factorization algorithm that scales to input matrices with...
Matrix factorization methods are among the most common techniques for detecting latent components in...
This work introduces Divide-Factor-Combine (DFC), a parallel divide-and-conquer framework for noisy ...
Nonnegative matrix factorization (NMF) decomposes a high-dimensional nonnegative matrix into the pro...
The Web abounds with dyadic data that keeps increasing by every single second. Previous work has rep...
As massive data sets become increasingly available, people are facing the problem of how to effectiv...
Numerous algorithms are used for nonnegative matrix factorization under the as-sumption that the mat...
A robust algorithm for non-negative matrix factorization (NMF) is presented in this paper with the p...
The efficient, distributed factorization of large matrices on clusters of commodity machines is cruc...
Low rank matrix factorization is an important step in many high dimensional machine learning algorit...
AbstractIn the past decades, advances in high-throughput technologies have led to the generation of ...
This dissertation shows that nonnegative matrix factorization (NMF) can be extended to a general and...
Non-negative matrix factorization (NMF) has become a standard tool in data mining, information retri...
Since data sizes of analytical applications are continuously growing, many data scientists are switc...
As Web 2.0 and enterprise-cloud applications have proliferated, data mining algorithms increasingly ...
International audienceWe present a matrix-factorization algorithm that scales to input matrices with...
Matrix factorization methods are among the most common techniques for detecting latent components in...
This work introduces Divide-Factor-Combine (DFC), a parallel divide-and-conquer framework for noisy ...
Nonnegative matrix factorization (NMF) decomposes a high-dimensional nonnegative matrix into the pro...