Difference between revisions of "Matrix factorization"
Jump to navigation
Jump to search
Zeno Gantner (talk | contribs) (Created page with "The approximation of a matrix by several lower-rank matrices is called '''matrix factorization'''. Matrix factorization methods are popular collaborative filtering method...") |
Zeno Gantner (talk | contribs) |
||
| Line 1: | Line 1: | ||
The approximation of a [[matrix]] by several lower-rank matrices is called '''matrix factorization'''. Matrix factorization methods are popular [[collaborative filtering]] methods, often with good [[scalability]] properties and predictive [[accuracy]]. | The approximation of a [[matrix]] by several lower-rank matrices is called '''matrix factorization'''. Matrix factorization methods are popular [[collaborative filtering]] methods, often with good [[scalability]] properties and predictive [[accuracy]]. | ||
| + | |||
| + | == Literature == | ||
| + | * [[Yehuda Koren]], [[Robert Bell]], [[Chris Volinsky]]: ''[http://research.yahoo.com/files/ieeecomputer.pdf Matrix Factorization Techniques for Recommender Systems.]'' IEEE Computer, 2009 | ||
| + | * Rainer Gemulla, Peter Haas, Erik Nijkamp, Yannis Sismanis: ''Large-Scale Matrix Factorization with Distributed Stochastic Gradient Descent'', [[KDD 2011]] | ||
== External links == | == External links == | ||
Revision as of 10:10, 10 August 2011
The approximation of a matrix by several lower-rank matrices is called matrix factorization. Matrix factorization methods are popular collaborative filtering methods, often with good scalability properties and predictive accuracy.
Literature
- Yehuda Koren, Robert Bell, Chris Volinsky: Matrix Factorization Techniques for Recommender Systems. IEEE Computer, 2009
- Rainer Gemulla, Peter Haas, Erik Nijkamp, Yannis Sismanis: Large-Scale Matrix Factorization with Distributed Stochastic Gradient Descent, KDD 2011
