Spatio-Temporal Trajectory Features Based Sensitive Relationship Protection

Xiangyu Liu, Yifan Shen, Xiufeng Xia, Jiajia Li, Chuanyu Zong, Rui Zhu
{"title":"Spatio-Temporal Trajectory Features Based Sensitive Relationship Protection","authors":"Xiangyu Liu, Yifan Shen, Xiufeng Xia, Jiajia Li, Chuanyu Zong, Rui Zhu","doi":"10.1109/IUCC/DSCI/SmartCNS.2019.00049","DOIUrl":null,"url":null,"abstract":"To solve the problem of privacy leakage of sensitive relationships caused by the spatial-temporal trajectory correlation of users in social networks, this paper proposes a privacy protection algorithm for sensitive relationships based on spatial-temporal trajectory features. In this paper, we propose a new measurement model for evaluating users' similarities, the basic idea of which is to calculate the similarity between users' sub-trajectories based on spatial and temporal dimensions. The proposed privacy protection algorithm adopts a heuristic to evaluate the inference contribution and information loss caused by data modification in order to protect sensitive relationship privacy meanwhile maintaining the trajectory data utility. We also provide the security analysis and theoretically prove the availability of the proposed algorithm. Based on the real social network data, the experimental results show that the proposed algorithm is efficient and could achieve high data utility.","PeriodicalId":410905,"journal":{"name":"2019 IEEE International Conferences on Ubiquitous Computing & Communications (IUCC) and Data Science and Computational Intelligence (DSCI) and Smart Computing, Networking and Services (SmartCNS)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE International Conferences on Ubiquitous Computing & Communications (IUCC) and Data Science and Computational Intelligence (DSCI) and Smart Computing, Networking and Services (SmartCNS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IUCC/DSCI/SmartCNS.2019.00049","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

To solve the problem of privacy leakage of sensitive relationships caused by the spatial-temporal trajectory correlation of users in social networks, this paper proposes a privacy protection algorithm for sensitive relationships based on spatial-temporal trajectory features. In this paper, we propose a new measurement model for evaluating users' similarities, the basic idea of which is to calculate the similarity between users' sub-trajectories based on spatial and temporal dimensions. The proposed privacy protection algorithm adopts a heuristic to evaluate the inference contribution and information loss caused by data modification in order to protect sensitive relationship privacy meanwhile maintaining the trajectory data utility. We also provide the security analysis and theoretically prove the availability of the proposed algorithm. Based on the real social network data, the experimental results show that the proposed algorithm is efficient and could achieve high data utility.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于时空轨迹特征的敏感关系保护
为解决社交网络中用户时空轨迹关联导致的敏感关系隐私泄露问题,本文提出了一种基于时空轨迹特征的敏感关系隐私保护算法。本文提出了一种新的用户相似度度量模型,其基本思想是基于时空维度计算用户子轨迹之间的相似度。本文提出的隐私保护算法采用启发式方法来评估数据修改所带来的推理贡献和信息损失,从而在保护敏感关系隐私的同时保持轨迹数据的效用。我们还提供了安全性分析,并从理论上证明了该算法的有效性。基于真实社交网络数据的实验结果表明,该算法是有效的,能够实现较高的数据利用率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Message from the RTWC 2019 Workshop Chairs Message from the NGDN 2019 Workshop Chairs Ideation Support System with Personalized Knowledge Level Prediction Message from the DSCI 2019 General Chairs Connection Degree Cost and Reward Based Algorithm in Cognitive Radio Networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1