History Dependent Recommender Systems Based on Partial Matching
This paper focuses on the utilization of the history of navigation within recommender systems. It aims at designing a collaborative recommender based on Markov models relying on partial matching in order to ensure high accuracy, coverage, robustness, low complexity while being anytime.
Indeed, contrary to state of the art, this model does not simply match the context of the active user to the context of other users but partial matching is performed: the history of navigation is divided into several sub-histories on which matching is performed, allowing the matching constraints to be weakened. The resulting model leads to an improvement in terms of accuracy compared to state of the art models.
Unable to display preview. Download preview PDF.
- 2.Fu, X., Budzik, J., Hammond, K.: Mining navigation history for recommendation. In: Proc. of the Intelligent User Interfaces Conference, pp. 106–112. ACM Press, New York (2000)Google Scholar
- 3.Deshpande, M., Karypis, G.: Selective markov models for predicting web-page accesses. In: First SIAM International Conference on Data Mining (2001)Google Scholar
- 4.Pitkow, J., Pirolli, P.: Mining longest repeating subsequences to predict world wide web surfing. In: USITS 1999: Proceedings of the 2nd conference on USENIX Symposium on Internet Technologies and Systems (1999)Google Scholar
- 5.Bonnin, G., Brun, A., Boyer, A.: Using skipping for sequence-based collaborative filtering. In: Proceedings of the International Conference on Web Intelligence (2008)Google Scholar
- 6.Bonnin, G., Brun, A., Boyer, A.: A low-order markov model integrating long-distance histories for collaborative recommender systems. In: Proceedings of the ACM International Conference on Intelligent User Interfaces (IUI 2009), Sanibel Islands, USA, pp. 57–66 (February 2009)Google Scholar