A Review of Clustering Techniques and Developments

A Review of Clustering Techniques and Developments

| Amit Saxena¹, Mukesh Prasad², Akshansh Gupta³, Neha Bharill⁴, Om Prakash Patel⁴, Aruna Tiwari⁴, Meng Joo Er⁵, Weiping Ding⁶, Chin-Teng Lin²
This paper provides a comprehensive review of clustering techniques and their developments. Clustering is an unsupervised learning method that groups objects based on inherent similarities. Various clustering methods include hierarchical, partitional, grid, density-based, and model-based approaches. The paper discusses the similarity measures and evaluation criteria central to clustering, as well as applications in fields like image segmentation, object recognition, and data mining. It highlights the importance of similarity in clustering and the challenges associated with clustering, such as the curse of dimensionality and the need for feature selection. The paper also covers different clustering techniques, including hierarchical clustering methods like single-linkage, complete-linkage, and average-linkage, as well as partitional methods like k-means and fuzzy c-means. It discusses the advantages and limitations of these methods, and presents various enhanced clustering techniques such as BIRCH, CURE, and ROCK. The paper also explores other clustering approaches, including graph-based, spectral, model-based, and density-based methods. It discusses the importance of similarity measures in clustering, including Minkowski, cosine, Pearson correlation, and extended Jaccard measures. The paper also covers various clustering algorithms, including evolutionary approaches, search-based methods, and collaborative fuzzy clustering. Finally, it discusses multi-objective clustering and overlapping clustering, highlighting their applications and challenges. The paper concludes with a summary of the key findings and future directions in clustering research.This paper provides a comprehensive review of clustering techniques and their developments. Clustering is an unsupervised learning method that groups objects based on inherent similarities. Various clustering methods include hierarchical, partitional, grid, density-based, and model-based approaches. The paper discusses the similarity measures and evaluation criteria central to clustering, as well as applications in fields like image segmentation, object recognition, and data mining. It highlights the importance of similarity in clustering and the challenges associated with clustering, such as the curse of dimensionality and the need for feature selection. The paper also covers different clustering techniques, including hierarchical clustering methods like single-linkage, complete-linkage, and average-linkage, as well as partitional methods like k-means and fuzzy c-means. It discusses the advantages and limitations of these methods, and presents various enhanced clustering techniques such as BIRCH, CURE, and ROCK. The paper also explores other clustering approaches, including graph-based, spectral, model-based, and density-based methods. It discusses the importance of similarity measures in clustering, including Minkowski, cosine, Pearson correlation, and extended Jaccard measures. The paper also covers various clustering algorithms, including evolutionary approaches, search-based methods, and collaborative fuzzy clustering. Finally, it discusses multi-objective clustering and overlapping clustering, highlighting their applications and challenges. The paper concludes with a summary of the key findings and future directions in clustering research.
Reach us at info@study.space