PRIVACY PRESERVING LOCATION DATA PUBLISHING: A MACHINE LEARNING APPROACH
DOI:
https://doi.org/10.46243/jst.2023.v8.i12.pp23-30Keywords:
Publishing of data, Machine learning, Privacy preserving.Abstract
Publishing datasets plays an essential role in open data research and promoting transparency of government agencies. However, such data publication might reveal users‟ private information. One of the most sensitive sources of data is spatiotemporal trajectory datasets. Unfortunately, merely removing unique identifiers cannot preserve the privacy of users. Adversaries may know parts of the trajectories or be able to link the published dataset to other sources for the purpose of user identification. Therefore, it is crucial to apply privacy preserving techniques before the publication of spatiotemporal trajectory datasets. In this paper, we propose a robust framework for the anonymization of spatiotemporal trajectory datasets termed as machine learning based anonymization (MLA). By introducing a new formulation of the problem, we are able to apply machine learning algorithms for clustering the trajectories and propose to use k-means algorithm for this purpose. A variation of k-means algorithm is also proposed to preserve the privacy in overly sensitive datasets. Moreover, we improve the alignment process by considering multiple sequence alignment as part of the MLA. The framework and all the proposed algorithms are applied to T-Drive, Geolife, and Gowalla location datasets. The experimental results indicate a significantly higher utility of datasets by anonymization based on MLA framework.
References
S. Shaham, M. Ding, B. Liu, Z. Lin, and J. Li, “Machine learning aided anonymization of spatiotemporal trajectory datasets,” arXiv preprint arXiv:1902.08934, 2019
A. Government, “New australian government data sharing and release legislation,” 2018
A. Tamersoy, G. Loukides, M. E. Nergiz, Y. Saygin, and B. Malin, “Anonymization of longitudinal electronic medical records,” IEEE Transactions on Information Technology in Biomedicine, vol. 16, no. 3, pp. 413–423, 2012
F. Xu, Z. Tu, Y. Li, P. Zhang, X. Fu, and D. Jin, “Trajectory recovery from ash: User privacy is not preserved in aggregated mobility data,” in Proceedings of the 26th International Conference on World Wide Web. International World Wide Web Conferences Steering Committee, 2017, pp. 1241–1250
Y. Dong and D. Pi, “Novel privacy-preserving algorithm based on frequent path for trajectory data publishing,” Knowledge-Based Systems, vol. 148, pp. 55–65, 2018
M. Gramaglia, M. Fiore, A. Tarable, and A. Banchs, “Towards privacy- preserving publishing of spatiotemporal trajectory data,” arXiv preprint arXiv:1701.02243, 2017
M. Terrovitis, G. Poulis, N. Mamoulis, and S. Skiadopoulos, “Local suppression and splitting techniques for privacy preserving publication of trajectories,” IEEE Trans. Knowl. Data Eng, vol. 29, no. 7, pp. 1466–1479, 2017
M. E. Nergiz, M. Atzori, and Y. Saygin, “Towards trajectory anonymization: a generalizationbased approach,” in Proc. of the SIGSPATIAL ACM GIS. ACM, 2008, pp. 52–61
S. Gurung, D. Lin, W. Jiang, A. Hurson, and R. Zhang, “Traffic information publication with privacy preservation,” ACM Transactions on Intelligent Systems and Technology (TIST), vol. 5, no. 3, p. 44, 2014
R. Yarovoy, F. Bonchi, L. V. Lakshmanan, and W. H. Wang, “Anonymizing moving objects: How to hide a mob in a crowd?” in Proc. of the 12th International Conference on Extending Database Technology: Advances in Database Technology. ACM, 2009, pp. 72–83
B. Liu, W. Zhou, T. Zhu, L. Gao, and Y. Xiang, “Location privacy and its applications: A systematic study,” IEEE Access, vol. 6, pp. 17 606–17 624, 2018
G. Poulis, G. Loukides, S. Skiadopoulos, and A. GkoulalasDivanis, “Anonymizing datasets with demographics and diagnosis codes in the presence of utility constraints,” Journal of biomedical informatics, vol. 65, pp. 76–96, 2017
T. Takahashi and S. Miyakawa, “Cmoa: Continuous moving object anonymization,” in Proceedings of the 16th International Database Engineering & Applications Sysmposium. ACM, 2012, pp. 81–90
X. Zhou and M. Qiu, “A k-anonymous full domain generalization algorithm based on heap sort,” in International Conference on Smart Computing and Communication. Springer, 2018, pp. 446–459
