Differential privacy for location pattern mining

  • Authors:
  • Shen-Shyang Ho;Shuhua Ruan

  • Affiliations:
  • University of Maryland, College Park, Maryland;Sichuan University, Chengdu, Sichuan, China

  • Venue:
  • Proceedings of the 4th ACM SIGSPATIAL International Workshop on Security and Privacy in GIS and LBS
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

One main concern for individuals to participate in the data collection of personal location history records is the disclosure of their location and related information when a user queries for statistical or pattern mining results derived from these records. In this paper, we investigate how the privacy goal that the inclusion of one's location history in a statistical database with location pattern mining capabilities does not substantially increase one's privacy risk. In particular, we propose a differentially private pattern mining algorithm for interesting geographic location discovery using a region quadtree spatial decomposition to preprocess the location points followed by applying a density-based clustering algorithm. A differentially private region quadtree is used for both de-noising the spatial domain and identifying the likely geographic regions containing the interesting locations. Then, a differential privacy mechanism is applied to the algorithm outputs, namely: the interesting regions and their corresponding stay point counts. The quadtree spatial decomposition enables one to obtain a localized reduced sensitivity to achieve the differential privacy goal and accurate outputs. Experimental results on synthetic datasets are used to show the feasibility of the proposed privacy preserving location pattern mining algorithm.