Distributed privacy preserving k-means clustering with additive secret sharing

Recent concerns about privacy issues motivated data mining researchers to develop methods for performing data mining while preserving the privacy of individuals. However, the current techniques for privacy preserving data mining suffer from high communication and computation overheads which are prohibitive considering even a modest database size. Furthermore, the proposed techniques have strict assumptions on the involved parties which need to be relaxed in order to reflect the real-world requirements. In this paper we concentrate on a distributed scenario where the data is partitioned vertically over multiple sites and the involved sites would like to perform clustering without revealing their local databases. For this setting, we propose a new protocol for privacy preserving k-means clustering based on additive secret sharing. We show that the new protocol is more secure than the state of the art. Experiments conducted on real and synthetic data sets show that, in realistic scenario...

• Type: Conference
• Year: 2008
• Where: EDBT
• Authors: Albert Levi, Erkay Savas, Mahir Can Doganay, Thomas Brochmann Pedersen, Yücel Saygin
• Keywords: Data Mining, Database, EDBT 2008, Privacy Preserving Data, Privacy Preserving K-means