Comparative analysis based on clustering algorithms

3Citations
Citations of this article
20Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This article summarizes and evaluates the clustering effects of commonly used clustering algorithms on data sets with different density distributions. In this paper, circled datasets, different sized datasets, and Gaussian mixture datasets were designed as the typical datasets. Then, the K-means, Gaussian mixture clustering, DBSCAN, and Agglomerative clustering were developed to evaluate the clustering performance on these datasets. The results show that the DBSCAN is more stable when the density distributions of the data sets are not clear. Besides, the Agglomerative clustering that calculates the shortest distance can determine the type of data set. Moreover, it is not appropriate to use only a single clustering algorithm to analyze a Gaussian mixture dataset. It is recommended to use multiple clusters to process the dataset after preprocessing.

Cite

CITATION STYLE

APA

Gu, J. (2021). Comparative analysis based on clustering algorithms. In Journal of Physics: Conference Series (Vol. 1994). IOP Publishing Ltd. https://doi.org/10.1088/1742-6596/1994/1/012024

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free