The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.01 - January (2004 vol.16)
pp: 56-69
ABSTRACT
<p><b>Abstract</b>—Memory-based collaborative filtering (CF) has been studied extensively in the literature and has proven to be successful in various types of personalized recommender systems. In this paper, we develop a probabilistic framework for memory-based CF (PMCF). While this framework has clear links with classical memory-based CF, it allows us to find principled solutions to known problems of CF-based recommender systems. In particular, we show that a probabilistic active learning method can be used to actively query the user, thereby solving the “new user problem.” Furthermore, the probabilistic framework allows us to reduce the computational cost of memory-based CF by working on a carefully selected subset of user profiles, while retaining high accuracy. We report experimental results based on two real-world data sets, which demonstrate that our proposed PMCF framework allows an accurate and efficient prediction of user preferences.</p>
INDEX TERMS
Collaborative filtering, recommender systems, profile density model, active learning, data sampling.
CITATION
Anton Schwaighofer, Volker Tresp, Xiaowei Xu, Kai Yu, "Probabilistic Memory-Based Collaborative Filtering", IEEE Transactions on Knowledge & Data Engineering, vol.16, no. 1, pp. 56-69, January 2004, doi:10.1109/TKDE.2004.1264822
17 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool