Cholesky Decomposition (Matrix Factorization Collaborative Filtering)

From Algorithm Wiki
Revision as of 11:53, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == $O(n^{2})$ words (Computes and stores (intermediate steps of) factorization) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word/Real RAM == Year == 1983 == Reference ==")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(n^{2})$

Space Complexity

$O(n^{2})$ words

(Computes and stores (intermediate steps of) factorization)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word/Real RAM

Year

1983

Reference

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Cholesky_Decomposition_(Matrix_Factorization_Collaborative_Filtering)&oldid=44938"