A Locality Sensitive Hashing Based Approach for Federated Recommender System

被引:4
|
作者
Hu, Hongsheng [1 ]
Dobbie, Gillian [2 ]
Salcic, Zoran [1 ]
Liu, Meng [3 ]
Zhang, Jianbing [4 ]
Zhang, Xuyun [5 ]
机构
[1] Univ Auckland, Sch Elect & Comp Engn, Auckland 1023, New Zealand
[2] Univ Auckland, Sch Comp Sci, Auckland, New Zealand
[3] Shandong Univ, Sch Mech Elect & Informat Engn, Weihai 264209, Shandong, Peoples R China
[4] Nanjing Univ, Sch Comp Sci & Technol, Nanjing 210093, Peoples R China
[5] Macquarie Univ, Sch Sci & Engn, Sydney, NSW 2109, Australia
来源
2020 20TH IEEE/ACM INTERNATIONAL SYMPOSIUM ON CLUSTER, CLOUD AND INTERNET COMPUTING (CCGRID 2020) | 2020年
关键词
recommender system; locality sensitive hashing; differential privacy; PRIVACY;
D O I
10.1109/CCGrid49817.2020.000-1
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The recommender system is an important application in big data analytics because accurate recommendation items or high-valued suggestions can bring high profit to both commercial companies and customers. To make precise recommendations, a recommender system often needs large and fine-grained data for training. In the current big data era, data often exist in the form of isolated islands, and it is difficult to integrate the data scattered due to privacy security concerns. Moreover, privacy laws and regulations make it harder to share data. Therefore, designing a privacy-preserving recommender system is of paramount importance. Existing privacy-preserving recommender system models mainly adapt cryptography approaches to achieve privacy preservation. However, cryptography approaches have heavy overhead when performing encryption and decryption operations and they lack a good level of flexibility. In this paper, we propose a Locality Sensitive Hashing (LSH) based approach for federated recommender system. Our proposed efficient and scalable federated recommender system can make full use of multiple source data from different data owners while guaranteeing preservation of privacy of contributing parties. Extensive experiments on real-world benchmark datasets show that our approach can achieve both high time efficiency and accuracy under small privacy budgets.
引用
收藏
页码:836 / 842
页数:7
相关论文
共 50 条
  • [41] Fast Duplicate Detection Using Locality Sensitive Hashing
    Rong, C. T.
    Feng, L. J.
    INTERNATIONAL CONFERENCE ON ADVANCED EDUCATIONAL TECHNOLOGY AND INFORMATION ENGINEERING (AETIE 2015), 2015, : 580 - 588
  • [42] Using Locality-sensitive Hashing for Rendezvous Search
    Jiang, Guann-Yng
    Chang, Cheng-Shang
    ICC 2023-IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, 2023, : 1743 - 1749
  • [43] Locality Sensitive Hashing for Efficient Similar Polygon Retrieval
    Kaplan, Haim
    Tenenbaum, Jay
    38TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2021), 2021, 187
  • [44] Real-time recommendation with locality sensitive hashing
    Aytekin, Ahmet Maruf
    Aytekin, Tevfik
    JOURNAL OF INTELLIGENT INFORMATION SYSTEMS, 2019, 53 (01) : 1 - 26
  • [45] Real-time recommendation with locality sensitive hashing
    Ahmet Maruf Aytekin
    Tevfik Aytekin
    Journal of Intelligent Information Systems, 2019, 53 : 1 - 26
  • [46] Sequential Hypothesis Tests for Adaptive Locality Sensitive Hashing
    Chakrabarti, Aniket
    Parthasarathy, Srinivasan
    PROCEEDINGS OF THE 24TH INTERNATIONAL CONFERENCE ON WORLD WIDE WEB (WWW 2015), 2015, : 162 - 172
  • [47] Robust Set Reconciliation via Locality Sensitive Hashing
    Mitzenmacher, Michael
    Morgan, Tom
    PROCEEDINGS OF THE 38TH ACM SIGMOD-SIGACT-SIGAI SYMPOSIUM ON PRINCIPLES OF DATABASE SYSTEMS (PODS '19), 2019, : 164 - 181
  • [48] Why locality sensitive hashing works: A practical perspective
    Lu, Kejing
    Wang, Hongya
    Xiao, Yingyuan
    Song, Hui
    INFORMATION PROCESSING LETTERS, 2018, 136 : 49 - 58
  • [49] Improved multi object tracking with locality sensitive hashing
    Chemmanam, Ajai John
    Jose, Bijoy
    Moopan, Asif
    PATTERN ANALYSIS AND APPLICATIONS, 2024, 27 (04)
  • [50] Locality-Sensitive Hashing Scheme Based on Heap Sort of Hash Bucket
    Fang, Bo
    Hua, Zhongyun
    Huang, Hejiao
    14TH INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND EDUCATION (ICCSE 2019), 2019, : 5 - 10