English

Performance Evaluation of Incremental K-means Clustering Algorithm

Information Retrieval 2014-06-19 v1 Databases

Abstract

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.

Keywords

Cite

@article{arxiv.1406.4737,
  title  = {Performance Evaluation of Incremental K-means Clustering Algorithm},
  author = {Sanjay Chakraborty and N. K. Nagwani},
  journal= {arXiv preprint arXiv:1406.4737},
  year   = {2014}
}
R2 v1 2026-06-22T04:41:28.715Z