Generalizing data to provide anonymity when disclosing information (abstract)
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Privacy-preserving data mining
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
On the Privacy Preserving Properties of Random Data Perturbation Techniques
ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
IEEE Transactions on Knowledge and Data Engineering
Time-focused clustering of trajectories of moving objects
Journal of Intelligent Information Systems
Trajectory clustering: a partition-and-group framework
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Privacy Preservation in the Publication of Trajectories
MDM '08 Proceedings of the The Ninth International Conference on Mobile Data Management
Towards trajectory anonymization: a generalization-based approach
SPRINGL '08 Proceedings of the SIGSPATIAL ACM GIS 2008 International Workshop on Security and Privacy in GIS and LBS
Never Walk Alone: Uncertainty for Anonymity in Moving Objects Databases
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Anonymity in Location-Based Services: Towards a General Framework
MDM '07 Proceedings of the 2007 International Conference on Mobile Data Management
Performance evaluation metrics and statistics for positional tracker evaluation
ICVS'03 Proceedings of the 3rd international conference on Computer vision systems
Traffic density-based discovery of hot routes in road networks
SSTD'07 Proceedings of the 10th international conference on Advances in spatial and temporal databases
Nearest neighbor search on moving object trajectories
SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases
Privacy-preserving publication of trajectories using microaggregation
Proceedings of the 3rd ACM SIGSPATIAL International Workshop on Security and Privacy in GIS and LBS
Privacy-aware collection of aggregate spatial data
Data & Knowledge Engineering
Privacy preservation in the dissemination of location data
ACM SIGKDD Explorations Newsletter
Proceedings of the 4th ACM SIGSPATIAL International Workshop on Security and Privacy in GIS and LBS
Knowledge hiding from tree and graph databases
Data & Knowledge Engineering
Microaggregation- and permutation-based anonymization of movement data
Information Sciences: an International Journal
Breaching Euclidean distance-preserving data perturbation using few known inputs
Data & Knowledge Engineering
| Hi-index | 0.00 |
Trajectories are spatio-temporal traces of moving objects which contain valuable information to be harvested by spatio-temporal data mining techniques. Applications like city traffic planning, identification of evacuation routes, trend detection, and many more can benefit from trajectory mining. However, the trajectories of individuals often contain private and sensitive information, so anyone who possess trajectory data must take special care when disclosing this data. Removing identifiers from trajectories before the release is not effective against linkage type attacks, and rich sources of background information make it even worse. An alternative is to apply transformation techniques to map the given set of trajectories into another set where the distances are preserved. This way, the actual trajectories are not released, but the distance information can still be used for data mining techniques such as clustering. In this paper, we show that an unknown private trajectory can be reconstructed using the available background information together with the mutual distances released for data mining purposes. The background knowledge is in the form of known trajectories and extra information such as the speed limit. We provide analytical results which bound the number of the known trajectories needed to reconstruct private trajectories. Experiments performed on real trajectory data sets show that the number of known samples is surprisingly smaller than the actual theoretical bounds.