SDRM‐LDP: A Recommendation Model Based on Local Differential Privacy
Open Access
- 1 January 2021
- journal article
- research article
- Published by Wiley in Wireless Communications and Mobile Computing
- Vol. 2021 (1)
Abstract
The development of 5G technology has driven the rise of e‐commerce, social networking, and the Internet of Things. Under the high‐speed transmission, the data volume increases, and the user demand also changes. Personalized customization has become the mainstream trend of network development. However, as the speed of the Internet increases, a series of problems also arise. The increase in data volume results in a reduction of bandwidth, a growth of the central processor’s pressure, and a higher risk of data leakage. A search system and a recommendation platform are the tools to improve people’s search efficiency. However, providing personalized recommendations to different users according to their needs is still an urgent problem. Simultaneously, the big data volume means that attackers can also get more information. They can use background knowledge and various reasoning methods to deduce the user’s private information using nonprivate items. In this paper, the solutions to safe and reliable recommendation services are the main problem explored. Based on this idea, this paper proposed short‐term dynamic recommendation model based on local differential privacy (SDRM‐LDP). This model uses a small amount of user information to construct short‐term user preference behaviors and provides recommendations for users based on the similarity between items. We consider that an attacker uses nonprivate items to derive privacy items. Therefore, we randomly replace the original data in the same category. At the same time, the local differential privacy (LDP) is added to the privacy item query to make the private data available and protect the privacy information. In this paper, two real‐world datasets, ML‐100K and ML‐10M, are used for experiments. Experimental results show that the results of SDRM‐LDP are superior to other models.Keywords
Funding Information
- Fundamental Research Funds for the Central Universities (3072020CFP0601, 3072020CF0604, 3072020CFQ0602)
This publication has 17 references indexed in Scilit:
- Trading Private Range Counting over Big IoT Data2019
- A Differential-Private Framework for Urban Traffic Flows Estimation via Taxi CompaniesIEEE Transactions on Industrial Informatics, 2019
- A Private and Efficient Mechanism for Data Uploading in Smart Cyber-Physical SystemsIEEE Transactions on Network Science and Engineering, 2018
- Recommending Personalized News in Short User Sessions2017
- Collective Data-Sanitization for Preventing Sensitive Information Inference Attacks in Social NetworksIEEE Transactions on Dependable and Secure Computing, 2016
- Temporal dynamic study in personalization digital newspaper ¡ahora!IEEE Latin America Transactions, 2015
- Adapting Recommendations to Contextual Changes Using Hierarchical Hidden Markov Models2015
- A trust-based probabilistic recommendation model for social networksJournal of Network and Computer Applications, 2015
- A Hidden Markov Model for Collaborative Filtering1MIS Quarterly, 2012
- Some Exploratory Findings on the Development of Musical TastesJournal of Consumer Research, 1989