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

增量式K-means聚类算法的性能评估

Performance Evaluation of Incremental K-means Clustering Algorithm

Sanjay Chakraborty, N. K. Nagwani

摘要:

增量K-means聚类算法已经在论文[Chakraborty和Nagwani,2011]中提出和分析。这是一个非常创新的方法,适用于周期性增量的环境和处理大量的更新。本文利用大气污染数据库对增量式K均值聚类算法进行了性能评估。本文还描述了现有的K-均值聚类和增量K-均值聚类使用特定的数据库之间的性能评估的比较。它还评估了数据库中的特定变化点,增量K-means聚类的性能比现有的K-means聚类要好得多。数据库中的特定变化点被称为“阈值”或“数据库中的%增量变化”。本文还定义了增量K均值聚类算法的基本方法。

英文摘要:

The incremental K-means clustering algorithm has already been proposed and analysed in paper [Chakraborty and Nagwani, 2011]. It is a very innovative approach which is applicable in periodically incremental environment and dealing with a bulk of updates. In this paper the performance evaluation is done for this incremental K-means clustering algorithm using air pollution database. This paper also describes the comparison on the performance evaluations between existing K-means clustering and incremental K-means clustering using that particular database. It also evaluates that the particular point of change in the database upto which incremental K-means clustering performs much better than the existing K-means clustering. That particular point of change in the database is known as "Threshold value" or "% delta change in the database". This paper also defines the basic methodology for the incremental K-means clustering algorithm.

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

↑