首页 | 官方网站   微博 | 高级检索  
     

基于非敏感信息分析的轨迹数据隐私保护发布
引用本文:邓劲松,罗永龙,俞庆英,陈付龙.基于非敏感信息分析的轨迹数据隐私保护发布[J].计算机应用,2017,37(2):488-493.
作者姓名:邓劲松  罗永龙  俞庆英  陈付龙
作者单位:1. 安徽师范大学 数学计算机科学学院, 安徽 芜湖 241003;2. 安徽师范大学 网络与信息安全工程技术研究中心, 安徽 芜湖 241003
基金项目:国家自然科学基金资助项目(61370050,61672039);安徽省自然科学基金资助项目(1508085QF134)。
摘    要:针对轨迹数据发布时轨迹和非敏感信息引起的隐私泄露问题,提出一种基于非敏感信息分析的轨迹数据隐私保护发布算法。首先,分析轨迹和非敏感信息的关联性构建轨迹隐私泄露判定模型,得到最小违反序列元组(MVS),然后借鉴公共子序列的思想,在消除MVS带来的隐私泄露风险时,选择MVS中对轨迹数据损失最小的时序序列作为抑制对象,从而生成具有隐私能力和低数据损失率的匿名轨迹数据集。仿真实验结果表明,与LKC-Local算法和Trad-Local算法相比,在序列长度为3的情况下,该算法平均实例损失率分别降低了6%和30%,平均最大频繁序列(MFS)损失率分别降低了7%和60%,因此所提算法能够有效用于提高推荐服务质量。

关 键 词:隐私保护  高维轨迹数据  非敏感信息  公共子序列  序列抑制  
收稿时间:2016-07-22
修稿时间:2016-09-05

Privacy-preserving trajectory data publishing based on non-sensitive information analysis
DENG Jingsong,LUO Yonglong,YU Qingying,CHEN Fulong.Privacy-preserving trajectory data publishing based on non-sensitive information analysis[J].journal of Computer Applications,2017,37(2):488-493.
Authors:DENG Jingsong  LUO Yonglong  YU Qingying  CHEN Fulong
Affiliation:1. School of Mathematics and Computer Science, Anhui Normal University, Wuhu Anhui 241003, China;2. Engineering Technology Research Center of Network and Information Security, Anhui Normal University, Wuhu Anhui 241003, China
Abstract:Focusing on the issue of privacy disclosure between trajectory and non-sensitive information, a trajectory privacy preserving algorithm based on non-sensitive information analysis was proposed. Firstly, the correlation between trajectory and non-sensitive information was analyzed to build trajectory privacy disclosure decision model, and the Minimal Violating Sequence tuple (MVS) was gotten. Secondly, using common subsequences, the doublets with the minimal loss of trajectory data in MVS were selected as the suppression objects when removing the privacy risks caused by MVS, then the anonymized trajectory dataset with privacy and low data loss was obtained. In the comparison experiments with LKC-Local algorithm and Trad-Local algorithm, when the sequence length is 3, the average instance loss of the proposed algorithm is decreased by about 6% and 30% respectively, and the average MFS (Maximal Frequent Sequence) loss is decreased by about 7% and 60% respectively. The experimental results verify that the proposed algorithm can effectively improve the quality of recommend service.
Keywords:privacy-preserving                                                                                                                        high-dimensional trajectory data                                                                                                                        non-sensitive information                                                                                                                        common subsequence                                                                                                                        sequence-suppression
点击此处可从《计算机应用》浏览原始摘要信息
点击此处可从《计算机应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号