The Impact of Situation Clustering in Contextual-Bandit Algorithm for Context-Aware Recommender Systems

📝 Original Info

• Title: The Impact of Situation Clustering in Contextual-Bandit Algorithm for Context-Aware Recommender Systems
• ArXiv ID: 1304.3845
• Date: 2014-04-01
• Authors: Researchers from original ArXiv paper

📝 Abstract

Most existing approaches in Context-Aware Recommender Systems (CRS) focus on recommending relevant items to users taking into account contextual information, such as time, location, or social aspects. However, few of them have considered the problem of user's content dynamicity. We introduce in this paper an algorithm that tackles the user's content dynamicity by modeling the CRS as a contextual bandit algorithm and by including a situation clustering algorithm to improve the precision of the CRS. Within a deliberately designed offline simulation framework, we conduct evaluations with real online event log data. The experimental results and detailed analysis reveal several important discoveries in context aware recommender system.

💡 Deep Analysis

Deep Dive into The Impact of Situation Clustering in Contextual-Bandit Algorithm for Context-Aware Recommender Systems.

Most existing approaches in Context-Aware Recommender Systems (CRS) focus on recommending relevant items to users taking into account contextual information, such as time, location, or social aspects. However, few of them have considered the problem of user’s content dynamicity. We introduce in this paper an algorithm that tackles the user’s content dynamicity by modeling the CRS as a contextual bandit algorithm and by including a situation clustering algorithm to improve the precision of the CRS. Within a deliberately designed offline simulation framework, we conduct evaluations with real online event log data. The experimental results and detailed analysis reveal several important discoveries in context aware recommender system.

📄 Full Content

Reference