期刊名称：International Journal of Data Mining & Knowledge Management Process
印刷版ISSN：2231-007X
电子版ISSN：2230-9608
出版年度：2017
卷号：7
期号：3
页码：33
DOI：10.5121/ijdkp.2017.7303
出版社：Academy & Industry Research Collaboration Center (AIRCC)
摘要：Data mining is a task in which data is extracted from the large database to make itin an understandableform or structure so that it can be used for further use. In this paper we present an approach by which theconcept of hierarchal clustering applied over the horizontally partitioned data set. We also explain thedesired algorithm like hierarichal clustering, algorithms for finding the minimum closest cluster. In thispaper wealso explain the two party computations. Privacy of any data is the most important thing in thesedays hence we present an approach by which we can apply privacy preservation over the two party whichare distributing their data horizontally. We also explain about the hierarichal clustering which we aregoing to apply in our present method.
关键词：Two party computations; Partitioning; clustering; k-means algorithm; Hierarichal clustering.
