Robustness of collaborative recommendation based on association rule mining

  • Authors:
  • J. J. Sandvig;Bamshad Mobasher;Robin Burke

  • Affiliations:
  • DePaul University, Chicago, IL;DePaul University, Chicago, IL;DePaul University, Chicago, IL

  • Venue:
  • Proceedings of the 2007 ACM conference on Recommender systems
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Standard memory-based collaborative filtering algorithms, such as k-nearest neighbor, are quite vulnerable to profile injection attacks. Previous work has shown that some model-based techniques are more robust than k-nn. Model abstraction can inhibit certain aspects of an attack, providing an algorithmic approach to minimizing attack effectiveness. In this paper, we examine the robustness of a recommendation algorithm based on the data mining technique of association rule mining. Our results show that the Apriori algorithm offers large improvement in stability and robustness compared to k-nearest neighbor and other model-based techniques we have studied. Furthermore, our results show that Apriori can achieve comparable recommendation accuracy to k-nn.