A Rapid Review of Clustering Algorithms
read the original abstract
Clustering algorithms aim to organize data into groups or clusters based on the inherent patterns and similarities within the data. They play an important role in today's life, such as in marketing and e-commerce, healthcare, data organization and analysis, and social media. Numerous clustering algorithms exist, with ongoing developments introducing new ones. Each algorithm possesses its own set of strengths and weaknesses, and as of now, there is no universally applicable algorithm for all tasks. In this work, we analyzed existing clustering algorithms and classify mainstream algorithms across five different dimensions: underlying principles and characteristics, data point assignment to clusters, dataset capacity, predefined cluster numbers and application area. This classification facilitates researchers in understanding clustering algorithms from various perspectives and helps them identify algorithms suitable for solving specific tasks. Finally, we discussed the current trends and potential future directions in clustering algorithms. We also identified and discussed open challenges and unresolved issues in the field.
This paper has not been read by Pith yet.
Forward citations
Cited by 4 Pith papers
-
Quasicrystal Architected Nanomechanical Resonators via Data-Driven Design
Data-driven design of 12-fold quasicrystal nanomechanical resonators achieves Q_m of approximately 10^7 and force sensitivity of 26.4 aN per square root Hz.
-
Gradient boosted multi-population mortality modelling with high-frequency data
Gradient-boosted Li-Lee model improves fit and forecast accuracy on weekly mortality data from 30 countries while testing population clustering by improvement rates and seasonal strength.
-
Context-KG: Context-Aware Knowledge Graph Visualization with User Preferences and Ontological Guidance
Context-KG uses LLMs to extract user preferences and context from natural language, driving ontology-guided layouts and insights for knowledge graph visualization that improve interpretability and task performance ove...
-
Clustering with Uniformity- and Neighbor-Based Random Geometric Graphs
UN-CCDs extend Cluster Catch Digraphs by using nearest-neighbor-distance Monte Carlo tests instead of Ripley's K to determine covering radii, yielding competitive performance on moderate-dimensional data with complex ...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.