An efficient automated incremental density-based algorithm for clustering and classification

Elham Azhir

doi:10.1016/j.future.2020.08.031

2021-01-01

PRE

Elham Azhir

Nima Jafari Navimipour *

Mehdi Hosseinzadeh

Arash Sharifi

Aso Mohammad Darwesh

DOI：10.1016/j.future.2020.08.031

原文链接

原文求助

摘要

En 中文

Data clustering divides the datasets into different groups. Incremental Density-Based Spatial Clustering of Applications with Noise (DBSCAN) is a famous density-based clustering technique able to find the clusters of variable sizes and shapes. The quality of incremental DBSCAN results has been influenced by two input parameters: MinPts (Minimum Points) and Eps (Epsilon). Therefore, the parameter setting is one of the major problems of incremental DBSCAN. In the present article, an improved incremental DBSCAN accorded to Non-dominated Sorting Genetic Algorithm II (NSGA-II) has been presented to address the issue. The proposed algorithm adjusts the two parameters (MinPts and Eps) of the incremental DBSCAN via the iteration and the fitness functions to enhance the clustering precision. Moreover, our proposed method introduces suitable fitness functions for both labeled and unlabeled datasets. We have also improved the efficiency of the proposed hybrid algorithm by parallelization of the optimization process. The evaluation of the introduced method has been done through some textual and numerical datasets with different shapes, sizes, and dimensions. According to the experimental results, the proposed algorithm provides better results than Multi-Objective Particle Swarm Optimization (MOPSO) based incremental DBSCAN and a few well-known techniques, particularly regarding the shape and balanced datasets. Also, good speed-up can be reached with a parallel model compared with the serial version of the algorithm. (C) 2020 Elsevier B.V. All rights reserved.

Keyword:

Incremental clustering

DBSCAN

Parameter tuning

NSGA-II

Parallel processing