4.7 Article

Application of the novel harmony search optimization algorithm for DBSCAN clustering

期刊

EXPERT SYSTEMS WITH APPLICATIONS
卷 178, 期 -, 页码 -

出版社

PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.eswa.2021.115054

关键词

Clustering; DBSCAN; K-DBSCAN; Novel harmony search

资金

  1. Development Project of Ship Situational Intelligent Awareness System [MC-201920-X01]

向作者/读者索取更多资源

The study proposed the K-DBSCAN clustering method, utilizing the novel harmony search (novel-HS) optimization algorithm to improve the clustering parameters of DBSCAN, achieving better clustering results with K classifications. Experimental results demonstrated that this designed clustering method outperforms others and can be considered as a new clustering scheme for further research.
At present, the DBSCAN clustering algorithm has been commonly used principally due to its ability in discovering clusters with arbitrary shapes. When the cluster number K is predefined, though the partitional clustering methods can perform efficiently, they cannot process the non-convex clustering and easily fall into local opti-mum. Thereby the concept of K-DBSCAN clustering is proposed in this paper. But the basic DBSCAN has a crucial defect, that is, difficult to predict the suitable clustering parameters. Here, the well-known harmony search (HS) optimization algorithm is considered to deal with this problem. By modifying the original HS, the novel harmony search (novel-HS) is put forward, which can improve the accuracy of results as well as enhance the robustness of optimization. In K-DBSCAN, the novel-HS is used to optimize the clustering parameters of DBSCAN to obtain better clustering effect with the number of K classifications. Experimental results show that the designed clus-tering method has superior performance to others and can be successfully considered as a new clustering scheme for further research.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据