基于图划分的个性化轨迹隐私保护方法

doi:10.11959/j.issn.1000-436x.2015053

通信学报 ›› 2015, Vol. 36 ›› Issue (3): 1-11.doi: 10.11959/j.issn.1000-436x.2015053

• 学术论文 • 下一篇

基于图划分的个性化轨迹隐私保护方法

杨静,张冰(),张健沛,谢静

哈尔滨工程大学计算机科学与技术学院，黑龙江哈尔滨 150001

出版日期:2015-03-25 发布日期:2017-06-21
基金资助:
国家自然科学基金资助项目;国家自然科学基金资助项目;国家自然科学基金资助项目;高等学校博士学科点专项科研基金资助项目;高等学校博士学科点专项科研基金资助项目;哈尔滨市科技创新人才研究专项基金资助项目

Personalized trajectory privacy preserving method based on graph partition

Jing YANG,Bing ZHANG(),Jian-pei ZHANG,Jing XIE

College of Computer Science and Technology, Harbin Engineering University, Harbin 150001, China

Online:2015-03-25 Published:2017-06-21
Supported by:
The National Natural Science Foundation of China;The National Natural Science Foundation of China;The National Natural Science Foundation of China;The National Research Foundation for the Doctoral Program of Higher Education of China;The National Research Foundation for the Doctoral Program of Higher Education of China;The Harbin Outstanding Academic Leader Foundation of Heilongjiang Province of China

摘要/Abstract

摘要：

针对用户对轨迹匿名数据的个性化需求，提出一种基于轨迹间夹角和位置重合的(s,λ)-覆盖个性化轨迹间关联构建方法，并根据轨迹间距离和方向度量轨迹间边权，以构造规模可变的个性化轨迹图模型。同时，将轨迹k-匿名集的构建转化为轨迹图划分问题，提出了一种基于贪心策略寻找近似最优的k条轨迹构建轨迹k-匿名集的方法。通过对比实验，在合成轨迹数据集上验证了所提算法的有效性和合理性。

关键词: 隐私安全, 个性化, 图划分, (s,λ)-覆盖, 轨迹间夹角

Abstract:

A (s,λ)-overlap was proposed which based on the angle and location between two trajectories to construct the relationship between them, and also measure the weight between two trajectories by trajectory angle and distance, to-gether to construct the personal trajectory graph model. Then a greedy partition method to was proposed construct trajec-tory k-anonymization sets by finding the approximate optimal k trajectories. Experiment results on synthetic dataset show the effectiveness and reasonableness of proposed method.

Key words: privacy security, personalized; graph partition, (s,λ)-overlap, trajectory angel

杨静,张冰,张健沛,谢静. 基于图划分的个性化轨迹隐私保护方法[J]. 通信学报, 2015, 36(3): 1-11.

Jing YANG,Bing ZHANG,Jian-pei ZHANG,Jing XIE. Personalized trajectory privacy preserving method based on graph partition[J]. Journal on Communications, 2015, 36(3): 1-11.

图/表 14

图1

图2

表1

图3

图4

图5

图6

图7

图8

图9

图10

图11

图12

图13

参考文献 15

