Privacy preserving nearest neighbor search

Mark Shaneck, Yongdae Kim, Vipin Kumar

Research output: Chapter in Book/Report/Conference proceedingConference contribution

39 Scopus citations

Abstract

Data mining is frequently obstructed by privacy concerns. In many cases data is distributed, and bringing the data together in one place for analysis is not possible due to privacy laws (e.g. HIPAA) or policies. Privacy preserving data mining techniques have been developed to address this issue by providing mechanisms to mine the data while giving certain privacy guarantees. In this work we address the issue of privacy preserving nearest neighbor search, which forms the kernel of many data mining applications. To this end, we present a novel algorithm based on secure multi-party computation primitives to compute the nearest neighbors of records in horizontally distributed data. We show how this algorithm can be used in three important data mining algorithms, namely LOF outlier detection, SNN clustering, and kNN classification.

Original languageEnglish (US)
Title of host publicationProceedings - ICDM Workshops 2006 - 6th IEEE International Conference on Data Mining - Workshops
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages541-545
Number of pages5
ISBN (Print)0769527027, 9780769527024
DOIs
StatePublished - Jan 1 2006

Publication series

NameProceedings - IEEE International Conference on Data Mining, ICDM
ISSN (Print)1550-4786

Fingerprint Dive into the research topics of 'Privacy preserving nearest neighbor search'. Together they form a unique fingerprint.

Cite this