Privacy-preserving k-means clustering over vertically partitioned data
Download
Author
Christopher Clifton
Tech report number
CERIAS TR 2003-47
Entry type
conference
Abstract
Privacy and security concerns can prevent sharing of data, derailing data mining projects. Distributed knowledge discovery, if done correctly, can alleviate this problem. The key is to obtain valid results, while providing guarantees on the (non)disclosure of data. We present a method for k-means clustering when different sites contain different attributes for a common set of entities. Each site learns the cluster of each entity, but learns nothing about the attributes at other sites.
Download
Date
2003 – 08
Address
Washington, D.C.
Key alpha
Clifton
Note
The Ninth ACM SIGKDD
International Conference on Knowledge Discovery and Data Mining
August 24-27, 2003 in Washington, D.C.
Honorable Mention, Best Paper Competition
Publication Date
2003-08-01

