首页> 外文期刊>Future generation computer systems >Privacy-preserving and sparsity-aware location-based prediction method for collaborative recommender systems
【24h】

Privacy-preserving and sparsity-aware location-based prediction method for collaborative recommender systems

机译:用于协作推荐系统的隐私保留和稀疏性感知位置的预测方法

获取原文
获取原文并翻译 | 示例
       

摘要

With the rapid growth of public cloud offerings, how to design effective prediction models that provide appropriate recommendations for potential users has become more and more important. In dynamic cloud environment, both of user behaviors and service performance are sensitive to contextual information, such as geographic location information. In addition, the increasing number of attacks and security threats also brought the problem that how to protect critical information assets such as sensitive data, cloud resources and communication in a more effective and secure manner. In view of these challenges, we propose a privacy-preserving and sparsity-aware location-based prediction method for collaborative recommender systems. Specifically, our method is designed as a three-phase process: Firstly, two privacy-preserving mechanisms, i.e., a randomized data obfuscation technique and a region aggregation strategy are presented to protect the private information of users and deal with the data sparsity problem. Then a location-aware latent factor model based on tensor factorization is applied to explore the spatial similarity relationships between services. Finally, predictions are made based on both global and spatial nearest neighbors. Experiments are designed and conducted to validate the effectiveness of our proposal. The experimental results show that our method achieves decent prediction accuracy on the premise of privacy preservation. (C) 2019 Elsevier B.V. All rights reserved.
机译:随着公共云产品的快速增长,如何设计有效的预测模型,为潜在用户提供适当的建议已经变得越来越重要。在动态云环境中,用户行为和服务性能都对上下文信息(例如地理位置信息)敏感。此外,越来越多的攻击和安全威胁也带来了如何以更有效和安全的方式保护诸如敏感数据,云资源和通信等关键信息资产的问题。鉴于这些挑战,我们提出了一种隐私保留和稀疏性感知的基于位置的基于位置的预测方法,用于协作推荐系统。具体而言,我们的方法被设计为三相过程:首先,提出了两个隐私保留机制,即随机保留的数据和区域聚合策略以保护用户的私人信息并处理数据稀疏问题。然后应用基于张量分解的位置感知潜在因子模型来探索服务之间的空间相似关系。最后,基于全局和空间最近的邻居进行预测。设计并进行了实验,以验证我们提案的有效性。实验结果表明,我们的方法在隐私保护的前提下实现了体面的预测准确性。 (c)2019 Elsevier B.v.保留所有权利。

著录项

  • 来源
    《Future generation computer systems》 |2019年第7期|324-335|共12页
  • 作者单位

    Nanjing Univ Sci & Technol Sch Comp Sci & Engn Nanjing Jiangsu Peoples R China|Nanjing Univ State Key Lab Novel Software Technol Nanjing Jiangsu Peoples R China;

    Qufu Normal Univ Sch Informat Sci & Engn Jining Peoples R China;

    Nanjing Univ Sci & Technol Sch Comp Sci & Engn Nanjing Jiangsu Peoples R China;

    Hangzhou Dianzi Univ Dept Comp Sci Hangzhou Zhejiang Peoples R China;

    Nanjing Univ Informat Sci & Technol Sch Comp & Software Nanjing Jiangsu Peoples R China;

    Zhongnan Univ Econ & Law Sch Informat & Safety Engn Wuhan Hubei Peoples R China;

  • 收录信息 美国《科学引文索引》(SCI);美国《工程索引》(EI);
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

    Location-aware recommendation; Privacy-preserving; Data sparsity; Tensor factorization;

    机译:位置感知建议;保留隐私;数据稀疏性;张量分解;

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号