Incorporating contextual information in recommender systems using a multidimensional approach
ACM Transactions on Information Systems (TOIS)
IEEE Transactions on Knowledge and Data Engineering
Google news personalization: scalable online collaborative filtering
Proceedings of the 16th international conference on World Wide Web
IEEE Transactions on Knowledge and Data Engineering
Factorization meets the neighborhood: a multifaceted collaborative filtering model
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
Collaborative Filtering for Implicit Feedback Datasets
ICDM '08 Proceedings of the 2008 Eighth IEEE International Conference on Data Mining
On social networks and collaborative recommendation
Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval
Context-based splitting of item ratings in collaborative filtering
Proceedings of the third ACM conference on Recommender systems
Proceedings of the fourth ACM conference on Recommender systems
Music Recommendation and Discovery: The Long Tail, Long Fail, and Long Play in the Digital Music Space
A generic graph-based multidimensional recommendation framework and its implementations
Proceedings of the 21st international conference companion on World Wide Web
Hi-index | 0.00 |
Realizing context-aware recommender systems (CARS) has been acknowledged as one of the most important topics in the area of recommender systems. CARSs aim to incorporate contextual information in recommendation to achieve better recommendation results. Although existing CARSs deal with multiple dimensions, most of them focus on the problem of predicting users' ratings for one specific recommendation target dimension (e.g. movie) considering fixed contextual dimensions. However, in many real world cases, contextual dimensions and recommendation target dimension can often vary depending on different purposes or needs. In this paper, we show how to transform log data which implies users' preference and contextual information into implicit feedback graph and propose a recommendation method using random walks on the transformed graph. Our method has advantages in that it supports flexibility of varying contextual dimensions and recommendation target dimension without time-consuming learning process. We perform several experiments, and the experimental results show that our method can be actually used for real world cases.