Matrix Factorization: Difference between revisions
Jump to navigation
Jump to search
(Created page with "{{DISPLAYTITLE:Matrix Factorization (Collaborative Filtering)}} == Description == Collaborative filtering is a technique used in recommendation systems. It analyzes relationships between users and interdependencies among products to identify new user-item associations. A method of collaborative filtering uses matrix factorization. In its basic form, matrix factorization characterizes both items and users by vectors of factors inferred from item rating patterns. == Pa...") |
No edit summary |
||
| (3 intermediate revisions by the same user not shown) | |||
| Line 8: | Line 8: | ||
== Parameters == | == Parameters == | ||
$n$: dimension of matrix | |||
== Table of Algorithms == | == Table of Algorithms == | ||
| Line 26: | Line 26: | ||
|} | |} | ||
== Time Complexity | == Time Complexity Graph == | ||
[[File:Collaborative Filtering - Matrix Factorization - Time.png|1000px]] | [[File:Collaborative Filtering - Matrix Factorization - Time.png|1000px]] | ||
Latest revision as of 09:10, 28 April 2023
Description
Collaborative filtering is a technique used in recommendation systems. It analyzes relationships between users and interdependencies among products to identify new user-item associations.
A method of collaborative filtering uses matrix factorization. In its basic form, matrix factorization characterizes both items and users by vectors of factors inferred from item rating patterns.
Parameters
$n$: dimension of matrix
Table of Algorithms
| Name | Year | Time | Space | Approximation Factor | Model | Reference |
|---|---|---|---|---|---|---|
| LU Matrix Decomposition | 1945 | $O(n^{3})$ | $O(n^{2})$ | Exact | Deterministic | |
| QR Matrix Decomposition | 1955 | $O(n^{2})$ | $O(n^{2})$ | Exact | Deterministic | |
| Cholesky Decomposition | 1983 | $O(n^{2})$ | $O(n^{2})$ | Exact | Deterministic |
Time Complexity Graph
