Robustness Analysis of Privacy-Preserving Hybrid Recommendation Algorithm

Authors : İhsan GUNES, Huseyin POLAT

Pages : 13-25

View : 38 | Download : 12

Publication Date : 2015-03-31

Article Type : Research Paper

Abstract :In addition to memory- and model-based recommendation schemes, hybrid methods are widely used due to their advantages. Such schemes should be able to provide accurate predictions efficiently while preserving privacy. Also, they need to be robust against possible profile injection or shilling attacks. Although some privacy-preserving memory- and model-based collaborative filtering algorithms have been investigated with respect to robustness, privacy-preserving hybrid recommendation schemes have not been analyzed in terms of robustness. In this paper, we analyze a privacy-preserving hybrid collaborative filtering scheme with respect to robustness. Four push and two nuke attack models are applied to the algorithm in order to show how robust it is against such shilling attacks. Different sets of experiments are conducted using real data to show how varying controlling parameters affect the robustness. The hybrid scheme is compared with memory- and model-based scheme in terms of robustness. Our analysis show that although the scheme can be marginally considered as robust algorithm, it is less robust than memory- or model-based prediction algorithms with privacy.
Keywords : Robustness, hybrid algorithm, privacy, shilling attacks, recommendation

ORIGINAL ARTICLE URL