Matrix factorization for collaborative filtering is just solving an adjoint latent dirichlet allocation model after all

7Citations
Citations of this article
22Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Matrix factorization-based methods are among the most popular methods for collaborative filtering tasks with implicit feedback. The most effective of these methods do not apply sign constraints, such as non-negativity, to their factors. Despite their simplicity, the latent factors for users and items lack interpretability, which is becoming an increasingly important requirement. In this work, we provide a theoretical link between unconstrained and the interpretable non-negative matrix factorization in terms of the personalized ranking induced by these methods. We also introduce a novel, latent Dirichlet allocation-inspired model for recommenders and extend our theoretical link to also allow the interpretation of an unconstrained matrix factorization as an adjoint formulation of our new model. Our experiments indicate that this novel approach represents the unknown processes of implicit user-item interactions in the real world much better than unconstrained matrix factorization while being interpretable.

Cite

CITATION STYLE

APA

Wilhelm, F. (2021). Matrix factorization for collaborative filtering is just solving an adjoint latent dirichlet allocation model after all. In RecSys 2021 - 15th ACM Conference on Recommender Systems (pp. 55–62). Association for Computing Machinery, Inc. https://doi.org/10.1145/3460231.3474266

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free