Protecting multi-party privacy in location-aware social point-of-interest recommendation

被引:13
作者
Wang, Weiqi [1 ]
Liu, An [1 ]
Li, Zhixu [1 ]
Zhang, Xiangliang [2 ]
Li, Qing [3 ]
Zhou, Xiaofang [4 ]
机构
[1] Soochow Univ, Sch Comp Sci & Technol, Suzhou, Peoples R China
[2] King Abdullah Univ Sci & Technol, Thuwal 23955, Saudi Arabia
[3] City Univ Hong Kong, Dept Comp Sci, Kowloon Tong, Hong Kong, Peoples R China
[4] Univ Queensland, Sch Informat Technol & Elect Engn, Brisbane, Qld, Australia
来源
WORLD WIDE WEB-INTERNET AND WEB INFORMATION SYSTEMS | 2019年 / 22卷 / 02期
关键词
Location privacy; Point-of-interest; Recommendation; IMAGE;
D O I
10.1007/s11280-018-0550-9
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Point-of-interest (POI) recommendation has attracted much interest recently because of its significant business potential. Data used in POI recommendation (e.g., user-location check-in matrix) are much more sparse than that used in traditional item (e.g., book and movie) recommendation, which leads to more serious cold start problem. Social POI recommendation has proved to be an effective solution, but most existing works assume that recommenders have access to all required data. This is very rare in practice because these data are generally owned by different entities who are not willing to share their data with others due to privacy and legal concerns. In this paper, we first propose PLAS, a protocol which enables effective POI recommendation without disclosing the sensitive data of every party getting involved in the recommendation. We formally show PLAS is secure in the semi-honest adversary model. To improve its performance. We then adopt the technique of cloaking area by which expensive distance computation over encrypted data is replaced by cheap operation over plaintext. In addition, we utilize the sparsity of check-ins to selectively publish data, thus reducing encryption cost and avoiding unnecessary computation over ciphertext. Experiments on two real datasets show that our protocol is feasible and can scale to large POI recommendation problems in practice.
引用
收藏
页码:863 / 883
页数:21
相关论文
共 43 条
  • [1] [Anonymous], TMM
  • [2] [Anonymous], 2016, ADV INTEL SYS RES
  • [3] [Anonymous], TKDE
  • [4] [Anonymous], ACCESS
  • [5] [Anonymous], TIP
  • [6] Context-Aware Friend Recommendation for Location Based Social Networks using Random Walk
    Bagci, Hakan
    Karagoz, Pinar
    [J]. PROCEEDINGS OF THE 25TH INTERNATIONAL CONFERENCE ON WORLD WIDE WEB (WWW'16 COMPANION), 2016, : 531 - 536
  • [7] Bamba B., 2008, Proceeding of 17th International Conference on World Wide Web, P237, DOI DOI 10.1145/1367497.1367531
  • [8] Bettini C, 2005, LECT NOTES COMPUT SC, V3674, P185
  • [9] Chen L, 2015, PROC VLDB ENDOW, V8, P1885
  • [10] Metric All-k-Nearest-Neighbor Search
    Chen, Lu
    Gao, Yunjun
    Chen, Gang
    Zhang, Haida
    [J]. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2016, 28 (01) : 98 - 112