arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1406.4751cs.DBcs.IR
收藏

增量K-means和增量DBSCAN算法的性能比较

Performance Comparison of Incremental K-means and Incremental DBSCAN Algorithms

Sanjay Chakraborty, N. K. Nagwani, Lopamudra Dey

摘要:

增量K-means和DBSCAN是目前大型动态数据库(数据仓库、WWW等)中两种非常重要和流行的聚类技术。增量K-means和增量DBSCAN的时间分析特性决定了它们的性能不同。这两种算法都是有效的比较,他们现有的算法在时间,成本和精力。本文对增量式DBSCAN聚类算法进行了性能评估,重点是与增量式K-means聚类算法进行了性能比较,并根据数据库中数据的变化说明了两种算法的特点。本文还解释了这两个最流行的聚类算法之间的一些逻辑差异。本文以一个大气污染数据库为原始数据库,进行了实验研究。

英文摘要:

Incremental K-means and DBSCAN are two very important and popular clustering techniques for today's large dynamic databases (Data warehouses, WWW and so on) where data are changed at random fashion. The performance of the incremental K-means and the incremental DBSCAN are different with each other based on their time analysis characteristics. Both algorithms are efficient compare to their existing algorithms with respect to time, cost and effort. In this paper, the performance evaluation of incremental DBSCAN clustering algorithm is implemented and most importantly it is compared with the performance of incremental K-means clustering algorithm and it also explains the characteristics of these two algorithms based on the changes of the data in the database. This paper also explains some logical differences between these two most popular clustering algorithms. This paper uses an air pollution database as original database on which the experiment is performed.

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

↑