.png){kind=icon}
返回
GDCluster: A General Decentralized Clustering Algorithm
.png){kind=icon}
OA
AI
DOI：10.1109/TKDE.2015.2391123.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In many popular applications like peer-to-peer systems, large amounts of data are distributed among multiple sources. Analysis of this data and identifying clusters is challenging due to processing, storage, and transmission costs. In this paper, we propose GDCluster, a general fully decentralized clustering method, which is capable of clustering dynamic and distributed data sets. Nodes continuously cooperate through decentralized gossip-based communication to maintain summarized views of the data set. We customize GDCluster for execution of the partition-based and density-based clustering methods on the summarized views, and also offer enhancements to the basic algorithm. Coping with dynamic data is made possible by gradually adapting the clustering model. Our experimental evaluations show that GDCluster can discover the clusters efficiently with scalable transmission cost, and also expose its supremacy in comparison to the popular method LSP2P.
Keyword:
Distributed systems
clustering
partition-based clustering
density-based clustering
dynamic system
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.4
论文数:
6.8K
被引数:
3.2W
机构
引用论文
Ultrastrong Regulation Effect of the Electric Field on the All‐Carboatomic Ring Cyclo[18]Carbon**.png)
ChemPhysChem
ChemPhysChemIF0
PREAI
分享收藏分享收藏
查看更多内容