Balance-driven automatic clustering for probability density functions using metaheuristic optimization

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 ext...

Full description

Saved in:
Bibliographic Details
Published in:International journal of machine learning and cybernetics 2023-04, Vol.14 (4), p.1063-1078
Main Authors: Nguyen-Trang, Thao, Nguyen-Thoi, Trung, Nguyen-Thi, Kim-Ngan, Vo-Van, Tai
Format: Article
Language:English
Subjects:
Algorithms
Artificial Intelligence
Clustering
Complex Systems
Computational Intelligence
Control
Engineering
Genetic algorithms
Heuristic methods
Iterative methods
Mechatronics
Methods
Optimization
Original Article
Pattern Recognition
Probability density functions
Prototypes
Robotics
Statistical analysis
Systems Biology
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1868-8071
1868-808X
DOI:10.1007/s13042-022-01683-8