A Clustering-Anonymity Approach for Trajectory Data Publishing Considering both Distance and Direction

Journal of Computing and Information Technology

Huo-wen Jiang¹  Ke-kun Hu² 

[1] Jiangxi Science and Technology Normal University, Nanchang, China;State Key Laboratory of High-end Server and Storage Technology, Inspur Group Co. Ltd., Jinan, China;

关键词: Trajectory data, Privacy-preserving, Clustering-anonymity, Distance, Direction;   

DOI  :  

来源: DOAJ

【 摘 要 】

Trajectory data contains rich spatio-temporal information of moving objects. Directly publishing it for mining and analysis will result in severe privacy disclosure problems. Most existing clustering-anonymity methods cluster trajectories according to either distance- or direction-based similarities, leading to a high information loss. To bridge this gap, in this paper, we present a clustering-anonymity approach considering both these two types of similarities. As trajectories may not be synchronized, we first design a trajectory synchronization algorithm to synchronize them. Then, two similarity metrics between trajectories are quantitatively defined, followed by a comprehensive one. Furthermore, a clustering-anonymity algorithm for trajectory data publishing with privacy-preserving is proposed. It groups trajectories into clusters according to the comprehensive similarity metric. These clusters are finally anonymized. Experimental results show that our algorithm is effective in preserving privacy with low information loss.

【 授权许可】

Unknown