• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

基于多探索局部敏感哈希的兴趣点推荐算法的隐私保护目标点(POI-MELSH)

POI-MELSH: Privacy Protection Target Point of Interest Recommendation Algorithm Based on Multi-Exploring Locality Sensitive Hashing.

作者信息

Liu Desheng, Shan Linna, Wang Lei, Yin Shoulin, Wang Hui, Wang Chaoyang

机构信息

College of Information and Electronic Technology, Jiamusi University, Jimusi, China.

Software College, Shenyang Normal University, Shenyang, China.

出版信息

Front Neurorobot. 2021 Apr 23;15:660304. doi: 10.3389/fnbot.2021.660304. eCollection 2021.

DOI:10.3389/fnbot.2021.660304
PMID:33967732
原文链接:https://pmc.ncbi.nlm.nih.gov/articles/PMC8102779/
Abstract

With the rapid development of social network, intelligent terminal and automatic positioning technology, location-based social network (LBSN) service has become an important and valuable application. Point of interest (POI) recommendation is an important content in LBSN, which aims to recommend new locations of interest for users. It can not only alleviate the information overload problem faced by users in the era of big data, improve user experience, but also help merchants quickly find target users and achieve accurate marketing. Most of the works are based on users' check-in history and social network data to model users' personalized preferences for interest points, and recommend interest points through collaborative filtering and other recommendation technologies. However, in the check-in history, the multi-source heterogeneous information (including the position, category, popularity, social, reviews) describes user activity from different aspects which hides people's life style and personal preference. However, the above methods do not fully consider these factors' combined action. Considering the data privacy, it is difficult for individuals to share data with others with similar preferences. In this paper, we propose a privacy protection point of interest recommendation algorithm based on multi-exploring locality sensitive hashing (LSH). This algorithm studies the POI recommendation problem under distributed system. This paper introduces a multi-exploring method to improve the LSH algorithm. On the one hand, it reduces the number of hash tables to decrease the memory overhead; On the other hand, the retrieval range on each hash table is increased to reduce the time retrieval overhead. Meanwhile, the retrieval quality is similar to the original algorithm. The proposed method uses modified LSH and homomorphic encryption technology to assist POI recommendation which can ensure the accuracy, privacy and efficiency of the recommendation algorithm, and it verifies feasibility through experiments on real data sets. In terms of root mean square error (RMSE), mean absolute error (MAE) and running time, the proposed method has a competitive advantage.

摘要

随着社交网络、智能终端和自动定位技术的快速发展,基于位置的社交网络(LBSN)服务已成为一项重要且有价值的应用。兴趣点(POI)推荐是LBSN中的一项重要内容,其目的是为用户推荐新的感兴趣地点。它不仅可以缓解用户在大数据时代面临的信息过载问题,提升用户体验,还能帮助商家快速找到目标用户并实现精准营销。大多数工作基于用户的签到历史和社交网络数据来建模用户对兴趣点的个性化偏好,并通过协同过滤等推荐技术推荐兴趣点。然而,在签到历史中,多源异构信息(包括位置、类别、热度、社交、评论)从不同方面描述了用户活动,其中隐藏着人们的生活方式和个人偏好。然而,上述方法并未充分考虑这些因素的综合作用。考虑到数据隐私,个人很难与有相似偏好的其他人共享数据。在本文中,我们提出了一种基于多探索局部敏感哈希(LSH)的隐私保护兴趣点推荐算法。该算法研究分布式系统下的POI推荐问题。本文引入一种多探索方法来改进LSH算法。一方面,减少哈希表数量以降低内存开销;另一方面,增加每个哈希表上的检索范围以减少时间检索开销。同时,检索质量与原算法相似。所提方法使用改进的LSH和同态加密技术辅助POI推荐,这可以确保推荐算法的准确性、隐私性和效率,并通过在真实数据集上的实验验证了其可行性。在均方根误差(RMSE)、平均绝对误差(MAE)和运行时间方面,所提方法具有竞争优势。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2e2d/8102779/5381234d5b88/fnbot-15-660304-g0011.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2e2d/8102779/4865af16f2d3/fnbot-15-660304-g0001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2e2d/8102779/156b16c05eea/fnbot-15-660304-g0002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2e2d/8102779/8fa76bc4e983/fnbot-15-660304-g0003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2e2d/8102779/54500796ad7b/fnbot-15-660304-g0004.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2e2d/8102779/b24e0c3517db/fnbot-15-660304-g0005.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2e2d/8102779/1d7e6f082f68/fnbot-15-660304-g0006.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2e2d/8102779/47d58433f4d7/fnbot-15-660304-g0007.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2e2d/8102779/3614766eb5d4/fnbot-15-660304-g0008.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2e2d/8102779/da0f55c81cd9/fnbot-15-660304-g0009.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2e2d/8102779/5952b0bf9cc6/fnbot-15-660304-g0010.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2e2d/8102779/5381234d5b88/fnbot-15-660304-g0011.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2e2d/8102779/4865af16f2d3/fnbot-15-660304-g0001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2e2d/8102779/156b16c05eea/fnbot-15-660304-g0002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2e2d/8102779/8fa76bc4e983/fnbot-15-660304-g0003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2e2d/8102779/54500796ad7b/fnbot-15-660304-g0004.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2e2d/8102779/b24e0c3517db/fnbot-15-660304-g0005.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2e2d/8102779/1d7e6f082f68/fnbot-15-660304-g0006.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2e2d/8102779/47d58433f4d7/fnbot-15-660304-g0007.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2e2d/8102779/3614766eb5d4/fnbot-15-660304-g0008.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2e2d/8102779/da0f55c81cd9/fnbot-15-660304-g0009.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2e2d/8102779/5952b0bf9cc6/fnbot-15-660304-g0010.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2e2d/8102779/5381234d5b88/fnbot-15-660304-g0011.jpg

