Sciweavers

1203 search results - page 41 / 241
» Probabilistic Matrix Factorization
Sort
View
CORR
2010
Springer
99views Education» more  CORR 2010»
13 years 9 months ago
Efficient Matrix Completion with Gaussian Models
A general framework based on Gaussian models and a MAPEM algorithm is introduced in this paper for solving matrix/table completion problems. The numerical experiments with the sta...
Flavien Léger, Guoshen Yu, Guillermo Sapiro
JSC
2007
80views more  JSC 2007»
13 years 9 months ago
Improved dense multivariate polynomial factorization algorithms
We present new deterministic and probabilistic algorithms that reduce the factorization of dense polynomials from several to one variable. The deterministic algorithm runs in sub-...
Grégoire Lecerf
WWW
2010
ACM
14 years 4 months ago
Factorizing personalized Markov chains for next-basket recommendation
Recommender systems are an important component of many websites. Two of the most popular approaches are based on matrix factorization (MF) and Markov chains (MC). MF methods learn...
Steffen Rendle, Christoph Freudenthaler, Lars Schm...
JAT
2006
73views more  JAT 2006»
13 years 9 months ago
Factorization of multivariate positive Laurent polynomials
Abstract. Recently M. Dritschel proved that any positive multivariate Laurent polynomial can be factorized into a sum of square magnitudes of polynomials. We first give another pro...
Jeffrey S. Geronimo, Ming-Jun Lai
STOC
1995
ACM
135views Algorithms» more  STOC 1995»
14 years 1 months ago
Subquadratic-time factoring of polynomials over finite fields
New probabilistic algorithms are presented for factoring univariate polynomials over finite fields. The algorithms factor a polynomial of
Erich Kaltofen, Victor Shoup