Clustering Dynamic and Distributed Dataset using Decentralized Algorithm |
Author(s): |
| Mary Femy P. F , MAR ATHANASIUS COLLEGE OF ENGINEERING, KOTHAMANGALAM, KERALA, INDIA; Linda Sara Mathew, MAR ATHANASIUS COLLEGE OF ENGINEERING, KOTHAMANGALAM, KERALA, INDIA |
Keywords: |
| DCluster, Distributed dataset, Dynamic |
Abstract |
|
In many popular applications large amounts of data are distributed among multiple sources. Analysis of this data and identifying clusters is challenging due to storage, processing, and transmission costs. A decentralized clustering algorithm called DCluster, which is capable of clustering distributed and dynamic data sets. Nodes continuously cooperate through decentralized gossip-based communication to maintain summarized views of the data set. The summarized view is a basis for executing the clustering algorithms to produce approximations of the final clustering results. DCluster can cluster a data set which is dispersed among a large number of nodes in a distributed environment. In DCluster the complete data set is clustered in a fully decentralized fashion, such that each node obtains an accurate clustering model, without collecting the whole data set. |
Other Details |
|
Paper ID: IJSRDV4I40693 Published in: Volume : 4, Issue : 4 Publication Date: 01/07/2016 Page(s): 1484-1486 |
Article Preview |
|
|
|
|
