Privacy preserving in the publication of large-scale trajectory databases

6Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In recent years, preserving individual privacy when publishing trajectory data receives increasing attention. However, the existing trajectory data privacy preserving techniques cannot resolve the anonymous issues of large-scale trajectory databases. In traditional clustering constraint based trajectory privacy preserving algorithms, the anonymous groups lack of diversity and they cannot effectively prevent re-clustering attacks against the characteristics of publishing data. In this thesis, a segment clustering based privacy preserving algorithm is proposed. Firstly, the original database is divided into blocks and each block is treated as a separate database. Then, the trajectories in each block are partitioned into segments based on the minimum description length principle. Lastly, these segments are anonymized with cluster-constraint strategy. Experimental results show that the proposed algorithm can improve the safety and have good performance in data quality and anonymous efficiency.

Cite

CITATION STYLE

APA

Li, F., Gao, F., Yao, L., & Pan, Y. (2016). Privacy preserving in the publication of large-scale trajectory databases. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9784, pp. 367–376). Springer Verlag. https://doi.org/10.1007/978-3-319-42553-5_31

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free