Clustering is a process of partitioning a set of data (or objects) into a set of meaningful sub-classes, called clusters. This paper analyzes three major clustering algorithms: K-Means, Hierarchical clustering and Density based clustering. The performance of these three clustering algorithms is compared using the clustering toolkit Weka.

1. Usama Fayyad, Gregory Piatetsky-Shapiro, and Padhraic Smyth "From Data Mining to Knowledge Discovery in Databases".
2. K-Means clustering using Weka Interface- By Sapna Jain, M Afshar Aalam and M. N Doja, Jamia Hamdard University, New Delhi, Proceedings of the 4th National Conference, INDIA Com-2010 Computing for Nation Development, February 25-26, 2010 Bharati Vidyapeeth's Institute of Computer Applications and Management, New Delhi.
3. MacQueen J. B, University of California-Los Angeles "Some Methods for classification and Analysis of Multivariate Observations".
4. Lloyd, S. P. "Least square quantization in PCM". IEEE Transactions on Information Theory 28, 1982,pp. 129–137.
5. Jiawei Han and Micheline Kamber, "Data Mining: Concepts and Techniques", Morgan Kaufmann Publishers, second Edition, (2006).
6. E. B Fawlkes and C. L. Mallows,? A method for comparing two hierarchical clustering", Journal of the American Statistical Association, 78:553–584, 1983.
7. Timonthy C. Havens. "Clustering in relational data and ontologies" July 2010.
8. Xu R. Survey of clustering algorithms . IEEE Trans. Neural Networks 2005.
9. BOHM, C. , KAILING, K. , KRIEGEL, H. -P. , AND KR¨OGER, P. 2004. Density connected clustering with local Subspace preferences. In Proceedings of the 4th International Conference on Data Mining (ICDM).

Data Mining Algorithms Weka Tools K-means Algorithms Hierarchical Clustering And Density Based Clustering.