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.
Keywordsprivacy preservation trajectory data moving object greedy clustering space distortion re-identification probability
Unable to display preview. Download preview PDF.
- 2.Lee, J.-G., Han, J., Li, X., Gonzalez, H.: raClass: Trajectory Classification Using Hierarchical Region-based and Trajectory-based Clustering. In: Proc. of the 34th Int. Conf. on Very Large Databases (VLDB 2008), Auckland, New Zealand (2008)Google Scholar
- 3.Lee, J.-G., Han, J., Whang, K.-Y.: Trajectory Clustering: a Partition-and-Group Framework. In: Proc. of the ACM SIGMOD Int. Conf. on Management of Data (SIGMOD 2007), Beijing, China, pp. 593–604 (2007)Google Scholar
- 5.Pelekis, N., Kopanakis, I., Kotsifakos, E.E., Frentzos, E., Theodoridis, Y.: Clustering Trajectories of Moving Objects in an Uncertain World. In: Proc. of the 9th IEEE Int. Conf. on Data Mining (ICDM 2009), Miami, USA, pp. 417–427 (2009)Google Scholar
- 6.Machanavajjhala, A., Kifer, D., Gehrke, J., Venkitasubramaniam, M.: l-diversity: Privacy beyond k-anonymity. ACM Transactions on Knowledge Discovery from Data 1(1) (2007)Google Scholar
- 9.Chen, L., Özsu, M.T., Oria, V.: Robust and Fast Similarity Search for Moving Object Trajectories. In: Proc. of the 24th ACM SIGMOD Int. Conf. on Management of Data (SIGMOD 2005), Maryland, USA, pp. 491–502 (2005)Google Scholar
- 10.Terrovitis, M., Mamoulis, N.: Privacy Preservation in the Publication of Trajectories. In: Proc. of the 9th Int. Conf. on Mobile Data Management (MDM 2008), Beijing, China, pp. 65–72 (2008)Google Scholar
- 11.Yarovoy, R., Bonchi, F., Lakshmanan, L.V.S., Wang, W.H.: Anonymizing Moving Objects: How to Hide a MOB in a Crowd? In: Proc. of the 12th Int. Conf. on Extending Database Technology (EDBT 2009), Saint Petersburg, Russia, pp. 72–83 (2009)Google Scholar
- 14.Abul, O., Bonchi, F., Nanni, M.: Never Walk Alone: Uncertainty for Anonymity in Moving Objects Databases. In: Proc. of the 24th IEEE Int. Conf. on Data Engineering (ICDE 2008), Cancun, Mexico, pp. 376–385 (2008)Google Scholar
- 17.Brinkhoff, T.: Generating Traffic Data. IEEE Data Engineering Bulletin 26(2), 19–25 (2003)Google Scholar