Item-based collaborative filtering recommendation algorithms
Proceedings of the 10th international conference on World Wide Web
IEEE Transactions on Knowledge and Data Engineering
Netprobe: a fast and scalable system for fraud detection in online auction networks
Proceedings of the 16th international conference on World Wide Web
IEEE Transactions on Knowledge and Data Engineering
EigenRank: a ranking-oriented approach to collaborative filtering
Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval
The value of personalised recommender systems to e-business: a case study
Proceedings of the 2008 ACM conference on Recommender systems
SNARE: a link analytic system for graph labeling and risk detection
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
On social networks and collaborative recommendation
Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval
Collaborative filtering with temporal dynamics
Communications of the ACM
A Survey of Accuracy Evaluation Metrics of Recommendation Tasks
The Journal of Machine Learning Research
Unifying guilt-by-association approaches: theorems and fast algorithms
ECML PKDD'11 Proceedings of the 2011 European conference on Machine learning and knowledge discovery in databases - Volume Part II
Detecting fraudulent personalities in networks of online auctioneers
PKDD'06 Proceedings of the 10th European conference on Principle and Practice of Knowledge Discovery in Databases
Exploiting trustors as well as trustees in trust-based recommendation
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Recommendation in online shopping malls: results and experiences
Proceedings of the 2013 Research in Adaptive and Convergent Systems
Hi-index | 0.00 |
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.