Please use this identifier to cite or link to this item:
Scopus Web of Science® Altmetric
Type: Conference paper
Title: An improved (k, p, l)-anonymity method for privacy preserving collaborative filtering
Author: Wei, R.
Shen, H.
Tian, H.
Citation: Proceedings of the IEEE Global Communications Conference (GLOBECOM 2017), 2017, pp.1-6
Publisher: IEEE
Issue Date: 2017
Series/Report no.: IEEE Global Communications Conference; 2017
ISBN: 9781509050192
ISSN: 2334-0983
Conference Name: IEEE Global Communications Conference (GLOBECOM 2017) (4 Dec 2017 - 8 Dec 2017 : Singapore, SINGAPORE)
Statement of
Ruoxuan Wei, Hong Shen, Hui Tian
Abstract: Collaborative Filtering (CF) is a successful technique that has been implemented in recommender systems and Privacy Preserving Collaborative Filtering (PPCF) aroused increasing concerns of the society. Current solutions mainly focus on cryptographic methods, obfuscation methods, perturbation methods and differential privacy methods. But these methods have some shortcomings, such as unnecessary computational cost, lower data quality and hard to calibrate the magnitude of noise. This paper proposes a (k, p, I)-anonymity method that improves the existing k-anonymity method in PPCF. The method works as follows: First, it applies Latent Factor Model (LFM) to reduce matrix sparsity. Then it improves Maximum Distance to Average Vector (MDAV) microaggregation algorithm based on importance partitioning to increase homogeneity among records in each group which can retain better data quality and (p, I)-diversity model where p is attacker's prior knowledge about users' ratings and I is the diversity among users in each group to improve the level of privacy preserving. Theoretical and experimental analyses show that our approach ensures a higher level of privacy preserving based on lower information loss.
Rights: ©2017 IEEE
DOI: 10.1109/GLOCOM.2017.825508
Grant ID:
Published version:
Appears in Collections:Aurora harvest 8
Computer Science publications

Files in This Item:
There are no files associated with this item.

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.