Probabilistic Association Rules for Item-Based Recommender Systems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2008

Probabilistic Association Rules for Item-Based Recommender Systems

Armelle Brun
Anne Boyer


Since the beginning of the 1990's, the Internet has constantly grown, proposing more and more services and sources of information. The challenge is no longer to provide users with data, but to improve the human/computer interactions in information systems by suggesting fair items at the right time. Modeling personal preferences enables recommender systems to identify relevant subsets of items. These systems often rely on filtering techniques based on symbolic or numerical approaches in a stochastic context. In this paper, we focus on item-based collaborative filtering (CF) techniques. We show that it may be difficult to guarantee a good accuracy for the high values of prediction when ratings are not enough shared out on the rating scale. Thus, we propose a new approach combining a classic CF algorithm with an item association model to get better predictions. We deal with this issue by exploiting probalistic skewnesses in triplets of items. We validate our model by using the MovieLens dataset and get a significant improvement as regards the High MAE measure.
Fichier principal
Vignette du fichier
23-CastagnosBrunBoyer-Stairs2008-CameraReady.pdf (99.2 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00329559 , version 1 (12-10-2008)


  • HAL Id : inria-00329559 , version 1


Sylvain Castagnos, Armelle Brun, Anne Boyer. Probabilistic Association Rules for Item-Based Recommender Systems. 4th European Starting AI Researcher Symposium (STAIRS 2008), in conjunction with the 18th European Conference on Artificial Intelligence (ECAI 2008), University of Patras, Jul 2008, Patras, Greece. ⟨inria-00329559⟩
113 View
139 Download


Gmail Facebook X LinkedIn More