首页> 中文期刊> 《武汉大学学报:自然科学英文版》 >Differentially Private Top-k Items Based on Least Mean Square——Take E-Commerce Platforms for Example

Differentially Private Top-k Items Based on Least Mean Square——Take E-Commerce Platforms for Example

         

摘要

User preference data broadly collected from e-commerce platforms have benefits to improve the user’s experience of individual purchasing recommendation by data mining and analyzing,which may bring users the risk of privacy disclosure.In this paper,we explore the problem of differential private top-k items based on least mean square.Specifically,we consider the balance between utility and privacy level of released data and improve the precision of top-k based on post-processing.We show that our algorithm can achieve differential privacy over streaming data collected and published periodically by server provider.We evaluate our algorithm with three real datasets,and the experimental results show that the precision of our method reaches 85%with strong privacy protection,which outperforms the Kalman filter-based existing methods.

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号