In data mining Clustering is a technique that's aims to single out the data elements into different clusters based on useful features. In this technique data elements that are similar to one another are placed within the same cluster and those which are dissimilar are placed in different clusters. Many algorithms have been proposed in the literature but the most active research algorithms are unsupervised clustering methods of data mining:Partitioning and Hierarchical Methods for clustering. The choice of a particular clustering method depends on many factors or themes. The key idea of this paper is categorizing the methods on the bases of different themes so that it helps in choosing algorithms for any further improvement and optimization.

1. Stefano Serafin, AlessionBerto, Dino Zardi. (2005) Application of Cluster Analysis Technique to the Verification of Quantitative Precipitation Forecasts. University of Trento.
2. Shalini. S. Singh, N. C. Chauhan (2011). K-Mean v/s K-Medoids: A comparative study. National Conference on Recent Trends in Engineering & Technology.
3. Dr. T. Velemurugan. (2012) Efficiency of k-Means and K-Medoids Algorithms for Clustering Arbitrary Data Points. ISSN: 2229-6093.
4. George Karypis, Eui-Hong (Sam) Han, Vipin Kumar. (1999). CHAMELEON:AHierarchical ClusteringAlgorithm. Using Dynamic Modelling.
5. Guha, Sudipto; Rastogi, Rajeev; Shim, Kyuseok (2001). "CURE: An Efficient Clustering Algorithm for Large Databases".
6. Pooja Gupta,, Monika Jena. (2013). Comparative study of different clustering algorithms for association rule mining.
7. Jiawei Han and MichelineKamber. (2006). Data Mining: Concepts and Techniques.
8. Malwindersingh,Meenakshibansal. (2014). Survey On Clustering And Optimization Techniques ToDevelop Hybrid Clustering Technique International Journal Of Computer Engineering and Applications.

Partitional Clustering Hierarchical Clustering statistical Methods k-means birch Cure.