arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1802.00304cs.DB
收藏

空间数据采掘的分布式聚类算法

Distributed Clustering Algorithm for Spatial Data Mining

Malika Bendechache, M-Tahar Kechadi

摘要:

分布式数据采掘技术和主要的分布式聚类技术在过去十年中得到了广泛的应用,因为它们处理的是非常大的和异构的数据集,这些数据集不能集中收集。目前的分布式聚类方法通常是通过聚合在每个站点上获得的本地结果来生成全局模型。虽然这种方法挖掘数据集的位置,聚合阶段是复杂的,这可能会产生不正确和模糊的全球集群,因此不正确的知识。在本文中,我们提出了一种新的聚类方法非常大的空间数据集是异构和分布式的。该方法基于K-means算法,但它动态地生成全局聚类的数量。此外,这种方法使用了一个精心设计的汇总阶段。聚合阶段的设计使得整个过程在时间和内存分配方面都是高效的。初步结果表明,所提出的方法产生高质量的结果和规模以及。我们还比较了两个流行的聚类算法,并表明这种方法是更有效的。

英文摘要:

Distributed data mining techniques and mainly distributed clustering are widely used in the last decade because they deal with very large and heterogeneous datasets which cannot be gathered centrally. Current distributed clustering approaches are normally generating global models by aggregating local results that are obtained on each site. While this approach mines the datasets on their locations the aggregation phase is complex, which may produce incorrect and ambiguous global clusters and therefore incorrect knowledge. In this paper we propose a new clustering approach for very large spatial datasets that are heterogeneous and distributed. The approach is based on K-means Algorithm but it generates the number of global clusters dynamically. Moreover, this approach uses an elaborated aggregation phase. The aggregation phase is designed in such a way that the overall process is efficient in time and memory allocation. Preliminary results show that the proposed approach produces high quality results and scales up well. We also compared it to two popular clustering algorithms and show that this approach is much more efficient.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