A very fast algorithm for matrix factorization
نویسندگان
چکیده
منابع مشابه
A Very Fast Algorithm for Matrix Factorization
We present a very fast algorithm for general matrix factorization of a data matrix for use in the statistical analysis of high-dimensional data via latent factors. Such data are prevalent across many application areas and generate an ever-increasing demand for methods of dimension reduction in order to undertake the statistical analysis of interest. Our algorithm uses a gradient-based approachw...
متن کاملA fast algorithm for general matrix factorization
Matrix factorization algorithms are emerging as popular tools in many applications, especially dictionary learning method for recovering biomedical image data from noisy and ill-conditioned measurements. We introduce a novel dictionary learning algorithm based on augmented Lagrangian (AL) approach to learn dictionaries from exemplar data and it can be extended to general matrix factorization pr...
متن کاملA Fast Distributed Stochastic Gradient Descent Algorithm for Matrix Factorization
The accuracy and effectiveness of matrix factorization technique were well demonstrated in the Netflix movie recommendation contest. Among the numerous solutions for matrix factorization, Stochastic Gradient Descent (SGD) is one of the most widely used algorithms. However, as a sequential approach, SGD algorithm cannot directly be used in the Distributed Cluster Environment (DCE). In this paper...
متن کاملInformation Hided Jacket Matrix and Its Fast Factorization Algorithm
*1 Jia Hou, 2 Moon Ho Lee *1 School of Electronics & Information, Soochow University, China 2 Institute of Information & Communication, Chonbuk National University, Korea [email protected], [email protected] doi: 10.4156/jcit.vol5.issue6.16 Abstract In this paper, we introduce a type of fast information hided Jacket transform based on factorization algorithm. The resulted matrix shows that ...
متن کاملSimplicial Nonnegative Matrix Tri-factorization: Fast Guaranteed Parallel Algorithm
Nonnegative matrix factorization (NMF) is a linear powerful dimension reduction and has various important applications. However, existing models remain the limitations in the terms of interpretability, guaranteed convergence, computational complexity, and sparse representation. In this paper, we propose to add simplicial constraints to the classical NMF model and to reformulate it into a new mo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Statistics & Probability Letters
سال: 2011
ISSN: 0167-7152
DOI: 10.1016/j.spl.2011.02.001