返回
Automatic clustering based on dynamic parameters harmony search optimization algorithm
DOI:10.1007/s10044-022-01065-4.png)
摘要
En 中文
As a typical unsupervised learning technique, clustering has been widely applied. However, in many cases, prior information about the number of clusters is unknown, so how to determine it automatically in clustering is getting more attention. In this article, a method named automatic clustering based on dynamic parameters harmony search optimization algorithm, i.e., AC-DPHS, is proposed to solve this problem. By improving the basic harmony search (HS), the dynamic parameters harmony search (DPHS) is devised, which makes the parameters change dynamically without pre-definition. The AC-DPHS takes advantage of the merits of both DPHS and K-means clustering and can determine the optimal number of clusters automatically. A comprehensive experiment is carried out to evaluate the performance of AC-DPHS. The results illustrate that the AC-DPHS generated by using the PBM validity index as its fitness function is relatively superior, and it performs over other approaches developed recently in real-life data clustering as well as grayscale images segmentation. Consequently, the method explained in this article is effectiveness and practical, which can be considered as a new automatic clustering scheme.
Keyword:
Automatic clustering
K-means
Harmony search
PBM validity index
期刊
IF:
2
论文数:
1.9K
被引数:
1.9K
机构
引用论文
A novel combinatorial merge-split approach for automatic clustering using imperialist competitive algorithm一种基于帝国主义竞争算法的自动聚类组合合并-拆分方法
Kinematic and kinetic differences in the execution of vertical jumps between people with good and poor ankle joint dorsiflexion踝关节背屈良好和不良的人在执行垂直跳跃时的运动学和动力学差异
An improved differential-based harmony search algorithm with linear dynamic domain一种改进的线性动态域差分和声搜索算法
A Differential-Based Harmony Search Algorithm With Variable Neighborhood Search for Job Shop Scheduling Problem am Its Runtime Analysis
IEEE ACCESS
IF3.6

