publication . Preprint . 2014

Performance Evaluation of Incremental K-means Clustering Algorithm

Chakraborty, Sanjay; Nagwani, N. K.;
Open Access English
  • Published: 18 Jun 2014
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...
free text keywords: Computer Science - Information Retrieval, Computer Science - Databases
Download from

[1] Bakar, Deris and Alhadi, Z.A., M.M., A.C., 2005: Performance analysis of partitional and incremental clustering, SNATI, ISBN-979-756- 061-6. [OpenAIRE]

[2] Chakraborty and Nagwani, S. and N.K.,2011, Analysis and Study of Incremental K-Means Clustering Algorithm, accepted by International conference on high performance architecture and grid computing (HPAGC) sponsored by Springer Germany, Punjab (India).

[3] Dunham, M.H., 2003:Data Mining: Introductory And Advanced Topics, New Jersey: Prentice Hall,450.

[4] Han and Kamber, J. and M., 2006: chapter-7 „cluster analysis‟, Data Mining concepts and techniques, Diane Cerra, 383-464.

[5] Kantardzic, 2003: M.Data Mining: concepts, models, method, and algorithms, New Jersey: IEEE press.

[6] Kanungo and Mount ,T. and D.M., 2002: An Efficient k-Means Clustering Algorithm:Analysis and implentation, IEEE transaction vol. 24, No. 7.

[7] Nagwani and Bhansali, N.K. and A., 2010: An Object Oriented Email Clustering Model Using Weighted Similarities between Emails Attributes, International Journal of Research and Reviews in Computer science (IJRRCS), Vol. 1, No. 2.

[8] Ordonez and Omiecinski, C. and E., 2004: Efficient Disk-Based K-Means Clustering for Relational Databases, IEEE transaction on knowledge and Data Engineering, Vol.16, No.8.

[9] Su, Lan, Wan, and Yuming, X.,Y.,R., 2009: A Fast Incremental Clustering Algorithm, international Symposium on Information Processing (ISIP‟09), Huangshan, P.R.China, ,pp :175-178.

[10] Witten, I.H., 2000: Data mining: practical machine learning tools and techniques with Java implementations, San-Francisco, California: Morgan Kaufmann, 370.

[11] Young, Karnowski, Arel, Rose, S., I., T. P., D., 2010: A Fast and Stable incremental clustering Algorithm, 7th International University of Tennesee, TN 37996.

Any information missing or wrong?Report an Issue