Research Area:  Metaheuristic Computing

Abstract:

Data clustering is a complex data mining problem that clusters a massive amount of data objects into a predefined number of clusters; in other words, it finds symmetric and asymmetric objects. Various optimization methods have been used to solve different machine learning problems. They usually suffer from local optimal problems and unbalance between the search mechanisms. This paper proposes a novel hybrid optimization method for solving various optimization problems. The proposed method is called HRSA, which combines the original Reptile Search Algorithm (RSA) and Remora Optimization Algorithm (ROA) and handles these mechanisms’ search processes by a novel transition method. The proposed HRSA method aims to avoid the main weaknesses raised by the original methods and find better solutions. The proposed HRSA is tested on solving various complicated optimization problems—twenty-three benchmark test functions and eight data clustering problems. The obtained results illustrate that the proposed HRSA method performs significantly better than the original and comparative state-of-the-art methods. The proposed method overwhelmed all the comparative methods according to the mathematical problems. It obtained promising results in solving the clustering problems. Thus, HRSA has a remarkable efficacy when employed for various clustering problems.

Keywords:  
Reptile Search Algorithm (RSA)
Remora Optimization Algorithm (ROA)
data clustering
machine learning
metaheuristic
optimization
algorithms

Author(s) Name:  Khaled H. Almotairi and Laith Abualigah

Publisher name:  MDPI

DOI:  10.3390/sym14030458

Volume Information:  Volume 14,Issue 3

Paper Link:   https://www.mdpi.com/2073-8994/14/3/458