A recommendation algorithm using positive and negative latent models

This paper proposes an algorithm for recommender systems that uses both positive and negative latent user models. In recommending items to a user, recommender systems usually exploit item content information as well as the preferences of similar users. Various types of content information can be attached to items and these are useful for judging user preferences. For example, in movie recommendations, a movie record may include the director, the actors, and reviews. These types of information help systems calculate sophisticated user preferences. We first propose a probabilistic model that maps multi-attributed records into a low-dimensional feature space. The proposed model extends latent Dirichlet allocation to the handling of multi-attributed data. We derive an algorithm for estimating the model´s parameters using the Gibbs sampling technique. Next, we propose a probabilistic model to calculate user preferences for items in the feature space. Finally, we develop a recommendation algorithm based on the probabilistic model that works efficiently for large quantities of items and user ratings. We use a publicly available movie corpus to evaluate the proposed algorithm empirically, in terms of both its recommendation accuracy and its processing efficiency.