Privacy Preserving Two-Party Hierarchical Clustering Over Vertically Partitioned Dataset

HTML  Download Download as PDF (Size: 278KB)  PP. 26-31  
DOI: 10.4236/jsea.2013.65B006    3,495 Downloads   5,079 Views  Citations

ABSTRACT

Data mining has been a popular research area for more than a decade. There are several problems associated with data mining. Among them clustering is one of the most interesting problems. However, this problem becomes more challenging when dataset is distributed between different parties and they do not want to share their data. So, in this paper we propose a privacy preserving two party hierarchical clustering algorithm vertically partitioned data set. Each site only learns the final cluster centers, but nothing about the individual’s data.

Share and Cite:

A. Tripathy and I. De, "Privacy Preserving Two-Party Hierarchical Clustering Over Vertically Partitioned Dataset," Journal of Software Engineering and Applications, Vol. 6 No. 5B, 2013, pp. 26-31. doi: 10.4236/jsea.2013.65B006.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.