Jiwoon Ha
Christos Faloutsos
ABSTRACT
The top-n recommendation focuses on finding the top-n items that the target user is likely to purchase rather than predicting his/her ratings on individual items. In this paper, we propose a novel method that provides top-n recommendation by probabilistically determining the target user's preference on items. This method models the purchasing relationships between users and items as a bipartite graph and employs Belief Propagation to compute the preference of the target user on items. We analyze the proposed method in detail by examining the changes in recommendation accuracy under different parameter settings. We also show that the proposed method is up to 40% more accurate than an existing method by comparing it with an RWR-based method via extensive experiments.
- G. Adomavicius and A. Tuzhilin, "Toward the Next Generation of Recommender Systems: A Survey of the State-of-the-Art and Possible Extensions," IEEE TKDE, vol.17, no.6, pp.734--749, 2005. Google Scholar
Digital Library
- D. Chau, S. Pandit, and C. Faloutsos, "Detecting Fraudulent Personalities in Networks of Online Auctioneers," ECML/PKDD, pp.103--114, 2006. Google ScholarDigital Library
- M. Dias et al., "The Value of Personalised Recommender Systems to E-business: a Case Study," ACM RecSys, pp.291--294, 2008. Google ScholarDigital Library
- F. Fouss et al., "Random-walk Computation of Similarities between Nodes of a Graph with Application to Collaborative Recommendation," IEEE TKDE, vol.19, no.3, pp.355--369, 2007. Google ScholarDigital Library
- A. Gunawardana and G. Shani, "A Survey of Accuracy Evaluation Metrics of Recommendation Tasks," JMLR, vol.10, pp.2935--2962, 2009. Google ScholarDigital Library
- I. Konstas, V. Stathopoulos, and J. M. Jose, "On Social Networks and Collaborative Recommendation," ACM SIGIR, pp.195--202, 2009. Google ScholarDigital Library
- Y. Koren, "Collaborative Filtering with Temporal Dynamics," ACM CACM, vol.53, no.4, pp.89--97, 2010. Google ScholarDigital Library
- D. Koutra et al., "Unifying Guilt-By-Association Approaches: Theorems and Fast Algorithms," Machine Learning and Knowledge Discovery in Databases, vol.6921, pp.245--260, 2011. Google ScholarDigital Library
- N. Liu and Q. Yang, "EigenRank: A Ranking-oriented Approach to Collaborative Filtering," ACM SIGIR, pp.83--90, 2008. Google ScholarDigital Library
- M. McGlohon et al., "SNARE: A Link Analytic System for Graph Labeling and Risk Detection," ACM KDD, pp.1265--1274, 2009. Google ScholarDigital Library
- S. Pandit et al., "NetProbe: A Fast and Scalable System for Fraud Detection in Online Auction Networks," WWW, pp.201--210, 2007. Google ScholarDigital Library
- B. Sarwar, G. Karypis, J. Konstan, and J. Riedl, "Item-Based Collaborative Filtering Recommendation Algorithms," WWW, pp.285--295, 2001. Google ScholarDigital Library
Index Terms
- Top-N recommendation through belief propagation
Recommendations
Personalized hybrid recommendation for group of users
Novel group hybrid method combining collaborative and content-based recommendation.Proposed method improves the quality of recommended items ordering.Proposed method increases the recommendation precision for very Top-N results.Applicable for single ...
Local Item-Item Models For Top-N Recommendation
RecSys '16: Proceedings of the 10th ACM Conference on Recommender SystemsItem-based approaches based on SLIM (Sparse LInear Methods) have demonstrated very good performance for top-N recommendation; however they only estimate a single model for all the users. This work is based on the intuition that not all users behave in ...
A generic Bayesian-based framework for enhancing top-N recommender algorithms
Highlights- We prove that recommending some unpopular items could increase the accuracy.
- We ...
AbstractPersonalized top-N recommender algorithms have been investigated widely in decades. The core task of different recommender algorithms is to estimate user-item preference scores and then to suggest, for each user, top-N items that have ...
Comments