Affiliation:
1. ContentWise, Milano, Italy
2. Politecnico di Milano, Milano, Italy
3. AAU Klagenfurt, Klagenfurt am Wörthersee, Austria
Abstract
Recommender systems are one of the most successful applications of data mining and machine-learning technology in practice. Academic research in the field is historically often based on the matrix completion problem formulation, where for each user-item-pair only one interaction (e.g., a rating) is considered. In many application domains, however, multiple user-item interactions of different types can be recorded over time. And, a number of recent works have shown that this information can be used to build richer individual user models and to discover additional behavioral patterns that can be leveraged in the recommendation process.
In this work, we review existing works that consider information from such sequentially ordered user-item interaction logs in the recommendation process. Based on this review, we propose a categorization of the corresponding recommendation tasks and goals, summarize existing algorithmic solutions, discuss methodological approaches when benchmarking what we call
sequence-aware recommender systems
, and outline open challenges in the area.
Publisher
Association for Computing Machinery (ACM)
Subject
General Computer Science,Theoretical Computer Science
Reference126 articles.
1. Retrieved January 2018 from https://www.kaggle.com/retailrocket/ecommerce-dataset. Retrieved January 2018 from https://www.kaggle.com/retailrocket/ecommerce-dataset.
2. Retrieved January 2018 from https://www.kaggle.com/c/outbrain-click-prediction/data. Retrieved January 2018 from https://www.kaggle.com/c/outbrain-click-prediction/data.
3. Toward the next generation of recommender systems: a survey of the state-of-the-art and possible extensions
4. Rakesh Agrawal and Ramakrishnan Srikant. 1994. Fast algorithms for mining association rules in large databases. In VLDB’94. 487--499. Rakesh Agrawal and Ramakrishnan Srikant. 1994. Fast algorithms for mining association rules in large databases. In VLDB’94. 487--499.
Cited by
275 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献