.png){kind=icon}
Return
Balance-driven automatic clustering for probability density functions using metaheuristic optimization
.png){kind=icon}
PRE
AI
DOI：10.1007/s13042-022-01683-8.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
For solving the clustering for probability density functions (CDF) problem with a given number of clusters, the metaheuristic optimization (MO) algorithms have been widely studied because of their advantages in searching for the global optimum. However, the existing approaches cannot be directly extended to the automatic CDF problem for determining the number of clusters k. Besides, balance-driven clustering, an essential research direction recently developed in the problem of discrete-element clustering, has not been considered in the field of CDF. This paper pioneers a technique to apply an MO algorithm for resolving the balance-driven automatic CDF. The proposed method not only can automatically determine the number of clusters but also can approximate the global optimal solution in which both the clustering compactness and the clusters' size similarity are considered. The experiments on one-dimensional and multidimensional probability density functions demonstrate that the new method possesses higher quality clustering solutions than the other conventional techniques. The proposed method is also applied in analyzing the difficulty levels of entrance exam questions.
Keywords:
Balance-driven clustering
Automatic clustering
Metaheuristic optimization
Differential evolution
Journal
IF:
2.7
Papers:
3.2K
Citations:
5.6K
Organization
Cited Papers
ShareSaveShareSaveShareSaveShareSaveShareSaveRecognition of REEs anomalies using an image Fusion fractal-wavelet model in Tarom metallogenic zone, NW Iran.png)
Geochemistry
GeochemistryIF0
PREAI
ShareSaveShareSave
View more