Latent Factor Models and Matrix Factorization: Difference between revisions
Jump to navigation
Jump to search
m (Text replacement - "---- __NOTOC__" to "---- __NOTOC__") |
m (Text replacement - ". ----" to ". ----") |
||
Line 1: | Line 1: | ||
<B>See:</B> [[Latent Factor]], [[Matrix Factorization]], [[Latent Factor Model]]. | <B>See:</B> [[Latent Factor]], [[Matrix Factorization]], [[Latent Factor Model]]. | ||
---- | ---- | ||
---- | ---- |
Latest revision as of 18:51, 17 September 2021
See: Latent Factor, Matrix Factorization, Latent Factor Model.
References
2017
- (Sammut & Webb, 2017) ⇒ (2017). "Latent Factor Models and Matrix Factorization". In: (Sammut & Webb, 2017)
- QUOTE: Latent Factor models are a state of the art methodology for model-based collaborative filtering. The basic assumption is that there exist an unknown low-dimensional representation of users and items where user-item affinity can be modeled accurately. For example, the rating that a user gives to a movie might be assumed to depend on few implicit factors such as the user’s taste across various movie genres. Matrix factorization techniques are a class of widely successful Latent Factor models that attempt to find weighted low-rank approximations to the user-item matrix, where weights are used to hold out missing entries. There is a large family of matrix factorization models based on choice of loss function to measure approximation quality, regularization terms to avoid overfitting, and other domain-dependent formulations.