相似文献

1
POI-MELSH: Privacy Protection Target Point of Interest Recommendation Algorithm Based on Multi-Exploring Locality Sensitive Hashing.基于多探索局部敏感哈希的兴趣点推荐算法的隐私保护目标点(POI-MELSH)
Front Neurorobot. 2021 Apr 23;15:660304. doi: 10.3389/fnbot.2021.660304. eCollection 2021.
2
Exploring IoT Location Information to Perform Point of Interest Recommendation Engine: Traveling to a New Geographical Region.探索物联网位置信息以实现兴趣点推荐引擎:前往新的地理区域。
Sensors (Basel). 2019 Feb 26;19(5):992. doi: 10.3390/s19050992.
3
Point of Interest recommendation for social network using the Internet of Things and deep reinforcement learning.基于物联网和深度强化学习的社交网络兴趣点推荐
Math Biosci Eng. 2023 Sep 11;20(9):17428-17445. doi: 10.3934/mbe.2023775.
4
Intelligent Sensors for POI Recommendation Model Using Deep Learning in Location-Based Social Network Big Data.基于位置社交网络大数据的深度学习兴趣点推荐模型智能传感器。
Sensors (Basel). 2023 Jan 11;23(2):850. doi: 10.3390/s23020850.
5
An Exception Handling Approach for Privacy-Preserving Service Recommendation Failure in a Cloud Environment.一种云环境中隐私保护服务推荐失败的异常处理方法。
Sensors (Basel). 2018 Jun 26;18(7):2037. doi: 10.3390/s18072037.
6
Privacy protection of communication networks using fully homomorphic encryption based on network slicing and attributes.基于网络切片和属性的全同态加密的通信网络隐私保护
Sci Rep. 2024 Aug 20;14(1):19391. doi: 10.1038/s41598-024-69501-5.
7
Optimization of news dissemination push mode by intelligent edge computing technology for deep learning.基于深度学习的智能边缘计算技术对新闻传播推送模式的优化
Sci Rep. 2024 Mar 20;14(1):6671. doi: 10.1038/s41598-024-53859-7.
8
A Strategy toward Collaborative Filter Recommended Location Service for Privacy Protection.一种面向隐私保护的协同过滤推荐位置服务的策略。
Sensors (Basel). 2018 May 11;18(5):1522. doi: 10.3390/s18051522.
9
Exploiting bi-directional global transition patterns and personal preferences for missing POI category identification.利用双向全局转移模式和个人偏好进行缺失 POI 类别识别。
Neural Netw. 2020 Dec;132:75-83. doi: 10.1016/j.neunet.2020.08.015. Epub 2020 Aug 20.
10
Density sensitive hashing.密度敏感哈希。
IEEE Trans Cybern. 2014 Aug;44(8):1362-71. doi: 10.1109/TCYB.2013.2283497. Epub 2013 Oct 23.

引用本文的文献

1
Robot location privacy protection based on Q-learning particle swarm optimization algorithm in mobile crowdsensing.移动群智感知中基于Q学习粒子群优化算法的机器人位置隐私保护
Front Neurorobot. 2022 Sep 30;16:981390. doi: 10.3389/fnbot.2022.981390. eCollection 2022.

本文引用的文献

1
Similarity analysis between chromosomes of Homo sapiens and monkeys with correlation coefficient, rank correlation coefficient and cosine similarity measures.利用相关系数、秩相关系数和余弦相似度度量对人类和猴子的染色体进行相似性分析。
Genom Data. 2016 Jan 7;7:202-9. doi: 10.1016/j.gdata.2016.01.001. eCollection 2016 Mar.