Treffer: Clustering algorithms in data science: Evaluating the time and space complexities of K-means, DBSCAN, and hierarchical methods.

In the expansive domain of data science, clustering algorithms play a pivotal role in segmenting datasets into meaningful groups without prior knowledge of their underlying patterns. This research provides an in-depth evaluation of the time and space complexities of three widely-used clustering algorithms: K-Means, DBSCAN (Density-Based Spatial Clustering of Applications with Noise), and Hierarchical Clustering. The study delves into each algorithm's inherent strengths and limitations, factoring in real-world data application scenarios. Our results indicate varying performance metrics, with K-Means showcasing scalability for larger datasets, DBSCAN aptly handling datasets with arbitrary shapes and noise, and Hierarchical Clustering offering insights into intricate hierarchical structures. By offering a comprehensive comparison, this article aims to guide data scientists in selecting the most appropriate clustering technique based on specific problem requirements and dataset characteristics. [ABSTRACT FROM AUTHOR]

Copyright of AIP Conference Proceedings is the property of American Institute of Physics and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)