PeerJ Computer Science (Aug 2024)

Comprehensive analysis of clustering algorithms: exploring limitations and innovative solutions

  • Aasim Ayaz Wani

DOI
https://doi.org/10.7717/peerj-cs.2286
Journal volume & issue
Vol. 10
p. e2286

Abstract

Read online Read online

This survey rigorously explores contemporary clustering algorithms within the machine learning paradigm, focusing on five primary methodologies: centroid-based, hierarchical, density-based, distribution-based, and graph-based clustering. Through the lens of recent innovations such as deep embedded clustering and spectral clustering, we analyze the strengths, limitations, and the breadth of application domains—ranging from bioinformatics to social network analysis. Notably, the survey introduces novel contributions by integrating clustering techniques with dimensionality reduction and proposing advanced ensemble methods to enhance stability and accuracy across varied data structures. This work uniquely synthesizes the latest advancements and offers new perspectives on overcoming traditional challenges like scalability and noise sensitivity, thus providing a comprehensive roadmap for future research and practical applications in data-intensive environments.

Keywords