Movement data anonymity through generalization
Gennady Andrienko,Natalia Andrienko,Fosca Giannotti,Anna Monreale,Dino Pedreschi +4 more
- 03 Nov 2009
- pp 27-31
TL;DR: This position paper briefly presents an approach for the generalization of movement data that can be adopted for obtaining k-anonymity in spatio-temporal datasets and can be used to realize a framework for publishing of spatio/temporal data while preserving privacy.
read more
Abstract: In recent years, spatio-temporal and moving objects databases have gained considerable interest, due to the diffusion of mobile devices (e.g., mobile phones, RFID devices and GPS devices) and of new applications, where the discovery of consumable, concise, and applicable knowledge is the key step. Clearly, in these applications privacy is a concern, since models extracted from this kind of data can reveal the behavior of group of individuals, thus compromising their privacy. Movement data present a new challenge for the privacy-preserving data mining community because of their spatial and temporal characteristics.In this position paper we briefly present an approach for the generalization of movement data that can be adopted for obtaining k-anonymity in spatio-temporal datasets; specifically, it can be used to realize a framework for publishing of spatio-temporal data while preserving privacy. We ran a preliminary set of experiments on a real-world trajectory dataset, demonstrating that this method of generalization of trajectories preserves the clustering analysis results.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Inferring social ties from geographic coincidences
David J. Crandall,Lars Backstrom,Dan Cosley,Siddharth Suri,Daniel P. Huttenlocher,Jon Kleinberg +5 more
TL;DR: A framework for quantifying the answers to questions about social ties between people is developed, and this framework is applied to publicly available data from a social media site, finding that even a very small number of co-occurrences can result in a high empirical likelihood of a social tie.
574
Unveiling the complexity of human mobility by querying and mining massive trajectory data
Fosca Giannotti,Mirco Nanni,Dino Pedreschi,Fabio Pinelli,Chiara Renso,Salvatore Rinzivillo,Roberto Trasarti +6 more
- 01 Oct 2011
TL;DR: This work presents the results of a large-scale experiment, based on the detailed trajectories of tens of thousands private cars with on-board GPS receivers, tracked during weeks of ordinary mobile activity, showing the striking analytical power of massive collections of trajectory data in unveiling the complexity of human mobility.
Differentially private sequential data publication via variable-length n-grams
Rui Chen,Gergely Acs,Claude Castelluccia +2 more
- 16 Oct 2012
TL;DR: A variable-length n-gram model is employed, which extracts the essential information of a sequential database in terms of a set of variable- length n- grams, and a solution for generating a synthetic database, which enables a wider spectrum of data analysis tasks.
openPDS: Protecting the Privacy of Metadata through SafeAnswers
TL;DR: OpenPDS as mentioned in this paper is a personal metadata management framework that allows individuals to collect, store, and give fine-grained access to their metadata to third parties and SafeAnswers, a new and practical way of protecting the privacy of metadata at an individual level, turns a hard anonymization problem into a more tractable security one.
Differentially private transit data publication: a case study on the montreal transportation system
Rui Chen,Benjamin C. M. Fung,Bipin C. Desai,Nériah M. Sossou +3 more
- 12 Aug 2012
TL;DR: This paper presents an efficient data-dependent yet differentially private transit data sanitization approach based on a hybrid-granularity prefix tree structure, and is the first paper to introduce a practical solution for publishing large volume of sequential data under differential privacy.
References
OPTICS: ordering points to identify the clustering structure
Mihael Ankerst,Markus M. Breunig,Hans-Peter Kriegel,Jörg Sander +3 more
- 01 Jun 1999
TL;DR: A new algorithm is introduced for the purpose of cluster analysis which does not produce a clustering of a data set explicitly; but instead creates an augmented ordering of the database representing its density-based clustering structure.
4.6K
L-diversity: privacy beyond k-anonymity
Ashwin Machanavajjhala,Johannes Gehrke,Daniel Kifer,Muthuramakrishnan Venkitasubramaniam +3 more
- 03 Apr 2006
TL;DR: This paper shows with two simple attacks that a \kappa-anonymized dataset has some subtle, but severe privacy problems, and proposes a novel and powerful privacy definition called \ell-diversity, which is practical and can be implemented efficiently.
L-diversity: Privacy beyond k-anonymity
TL;DR: This paper shows with two simple attacks that a \kappa-anonymized dataset has some subtle, but severe privacy problems, and proposes a novel and powerful privacy definition called \ell-diversity, which is practical and can be implemented efficiently.
t-Closeness: Privacy Beyond k-Anonymity and l-Diversity
Ninghui Li,Tiancheng Li,Suresh Venkatasubramanian +2 more
- 15 Apr 2007
TL;DR: T-closeness as mentioned in this paper requires that the distribution of a sensitive attribute in any equivalence class is close to the distributions of the attribute in the overall table (i.e., the distance between the two distributions should be no more than a threshold t).
Privacy-preserving data mining
Rakesh Agrawal,Ramakrishnan Srikant +1 more
- 16 May 2000
TL;DR: This work considers the concrete case of building a decision-tree classifier from training data in which the values of individual records have been perturbed and proposes a novel reconstruction procedure to accurately estimate the distribution of original data values.
3.5K