Privacy-Preserving K-Means Clustering over Vertically Partitioned Data

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 di#erent sites contain di#erent attributes for a common set of entities. Each site learns the cluster of each entity, but learns nothing about the attributes at other sites