A Clustering-Based Approach for Personalized Privacy Preserving Publication of Moving Object Trajectory Data

With the growing prevalence of location-aware devices, the amount of trajectories generated by moving objects has been dramatically increased, resulting in various novel data mining applications. Since trajectories may contain sensitive information about their moving objects, so they ought to be anonymized before making them accessible to the public. Many existing approaches for trajectory anonymization consider the same privacy level for all moving objects, whereas different moving objects may have different privacy requirements. In this paper, we propose a novel greedy clustering-based approach for anonymizing trajectory data in which the privacy requirements of moving objects are not necessarily the same. We first assign a privacy level to each trajectory based on the privacy requirement of its moving object. We then partition trajectories into a set of fixed-radius clusters based on the EDR distance. Each cluster is created such that its size is proportional to the maximum privacy level of trajectories within it. We finally anonymize trajectories of each cluster using a novel matching point algorithm. The experimental results show that our approach can achieve a satisfactory trade-off between space distortion and re-identification probability of trajectory data, which is proportional to the privacy requirement of each moving object.

[1]  Pierangela Samarati,et al.  Protecting Respondents' Identities in Microdata Release , 2001, IEEE Trans. Knowl. Data Eng..

[2]  Latanya Sweeney,et al.  k-Anonymity: A Model for Protecting Privacy , 2002, Int. J. Uncertain. Fuzziness Knowl. Based Syst..

[3]  Thomas Brinkhoff,et al.  Generating Traffic Data , 2003, IEEE Data Eng. Bull..

[4]  Nikos Pelekis,et al.  Nearest Neighbor Search on Moving Object Trajectories , 2005, SSTD.

[5]  Lei Chen,et al.  Robust and fast similarity search for moving object trajectories , 2005, SIGMOD '05.

[6]  ASHWIN MACHANAVAJJHALA,et al.  L-diversity: privacy beyond k-anonymity , 2006, 22nd International Conference on Data Engineering (ICDE'06).

[7]  Jae-Gil Lee,et al.  Trajectory clustering: a partition-and-group framework , 2007, SIGMOD '07.

[8]  Sangkyum Kim,et al.  Anomaly Detection in Moving Object , 2008, Intelligence and Security Informatics.

[9]  Hsinchun Chen,et al.  Intelligence and Security Informatics, Techniques and Applications , 2008, Intelligence and Security Informatics.

[10]  Nikos Mamoulis,et al.  Privacy Preservation in the Publication of Trajectories , 2008, The Ninth International Conference on Mobile Data Management (mdm 2008).

[11]  Yücel Saygin,et al.  Towards trajectory anonymization: a generalization-based approach , 2008, SPRINGL '08.

[12]  Jae-Gil Lee,et al.  TraClass: trajectory classification using hierarchical region-based and trajectory-based clustering , 2008, Proc. VLDB Endow..

[13]  Francesco Bonchi,et al.  Never Walk Alone: Uncertainty for Anonymity in Moving Objects Databases , 2008, 2008 IEEE 24th International Conference on Data Engineering.

[14]  Laks V. S. Lakshmanan,et al.  Anonymizing moving objects: how to hide a MOB in a crowd? , 2009, EDBT '09.

[15]  Anna Monreale,et al.  Movement data anonymity through generalization , 2009, SPRINGL '09.

[16]  Nikos Pelekis,et al.  Clustering Trajectories of Moving Objects in an Uncertain World , 2009, 2009 Ninth IEEE International Conference on Data Mining.

[17]  Francesco Bonchi Privacy Preserving Publication of Moving Object Data , 2009, Privacy in Location-Based Applications.

[18]  Francesco Bonchi,et al.  Anonymization of moving objects databases by clustering and perturbation , 2010, Inf. Syst..

[19]  Chengyang Zhang,et al.  Advances in Spatial and Temporal Databases , 2015, Lecture Notes in Computer Science.