An optimization model for collaborative recommendation using a covariance-based regularizer

Abstract

This paper suggests a convex regularized optimization model to produce recommendations, which is adaptable, fast, and scalable—while remaining very competitive to state-of-the-art methods in terms of accuracy. We introduce a regularizer based on the covariance matrix such that the model minimizes two measures ensuring that the recommendations provided to a user are guided by both the preferences of the other users in the system and the known preferences of the user being processed. It is adaptable since (1) it can be viewed from both user and item perspectives (allowing to choose, depending on the task, the formulation with fewer decision variables) and (2) multiple constraints depending on the context (and not only based on the accuracy, but also on the utility of personalized recommendations) can easily be added, as shown in this paper through two examples. Since our regularizer is based on the covariance matrix, this paper also describes how to improve computational and space complexities by using matrix factorization techniques in the optimization model, leading to a fast and scalable model. To illustrate all these concepts, experiments were conducted on four real datasets of different sizes (i.e., FilmTrust, Ciao, MovieLens, and Netflix) and comparisons with state-of-the-art methods are provided, showing that our context-sensitive approach is very competitive in terms of accuracy.