Skip to Main Content
Clustering is one of the most useful methods of intelligent engineering domain, in which a set of similar objects are categorized into clusters. Almost all of the well-known clustering algorithms require input parameters which are hard to determine but have a significant influence on the clustering result. Furthermore, the majority is not robust enough towards noisy data. This paper presents an efficient and effective clustering technique, named DBSCAN-GM that combines Gaussian-Means and DBSCAN algorithms. The idea of DBSCAN-GM is to cover the limitations of DBSCAN, by exploring the benefits of Gaussian-Means: it runs Gaussian-Means to generate small clusters with determined cluster centers, in purpose to estimate the values of DBSAN's parameters. The results of our method show that it is efficient even for large data sets especially data with large dimension and capable to handle noises, contrary to partitioning algorithms such as K-Means or Gaussian-Means. Additionally, DBSCAN-GM does not necessitate any priori information, in contrast to the density clustering DBSCAN obliging two input parameters which are hard to guess, namely Eps (the radius that bounds the neighborhood region of an object) and MinPts (the minimum number of objects that must exist in the objects neighborhood region). Simulative experiments are carried out on a variety of datasets, which highlight the DBSCAN-GM's effectiveness and cluster validity to check the good quality of clustering results.