Two Party Hierarchical Clustering Over Horizontally Partitioned Data Set
Priya Kumari I · SSRN Electronic Journal · 2017
Data mining is a task in which data is extracted from the large database to make it in an understandable form or structure so that it can be used for further use. In this paper we present an approach by which the concept of hierarchical clustering applied over the horizontally partitioned data set. We also explain the desired algorithm like hierarchical clustering, algorithms for finding the minimum closest cluster. In this paper we also explain the two party computations. Privacy of any data is the most important thing in these days hence we present an approach by which we can apply privacy preservation over the two party which are distributing their data horizontally. We also explain about the hierarchical clustering which we are going to apply in our present method.