k-anonymity: a model for protecting privacy
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
An efficient clustering method for k-anonymization
PAIS '08 Proceedings of the 2008 international workshop on Privacy and anonymity in information society
Understanding mobility based on GPS data
UbiComp '08 Proceedings of the 10th international conference on Ubiquitous computing
SDM'10 Proceedings of the 7th VLDB conference on Secure data management
Bob-tree: an efficient B+-tree based index structure for geographic-aware obfuscation
ACIIDS'11 Proceedings of the Third international conference on Intelligent information and database systems - Volume Part I
Achieving k-anonymity by clustering in attribute hierarchical structures
DaWaK'06 Proceedings of the 8th international conference on Data Warehousing and Knowledge Discovery
International Journal of Mobile Computing and Multimedia Communications
ICT-EurAsia'13 Proceedings of the 2013 international conference on Information and Communication Technology
Semantic-Aware obfuscation for location privacy at database level
ICT-EurAsia'13 Proceedings of the 2013 international conference on Information and Communication Technology
Hi-index | 0.00 |
The development of location-based services and mobile devices has lead to an increase in the location data. Through the data mining process, some valuable information can be discovered from location data. However, the attackers may also extract some private (sensitive) information of the user and this can make threats against the user location privacy. Therefore, location privacy protection becomes a key factor to the success in privacy preserving in location-based services. In this paper, we propose a new approach as well as an algorithm to guarantee k-anonymity in a location database. The algorithm will maintain the association rules which have significance for the data mining process. Moreover, the algorithm also considers excluding new significant association rules created during the run of the algorithm.