2012/12/12 by Guy Shani, Shani, Guy, Ronen I. Brafman +3 · 101 citations
Computer Science · Mathematics · #Advanced Graph Neural Networks #Artificial Intelligence (cs.AI) #Artificial intelligence #Computer science #Data mining #FOS: Computer and information sciences #Information Retrieval (cs.IR) #Machine Learning (cs.LG) #Machine learning #Markov decision process #Markov process #Mathematics #Predictive value #Process (computing) #Recommender Systems and Techniques #Recommender system #Topic Modeling #cs.AI #cs.IR #cs.LG
paper · pdf · doi:10.48550/arxiv.1301.0600
published in arXiv (Cornell University) 6(43), 1265-1295 (Cornell University) · Appears in Proceedings of the Eighteenth Conference on Uncertainty in Artificial Intelligence (UAI2002)
openalex publication_date 2012/12/12 · arxiv created 2015/05/16 · arxiv updated 2015/05/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/08
Typical Recommender systems adopt a static view of the recommendation process and treat it as a prediction problem. We argue that it is more appropriate to view the problem of generating recommendations as a sequential decision problem and, consequently, that Markov decision processes (MDP) provide a more appropriate model for Recommender systems. MDPs introduce two benefits: they take into account the long-term effects of each recommendation, and they take into account the expected value of each recommendation. To succeed in practice, an MDP-based Recommender system must employ a strong initial model; and the bulk of this paper is concerned with the generation of such a model. In particular, we suggest the use of an n-gram predictive model for generating the initial MDP. Our n-gram model induces a Markov-chain model of user behavior whose predictive accuracy is greater than that of existing predictive models. We describe our predictive model in detail and evaluate its performance on real data. In addition, we show how the model can be used in an MDP-based Recommender system.