可扩展的基于密度的分布式聚类
Scalable Density-Based Distributed Clustering
摘要:
聚类已经成为分析大量数据的一项越来越重要的任务。传统的应用程序要求所有数据必须位于其被审查的站点。如今,大量的异构、复杂的数据驻留在不同的、独立工作的计算机上,这些计算机通过局域网或广域网相互连接。在本文中,我们提出了一个可扩展的基于密度的分布式聚类算法,它允许用户定义的聚类质量和从不同的本地站点到全球服务器站点的传输对象的数量之间的权衡。我们的方法包括以下步骤:首先,我们根据反映其适合作为当地代表的质量标准,将位于当地站点的所有对象排序。然后,我们将这些代表中最好的发送到服务器站点,在那里使用稍微增强的基于密度的聚类算法对它们进行聚类。这种方法是非常有效的,因为当地确定合适的代表可以迅速和独立地进行。此外,基于最合适的局部代表的可伸缩数量,全局聚类可以非常有效和高效地进行。在我们的实验评估中,我们将表明,我们的新的可扩展的基于密度的分布式聚类方法的结果在高质量的聚类与可扩展的传输成本。
英文摘要:
Clustering has become an increasingly important task in analysing huge amounts of data. Traditional applications require that all data has to be located at the site where it is scrutinized. Nowadays, large amounts of heterogeneous, complex data reside on different, independently working computers which are connected to each other via local or wide area networks. In this paper, we propose a scalable density-based distributed clustering algorithm which allows a user-defined trade-off between clustering quality and the number of transmitted objects from the different local sites to a global server site. Our approach consists of the following steps: First, we order all objects located at a local site according to a quality criterion reflecting their suitability to serve as local representatives. Then we send the best of these representatives to a server site where they are clustered with a slightly enhanced density-based clustering algorithm. This approach is very efficient, because the local detemination of suitable representatives can be carried out quickly and independently from each other. Furthermore, based on the scalable number of the most suitable local representatives, the global clustering can be done very effectively and efficiently. In our experimental evaluation, we will show that our new scalable density-based distributed clustering approach results in high quality clusterings with scalable transmission cost.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。