Lightweight and Privacy-Preserving IoT Service Recommendation Based on Learning to Hash

被引:0
作者
Wan, Haoyang [1 ]
Wu, Yanping [2 ]
Yang, Yihong [3 ]
Yan, Chao [1 ]
Chi, Xiaoxiao [4 ]
Zhang, Xuyun [4 ]
Shen, Shigen [5 ]
机构
[1] Qufu Normal Univ, Sch Comp Sci, Rizhao 276800, Peoples R China
[2] Weifang Univ Sci & Technol, Shandong Prov Univ Lab Protected Hort, Shouguang 262700, Peoples R China
[3] China Univ Geosci, Sch Informat Engn, Beijing 100083, Peoples R China
[4] Macquarie Univ, Dept Comp, Sydney 2109, Australia
[5] Huzhou Univ, Sch Informat Engn, Huzhou 313000, Peoples R China
来源
TSINGHUA SCIENCE AND TECHNOLOGY | 2025年 / 30卷 / 04期
关键词
Data privacy; Privacy; Accuracy; Aggregates; Distributed databases; Big Data; Internet of Things; Proposals; Recommender systems; service recommendation; IoT; privacy protection; learning to hash; lightweight; PREDICTION; QOS;
D O I
10.26599/TST.2024.9010064
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In the Internet of Things (IoT) environment, user-service interaction data are often stored in multiple distributed platforms. In this situation, recommender systems need to integrate the distributed user-service interaction data across different platforms for making a comprehensive recommendation decision, during which user privacy is probably disclosed. Moreover, as user-service interaction records accumulate over time, they significantly reduce the efficiency of recommendations. To tackle these issues, we propose a lightweight and privacy-preserving service recommendation approach named SerRec(L2H). In SerRec(L2H), we employ Learning to Hash (L2H) to encapsulate sensitive user-service interaction data into less-sensitive user indices, which facilitates identifying users with similar preferences efficiently for accurate recommendations. We then validate the feasibility of our proposed SerRec(L2H) approach through massive experiments conducted on the popular WS-DREAM dataset. The comparative analysis with other competitive approaches demonstrates that our proposal surpasses other approaches in terms of recommendation accuracy and efficiency while protecting user privacy.
引用
收藏
页码:1793 / 1807
页数:15
相关论文
共 39 条
[1]   A privacy-preserving multimedia recommendation in the context of social network based on weighted noise injection [J].
Dou, Kai ;
Guo, Bin ;
Kuang, Li .
MULTIMEDIA TOOLS AND APPLICATIONS, 2019, 78 (19) :26907-26926
[2]  
Gionis A, 1999, PROCEEDINGS OF THE TWENTY-FIFTH INTERNATIONAL CONFERENCE ON VERY LARGE DATA BASES, P518
[3]  
Hashemi S, 2019, DES AUT TEST EUROPE, P1289, DOI [10.23919/date.2019.8715274, 10.23919/DATE.2019.8715274]
[4]   MATRIX FACTORIZATION TECHNIQUES FOR RECOMMENDER SYSTEMS [J].
Koren, Yehuda ;
Bell, Robert ;
Volinsky, Chris .
COMPUTER, 2009, 42 (08) :30-37
[5]   Bidirectional Distillation for Top-K Recommender System [J].
Kweon, Wonbin ;
Kang, Seongku ;
Yu, Hwanjo .
PROCEEDINGS OF THE WORLD WIDE WEB CONFERENCE 2021 (WWW 2021), 2021, :3861-3871
[6]   Learning the parts of objects by non-negative matrix factorization [J].
Lee, DD ;
Seung, HS .
NATURE, 1999, 401 (6755) :788-791
[7]   Collaborative Distillation for Top-N Recommendation [J].
Lee, Jae-woong ;
Choi, Minjin ;
Lee, Jongwuk ;
Shim, Hyunjung .
2019 19TH IEEE INTERNATIONAL CONFERENCE ON DATA MINING (ICDM 2019), 2019, :369-378
[8]   Trust-Aware Hybrid Collaborative Recommendation with Locality-Sensitive Hashing [J].
Li, Dejuan ;
Esquivel, James A. .
TSINGHUA SCIENCE AND TECHNOLOGY, 2025, 30 (04) :1421-1434
[9]   FEXIPRO: Fast and Exact Inner Product Retrieval in Recommender Systems [J].
Li, Hui ;
Chan, Tsz Nam ;
Yiu, Man Lung ;
Mamoulis, Nikos .
SIGMOD'17: PROCEEDINGS OF THE 2017 ACM INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA, 2017, :835-850
[10]   Lightweight Self-Attentive Sequential Recommendation [J].
Li, Yang ;
Chen, Tong ;
Zhang, Peng-Fei ;
Yin, Hongzhi .
PROCEEDINGS OF THE 30TH ACM INTERNATIONAL CONFERENCE ON INFORMATION & KNOWLEDGE MANAGEMENT, CIKM 2021, 2021, :967-977