哈尔滨工程大学计算机科学与技术学院,黑龙江,哈尔滨,150001
纸质出版:2015
移动端阅览
王超, 杨静, 张健沛. 基于稀疏化最小生成树聚类的个性化轨迹隐私保护算法[J]. 电子学报, 2015,43(11):2338-2344.
WANG Chao, YANG Jing, ZHANG Jian-pei. The Sparse Minimum Spanning Tree Clustering Based Personalized Trajectory Privacy Protection Algorithm[J]. Acta Electronica Sinica, 2015, 43(11): 2338-2344.
王超, 杨静, 张健沛. 基于稀疏化最小生成树聚类的个性化轨迹隐私保护算法[J]. 电子学报, 2015,43(11):2338-2344. DOI: 10.3969/j.issn.0372-2112.2015.11.029.
WANG Chao, YANG Jing, ZHANG Jian-pei. The Sparse Minimum Spanning Tree Clustering Based Personalized Trajectory Privacy Protection Algorithm[J]. Acta Electronica Sinica, 2015, 43(11): 2338-2344. DOI: 10.3969/j.issn.0372-2112.2015.11.029.
现有的轨迹匿名算法没有充分考虑轨迹内外在特征信息以及移动对象个性化的隐私需求.为此
本文提出个性化轨迹
k
-匿名的概念
并提出轨迹结构相似性度量模型
综合考虑轨迹方向、速度、转角和位置等内外在特征信息;然后
提出基于稀疏化最小生成树聚类的个性化隐私保护算法
通过稀疏化的方法降低最小生成树聚类的执行时间
通过贪婪策略生成近似最优的轨迹
k
-匿名集合.实验结果表明
本文的轨迹结构相似性度量模型能更加准确地度量轨迹间的相似性
所提算法花费了更少的时间代价
具有更高的数据可用性.
The existing trajectory anonymity methods can not reflect the trajectory internal and external characteristics information well
and ignore personalized privacy requirements of moving objects.To solve these problems
we propose a new similarity measure model of trajectory structure
which considers the trajectory internal and external characteristics information of direction、speed、angle and location.On this basis
we propose the sparse minimum spanning tree clustering based personalized trajectory privacy protection algorithm.It reduces runtime by sparse methods
and generates an approximate optimal trajectory
k
-anonymity set by greedy strategy.Finally
the results showed our new similarity measure model of trajectory
structure can calculate distance of trajectories more accurately
and our method offers better utility and costs less time than previous proposals in the literature.
0
浏览量
3
下载量
1
CSCD
关联资源
相关文章
相关作者
相关机构
京公网安备11010802024621