{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,28]],"date-time":"2026-08-28T06:29:34Z","timestamp":1787898574960,"version":"build-2784847793"},"reference-count":31,"publisher":"MDPI AG","issue":"12","license":[{"start":{"date-parts":[[2018,12,14]],"date-time":"2018-12-14T00:00:00Z","timestamp":1544745600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100003448","name":"General Secretariat for Research and Technology","doi-asserted-by":"publisher","award":["343"],"award-info":[{"award-number":["343"]}],"id":[{"id":"10.13039\/501100003448","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>In the context of this research work, we studied the problem of privacy preserving on spatiotemporal databases. In particular, we investigated the k-anonymity of mobile users based on real trajectory data. The k-anonymity set consists of the k nearest neighbors. We constructed a motion vector of the form (x,y,g,v) where x and y are the spatial coordinates, g is the angle direction, and v is the velocity of mobile users, and studied the problem in four-dimensional space. We followed two approaches. The former applied only k-Nearest Neighbor (k-NN) algorithm on the whole dataset, while the latter combined trajectory clustering, based on K-means, with k-NN. Actually, it applied k-NN inside a cluster of mobile users with similar motion pattern (g,v). We defined a metric, called vulnerability, that measures the rate at which k-NNs are varying. This metric varies from     1 k     (high robustness) to 1 (low robustness) and represents the probability the real identity of a mobile user being discovered from a potential attacker. The aim of this work was to prove that, with high probability, the above rate tends to a number very close to     1 k     in clustering method, which means that the k-anonymity is highly preserved. Through experiments on real spatial datasets, we evaluated the anonymity robustness, the so-called vulnerability, of the proposed method.<\/jats:p>","DOI":"10.3390\/a11120207","type":"journal-article","created":{"date-parts":[[2018,12,14]],"date-time":"2018-12-14T12:11:08Z","timestamp":1544789468000},"page":"207","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Trajectory Clustering and k-NN for Robust Privacy Preserving Spatiotemporal Databases"],"prefix":"10.3390","volume":"11","author":[{"given":"Elias","family":"Dritsas","sequence":"first","affiliation":[{"name":"Department of Computer Engineering and Informatis, University of Patras, 265 04 Patra, Greece"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7793-0407","authenticated-orcid":false,"given":"Maria","family":"Trigka","sequence":"additional","affiliation":[{"name":"Department of Computer Engineering and Informatis, University of Patras, 265 04 Patra, Greece"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Panagiotis","family":"Gerolymatos","sequence":"additional","affiliation":[{"name":"Department of Informatics, Ionian University, 491 00 Kerkira, Greece"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Spyros","family":"Sioutas","sequence":"additional","affiliation":[{"name":"Department of Computer Engineering and Informatis, University of Patras, 265 04 Patra, Greece"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2018,12,14]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"2075","DOI":"10.1109\/TPDS.2014.2347286","article-title":"A cloud-friendly RFID trajectory clustering algorithm in uncertain environments","volume":"26","author":"Wu","year":"2015","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Sun, P., Xia, S., Yuan, G., and Li, D. (2016). An overview of moving object trajectory compression algorithms. Math. Probl. Eng., 2016.","DOI":"10.1155\/2016\/6587309"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/s10462-016-9477-7","article-title":"A review of moving object trajectory clustering algorithms","volume":"47","author":"Yuan","year":"2017","journal-title":"Artif. Intell. Rev."},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Niu, B., Li, Q., Zhu, X., Cao, G., and Li, H. (May, January 27). Achieving k-anonymity in privacy-aware location-based services. Proceedings of the IEEE INFOCOM 2014-IEEE Conference on Computer Communications, Toronto, ON, Canada.","DOI":"10.1109\/INFOCOM.2014.6848002"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"582","DOI":"10.3390\/a7040582","article-title":"Processing knn queries in grid-based sensor networks","volume":"7","author":"Huang","year":"2014","journal-title":"Algorithms"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Zhou, P.Y., and Chan, K.C. (2014). A Model-Based Multivariate Time Series Clustering Algorithm. Pacific-Asia Conference on Knowledge Discovery and Data Mining, Springer.","DOI":"10.1007\/978-3-319-13186-3_72"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"177","DOI":"10.3390\/a8020177","article-title":"An Adaptive Spectral Clustering Algorithm Based on the Importance of Shared Nearest Neighbors","volume":"8","author":"He","year":"2015","journal-title":"Algorithms"},{"key":"ref_8","first-page":"13","article-title":"Comparison of K-means and Fuzzy C-means algorithms on different cluster structures","volume":"6","author":"Cebeci","year":"2015","journal-title":"J. Agric. Inform."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"276589","DOI":"10.1155\/2014\/276589","article-title":"A machine learning approach for specification of spinal cord injuries using fractional anisotropy values obtained from diffusion tensor images","volume":"2014","author":"Tay","year":"2014","journal-title":"Comput. Math. Methods Med."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Guzman, J.C., Melin, P., and Prado-Arechiga, G. (2017). Design of an optimized fuzzy classifier for the diagnosis of blood pressure with a new computational method for expert rule optimization. Algorithms, 10.","DOI":"10.3390\/a10030079"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Feng, Y., Zhou, J., and Tayyab, M. (2017). Kernel Clustering with a Differential Harmony Search Algorithm for Scheme Classification. Algorithms, 10.","DOI":"10.3390\/a10010014"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/j.jss.2015.03.068","article-title":"SMaRT: A novel framework for addressing range queries over nonlinear trajectories","volume":"105","author":"Gerolymatos","year":"2015","journal-title":"J. Syst. Softw."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"1103","DOI":"10.12785\/amis\/080321","article-title":"A survey of privacy preserving data publishing using generalization and suppression","volume":"8","author":"Xu","year":"2014","journal-title":"Appl. Math. Inf. Sci."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"771","DOI":"10.1007\/s00778-014-0351-4","article-title":"Enhancing data utility in differential privacy via microaggregation-based k-anonymity","volume":"23","year":"2014","journal-title":"Int. J. Very Large Data Bases"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1016\/j.tree.2014.05.004","article-title":"Automated image-based tracking and its application in ecology","volume":"29","author":"Dell","year":"2014","journal-title":"Trends Ecol. Evol."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Attanasi, A., Cavagna, A., Del Castello, L., Giardina, I., Melillo, S., Parisi, L., Pohl, O., Rossaro, B., Shen, E., and Silvestri, E. (2014). Collective behaviour without collective order in wild swarms of midges. PLoS Comput. Biol., 10.","DOI":"10.1371\/journal.pcbi.1003697"},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Magkos, E., Kotzanikolaou, P., Magioladitis, M., Sioutas, S., and Verykios, V.S. (2014). Towards secure and practical location privacy through private equality testing. International Conference on Privacy in Statistical Databases, Springer.","DOI":"10.1007\/978-3-319-11257-2_24"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"815613","DOI":"10.1155\/2015\/815613","article-title":"A privacy-preserving continuous location monitoring system for location-based services","volume":"11","author":"Song","year":"2015","journal-title":"Int. J. Distrib. Sens. Netw."},{"key":"ref_19","first-page":"1062","article-title":"Clustering Based K-anonymity Algorithm for Privacy Preservation","volume":"19","author":"Ni","year":"2017","journal-title":"Int. J. Netw. Secur."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Wang, D., Cui, P., and Zhu, W. (2016, January 13\u201317). Structural deep network embedding. Proceedings of the 22nd ACM SIGKDD International Conference On Knowledge Discovery and Data Mining, San Francisco, CA, USA.","DOI":"10.1145\/2939672.2939753"},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Mudgal, S., Li, H., Rekatsinas, T., Doan, A., Park, Y., Krishnan, G., Deep, R., Arcaute, E., and Raghavendra, V. (2018, January 10\u201315). Deep Learning for Entity Matching: A Design Space Exploration. Proceedings of the 2018 International Conference on Management of Data, Houston, TX, USA.","DOI":"10.1145\/3183713.3196926"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Zhang, L., and Tao, J. (2018). Research on Degeneration Model of Neural Network for Deep Groove Ball Bearing Based on Feature Fusion. Algorithms, 11.","DOI":"10.3390\/a11020021"},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Qu, H., Wang, M., Zhang, C., and Wei, Y. (2018). A Study on Faster R-CNN-Based Subway Pedestrian Detection with ACE Enhancement. Algorithms, 11.","DOI":"10.3390\/a11120192"},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Madhusudhanan, S., and Jaganathan, S. (2018). Incremental Learning for Classification of Unstructured Data Using Extreme Learning Machine. Algorithms, 11.","DOI":"10.3390\/a11100158"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1145\/3003665.3003669","article-title":"Database meets deep learning: Challenges and opportunities","volume":"45","author":"Wang","year":"2016","journal-title":"ACM SIGMOD Rec."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/j.procs.2015.07.286","article-title":"Big data analytics in the cloud: Spark on hadoop vs mpi\/openmp on beowulf","volume":"53","author":"Oneto","year":"2015","journal-title":"Procedia Comput. Sci."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"1772","DOI":"10.14778\/2733004.2733082","article-title":"Mariana: Tencent deep learning platform and its applications","volume":"7","author":"Zou","year":"2014","journal-title":"Proc. VLDB Endow."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"1175","DOI":"10.3390\/a8041175","article-title":"A data analytic algorithm for managing, querying, and processing uncertain big data in cloud environments","volume":"8","author":"Jiang","year":"2015","journal-title":"Algorithms"},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Xie, Y., and Zheng, M. (2016). A Differentiated Anonymity Algorithm for Social Network Privacy Preservation. Algorithms, 9.","DOI":"10.3390\/a9040085"},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Cuzzocrea, A. (2016). Algorithms for Managing, Querying and Processing Big Data in Cloud Environments. Algorithms, 9.","DOI":"10.3390\/a9010013"},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"1425","DOI":"10.14778\/3007263.3007279","article-title":"SystemML: Declarative machine learning on spark","volume":"9","author":"Boehm","year":"2016","journal-title":"Proc. VLDB Endow."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/11\/12\/207\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T15:34:07Z","timestamp":1760196847000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/11\/12\/207"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,14]]},"references-count":31,"journal-issue":{"issue":"12","published-online":{"date-parts":[[2018,12]]}},"alternative-id":["a11120207"],"URL":"https:\/\/doi.org\/10.3390\/a11120207","relation":{},"ISSN":["1999-4893"],"issn-type":[{"value":"1999-4893","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,12,14]]}}}