[1]	MOKBEL M F . Privacy in location-based services: start-of-the-art and research directions[A]. The Int Conf on Mobile Data Management (MDM'07)[C]. Mannheim: IEEE, German, 2007.228-235.
[2]	吴英杰，唐庆明，倪巍伟．基于聚类杂交的隐私保护轨迹数据发布算法[J]．计算机研究与发展， 2013,50(3):578-593. WU Y J , TANG Q M , NI W W . A clustering hybrid based algorithm for privacy preserving trajectory data publishing[J]. Journal of Com-puter Research and Development, 2013,50(3):578-593.
[3]	张建明，赵玉娟，姜浩斌等．车辆自组网的位置隐私保护技术研究[J]．通信学报， 2012,33(8):180-189. ZHANG J M , ZHAO Y J , JIANG H B , et al. Research on protection technology for location privacy in VANET[J]. Journal on Communications, 2012,33(8):180-189.
[4]	CHOW C , MOKBEL M F , LIU X . A peer-to-peer spatial cloaking algorithm for anonymous location-based services[A]. Proc of the ACM Symposium on Advances in Geographic Information Systems(ACM GIS'06)[C]. Arlington: ACM, USA, 2006.171-178.
[5]	GHINITA G , KALNIS P , KHOSHGOZARAN A . Private queries in location based services: anonymizers are not necessary[A]. ACM SIGMOD Int Conf on Management of data (SIGMOD'08)[C]. New York: ACM, USA, 2008.121-132.
[6]	GRUTESER M , GRUNWALD D . Anonymous usage of loca-tion-based services through spatial and temporal cloaking[A]. Proc of the Int Conf on Mobile Systems, Applications, and Services (Mobi-Sys'03)[C]. San Francisco: USA, 2003.163-168.
[7]	SWEENEY L . k-Anonymity: a model for protecting privacy[J]. International Journal on Uncertainty, Fuzziness and Konwledge Based Systems, 2002,10(5):557-570.
[8]	ARIS G D , PANOS K , VASSILIOS S . Providing k-anonymity in location based services[J] ACM SIGKDD Explorations Newsletter, 2010,1(12):3-10.
[9]	YAROVOY R , BONCHI F , LAK SHMANAN L V S . Anonymizing moving objects: how to hide a MOB in a crowd[A]. Proc of the 12th Int Conf on Extending Database Technology: Advances in Database Technology(EDBT'09)[C]. New York: ACM, USA, 2009.72-83.
[10]	CHOW C Y , MOHAMED F M . Trajectory privacy in location-based services and data publication[J]. ACM SIGKDD Explorations News-letter, 2011,1(13):19-29.
[11]	NERGIZ M E , ATZORI M , SAYGIN Y . Towards trajectory ano-nymization: a generalization-based approach[A]. Proc of the SIG-SPATIAL ACM GIS 2008 Int Workshop on Security and Privacy in GIS and LBS(SPRINGL'08)[C]. New York: ACM, USA, 2008.52-61.
[12]	ABUL O , BONCHI F , NANNI M . Never walk alone: uncertainty for anonymity in moving objects databases[A]. Proc of the IEEE 24th Int Conf on Data Engineering(ICDE'08)[C]. Cancun: IEEE, Mexico, 2008.376-385.
[13]	HUO Z , HU H , MENG X . History trajectory privacy-preserving through graph partition[A]. Proc of the 1st Int Conf on Mobile Location-based service(MLBS'11)[C]. Beijing: ACM, China, 2011.88-97.
[14]	GAO S , MA J , SUN C . Balancing trajectory privacy and data utility using a personalized anonymization model[J]. Journal of Network and Computer Applications, 2014,38:125-134.
[15]	BRINKHO T . Generating traffic data[J]. Bulletin of the Technical Committee on Data Engineering, 2003,26(2):19-25.

数据集	\|D\|	\|D_pre\|	\|D_TEC\|	Max	Min
OLDEN	10 000	27 844	141	392	53

基于图划分的个性化轨迹隐私保护方法

Personalized trajectory privacy preserving method based on graph partition

在线阅读

PDF下载

可视化

被引次数

摘要/Abstract

引用本文

使用本文

图/表 14

参考文献 15

相关文章 14

Metrics

推荐阅读 0

[1]	王瀚仪, 李效光, 毕文卿, 陈亚虹, 李凤华, 牛犇. 多级本地化差分隐私算法推荐框架[J]. 通信学报, 2022, 43(8): 52-64.
[2]	任永功,张云鹏,张志鹏. 基于粗糙集规则提取的协同过滤推荐算法[J]. 通信学报, 2020, 41(1): 76-83.
[3]	王海艳,陆金祥. 面向群组推荐的个性化隐私保护方法[J]. 通信学报, 2019, 40(9): 106-115.
[4]	张强,王国军,张少波. 基于多边缘服务器的个性化搜索隐私保护方法[J]. 通信学报, 2019, 40(2): 40-50.
[5]	俞艺涵,付钰,吴晓平. 基于Shannon信息熵与BP神经网络的隐私数据度量与分级模型[J]. 通信学报, 2018, 39(12): 10-17.
[6]	李永凯,刘树波,杨召唤,刘梦君. 机会网络中用户属性隐私安全的高效协作者资料匹配协议[J]. 通信学报, 2015, 36(12): 163-171.
[7]	刘胜宗,樊晓平,廖志芳,胡佳. 融合停留时间的隐Markov个性化推荐模型[J]. 通信学报, 2014, 35(9): 112-121.
[8]	孟祥武,史艳翠,王立才,张玉洁. 用户对移动网络服务偏好学习技术综述[J]. 通信学报, 2013, 34(2): 147-155.
[9]	张佩云,陈恩红,黄波. 基于社会网络面向个性化需求的可信服务推荐[J]. 通信学报, 2013, 34(12): 49-59.
[10]	琚春华,鲍福光. 基于情境和主体特征融入性的多维度个性化推荐模型研究[J]. 通信学报, 2012, 33(Z1): 17-27.
[11]	王媛,孙宇清,马乐乐. 面向社会网络的个性化隐私策略定义与实施[J]. 通信学报, 2012, 33(Z1): 239-249.
[12]	黄汝维,桂小林,余思,庄威. 云存储中隐私保护的关键字检索技术的研究[J]. 通信学报, 2011, 32(9A): 59-63.
[13]	陈志德,陈友勤,许力. RFID标签所有权转换安全协议[J]. 通信学报, 2010, 31(9A): 202-208.
[14]	罗奇,余英,赵呈领,曹艳. 自适应推荐算法在电子超市个性化服务系统中的应用研究[J]. 通信学报, 2006, 27(11): 183-186.