Clustering Algorithms: A Comparative Approach
Mayra Z. Rodriguez, Cesar H. Comin, Dalcimar Casanova, Odemir M., Bruno, Diego R. Amancio, Francisco A. Rodrigues, Luciano da F. Costa

TL;DR
This paper systematically compares seven clustering algorithms in R across various artificial datasets, revealing spectral clustering often performs best with default settings, but parameter tuning can significantly improve results.
Contribution
It provides a comprehensive comparison of clustering methods considering data variations and parameter sensitivity, guiding better algorithm selection.
Findings
Spectral clustering generally outperforms others with default settings.
Default configurations often lack accuracy, but simple parameter tuning improves performance.
Parameter sensitivity varies across algorithms, affecting clustering quality.
Abstract
Many real-world systems can be studied in terms of pattern recognition tasks, so that proper use (and understanding) of machine learning methods in practical applications becomes essential. While a myriad of classification methods have been proposed, there is no consensus on which methods are more suitable for a given dataset. As a consequence, it is important to comprehensively compare methods in many possible scenarios. In this context, we performed a systematic comparison of 7 well-known clustering methods available in the R language. In order to account for the many possible variations of data, we considered artificial datasets with several tunable properties (number of classes, separation between classes, etc). In addition, we also evaluated the sensitivity of the clustering methods with regard to their parameters configuration. The results revealed that, when considering the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
