Probabilistic memory-based collaborative filtering
Authors:
- A. SchwaighoferASA. Schwaighofer
- V. TrespVTV. Tresp
- Xiaowei XuXXXiaowei Xu
- H.-P. KriegelHKH.-P. Kriegel
- 19 February 2004
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 16 (1) , 56-69
Abstract
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.Keywords
This publication has 19 references indexed in Scilit:
- Efficient Adaptive-Support Association Rule Mining for Recommender SystemsData Mining and Knowledge Discovery, 2002
- Elements of Information Theory2001
- Eigentaste: A Constant Time Collaborative Filtering AlgorithmInformation Retrieval Journal, 2001
- Item-based collaborative filtering recommendation algorithms2001
- Bayesian Networks and Decision Graphs2001
- Explaining collaborative filtering recommendations2000
- Analysis of recommendation algorithms for e-commerce2000
- Content-based book recommending using learning for text categorization2000
- 10.1162/153244302760200641Applied Physics Letters, 2000
- FabCommunications of the ACM, 1997