{'fraction_non_alphanumeric': 0.0234375, 'fraction_numerical': 0.0, 'mean_word_length': 5.543795620437956, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Privacy-preserving item-based Collaborative Filtering using semi-distributed Belief Propagation

Recommender systems are increasingly employed by e-commerce websites to suggest items to users that meet their preferences. Collaborative Filtering (CF), as the most popular recommendation algorithm, exploits the collected historic user ratings to predict ratings on unseen items for users. However, traditional recommender systems are run by the commercial websites, and thus users have to disclose their personal rating data to the websites in order to receive recommendations. This raises the privacy issue, as user ratings can be used to reveal sensitive personal information. In this paper, we propose a privacy-preserving item-based CF recommender system using semi-distributed Belief Propagation (BP), where rating data are stored at the user side. Firstly, we formulate the item similarity computation as a probabilistic inference problem on the factor graph, which can be efficiently solved by applying the BP algorithm. To avoid disclosing user ratings to the server or other user peers, we then introduce a semi-distributed architecture for the BP algorithm, where only probabilistic messages on item similarity are exchanged between the server and users. Finally, an active user locally generates rating predictions by averaging his own ratings on items weighted by their similarities to unseen items. As such, the proposed recommender system preserves user privacy without relying on any privacy techniques, e.g., obfuscation and cryptography. Further, there is no compromise in recommendation performance compared to the centralized counterpart of the proposed algorithm. Through experiments on the MovieLens dataset, we show that the proposed algorithm achieves superior accuracy.