A Hybrid Chimp Optimization Algorithm and Generalized Normal Distribution Algorithm with Opposition-Based Learning Strategy for Solving Data Clustering Problems

This paper is concerned with data clustering to separate clusters based on the connectivity principle for categorizing similar and dissimilar data into different groups. Although classical clustering algorithms such as K-means are efficient techniques, they often trap in local optima and have a slow convergence rate in solving high-dimensional problems. To address these issues, many successful meta-heuristic optimization algorithms and intelligence-based methods have been introduced to attain the optimal solution in a reasonable time. They are designed to escape from a local optimum problem by allowing flexible movements or random behaviors. In this study, we attempt to conceptualize a powerful approach using the three main components: Chimp Optimization Algorithm (ChOA), Generalized Normal Distribution Algorithm (GNDA), and Opposition-Based Learning (OBL) method. Firstly, two versions of ChOA with two different independent groups' strategies and seven chaotic maps, entitled ChOA(I) and ChOA(II), are presented to achieve the best possible result for data clustering purposes. Secondly, a novel combination of ChOA and GNDA algorithms with the OBL strategy is devised to solve the major shortcomings of the original algorithms. Lastly, the proposed ChOAGNDA method is a Selective Opposition (SO) algorithm based on ChOA and GNDA, which can be used to tackle large and complex real-world optimization problems, particularly data clustering applications. The results are evaluated against seven popular meta-heuristic optimization algorithms and eight recent state-of-the-art clustering techniques. Experimental results illustrate that the proposed work significantly outperforms other existing methods in terms of the achievement in minimizing the Sum of Intra-Cluster Distances (SICD), obtaining the lowest Error Rate (ER), accelerating the convergence speed, and finding the optimal cluster centers.

READ FULL TEXT

page 22

page 23

page 30

page 32

page 41

research
05/13/2015

Hybrid data clustering approach using K-Means and Flower Pollination Algorithm

Data clustering is a technique for clustering set of objects into known ...
research
06/11/2020

A Novel Meta-Heuristic Optimization Algorithm Inspired by the Spread of Viruses

According to the no-free-lunch theorem, there is no single meta-heuristi...
research
02/26/2014

Clustering Multidimensional Data with PSO based Algorithm

Data clustering is a recognized data analysis method in data mining wher...
research
08/04/2021

High dimensional Bayesian Optimization Algorithm for Complex System in Time Series

At present, high-dimensional global optimization problems with time-seri...
research
12/30/2022

A Global Optimization Algorithm for K-Center Clustering of One Billion Samples

This paper presents a practical global optimization algorithm for the K-...
research
01/25/2019

A Kalman filtering induced heuristic optimization based partitional data clustering

Clustering algorithms have regained momentum with recent popularity of d...
research
04/15/2023

Herder Ants: Ant Colony Optimization with Aphids for Discrete Event-Triggered Dynamic Optimization Problems

Currently available dynamic optimization strategies for Ant Colony Optim...

Please sign up or login with your details

Forgot password? Click here to reset