Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Coresets for differentially private k-means clustering and applications to privacy in mobile sensor networks

Coresets for differentially private k-means clustering and applications to privacy in mobile sensor networks

Thumbnail Image
Download
Name

document.pdf

Description
Accepted version
Size

1.94 MB

Format

Adobe PDF

Checksum (MD5)

3f99cfb0af1611e48e055bdd4b4c53fb

sword-2019-07-17T14:45:18.original.xml (130 B)
Original SWORD entry document
Author(s)
Feldman, Dan
•
Xiang, Chongyuan
•
Zhu, Ruihao
•
Rus, Daniela
Date Issued
April 18, 2017
Publisher
ACM
Citation
Feldman, Dan, Xiang, Chongyuan, Zhu, Ruihao and Rus, Daniela. 2017. "Coresets for differentially private k-means clustering and applications to privacy in mobile sensor networks."
Version
Author's final manuscript
Abstract
Mobile sensor networks are a great source of data. By collecting data with mobile sensor nodes from individuals in a user community, e.g. using their smartphones, we can learn global information such as traffic congestion patterns in the city, location of key community facilities, and locations of gathering places. Can we publish and run queries on mobile sensor network databases without disclosing information about individual nodes? Differential privacy is a strong notion of privacy which guarantees that very little will be learned about individual records in the database, no matter what the attackers already know or wish to learn. Still, there is no practical system applying differential privacy algorithms for clustering points on real databases. This paper describes the construction of small coresets for computing k-means clustering of a set of points while preserving differential privacy. As a result, we give the first k-means clustering algorithm that is both differentially private, and has an approximation error that depends sub-linearly on the data's dimension d. Previous results introduced errors that are exponential in d. We implemented this algorithm and used it to create differentially private location data from GPS tracks. Specifically our algorithm allows clustering GPS databases generated from mobile nodes, while letting the user control the introduced noise due to privacy. We provide experimental results for the system and algorithms, and compare them to existing techniques. To the best of our knowledge, this is the first practical system that enables differentially private clustering on real data.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
http://creativecommons.org/licenses/by-nc-sa/4.0/
Persistent DSpace Link
https://hdl.handle.net/1721.1/137234
DOI of Published Version
https://doi.org/10.1145/3055031.3055090
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.