An Enhanced Version of Cat Swarm Optimization Algorithm for Cluster Analysis

An Enhanced Version of Cat Swarm Optimization Algorithm for Cluster Analysis

Hakam Singh, Yugal Kumar
Copyright: © 2022 |Pages: 25
DOI: 10.4018/IJAMC.2022010108
Article PDF Download
Open access articles are freely available for download

Abstract

Clustering is an unsupervised machine learning technique that optimally organizes the data objects in a group of clusters. In present work, a meta-heuristic algorithm based on cat intelligence is adopted for optimizing clustering problems. Further, to make the cat swarm algorithm (CSO) more robust for partitional clustering, some modifications are incorporated in it. These modifications include an improved solution search equation for balancing global and local searches, accelerated velocity equation for addressing diversity, especially in tracing mode. Furthermore, a neighborhood-based search strategy is introduced to handle the local optima and premature convergence problems. The performance of enhanced cat swarm optimization (ECSO) algorithm is tested on eight real-life datasets and compared with the well-known clustering algorithms. The simulation results confirm that the proposed algorithm attains the optimal results than other clustering algorithms.
Article Preview
Top

1. Introduction

Data mining is the process of discovering useful patterns and knowledge from large volume of data (Han et al., 2011). Primarily, four types of learning approaches have been described in data mining such as supervised, unsupervised, semi-supervised and active user learning. The supervised learning analyzes the data object with respect to class labels, while, unsupervised learning analyzes the data object without consulting the class labels. The semi-supervised learning considers both supervised and unsupervised learning approaches. Whereas, in active-user learning, user can interactively label the data points with desired outputs. Clustering is an unsupervised machine learning approach that divides a set of objects into distinct clusters (Jain et al., 1999; Nanda & Panda 2014). The objects within a cluster are similar to each other and dissimilar to other clusters. The prime objective of clustering is to maximize the intra-cluster compactness and minimizing inter-cluster likeness among clusters. Last few decades, momentous research has been done in the clustering field. Several optimization techniques inspired from natural phenomenon have been reported to obtain optimal solutions for clustering task. Some of these are particle swarm optimization (Cura 2012), Magnetic optimization algorithm (Kushwaha et al., 2018), charged system search approach (Kumar & Sahoo 2014), Black hole (Hatamlou 2013), artificial bee colony algorithm (Karaboga & Ozturk 2011), ant colony optimization (Shelokar et al., 2004) and big bang big crunch algorithm (Hatamlou et al., 2011).

In recent time, a heuristic algorithm based on cat intelligence has gained wide popularity among research community and adopted in several research fields like workflow scheduling in the cloud, image analysis, wireless sensor networks, data analysis etc. (Chu et al., 2006; Tsai et al., 2012; Ram et al., 2015; Wang et al., 2012; ). Initially, Santosa and Ningrum (2009) applied the CSO algorithm for solving clustering problems. This algorithm works in two modes, seeking mode and tracing mode. The resting behavior of cats is described using seeking mode, while the hunting skill of cat is described using tracing mode. The seeking mode responsible for local search, whereas the tracing mode responsible for global search. It is observed that CSO algorithm have good exploration capability, but suffers from weak exploitation ability (Kumar & Sahoo 2017). Sometimes, the CSO algorithm cannot explore entire search space for an optimum solution due to lack of global best position information and results in slow convergence rate (Kumar & Singh 2018). These deficiencies can affect the performance of CSO algorithm for solving optimization problems. Hence, to make the CSO algorithm more efficient and robust, several issues are identified and resolved in this research work.

Complete Article List

Search this Journal:
Reset
Volume 15: 1 Issue (2024)
Volume 14: 1 Issue (2023)
Volume 13: 4 Issues (2022): 2 Released, 2 Forthcoming
Volume 12: 4 Issues (2021)
Volume 11: 4 Issues (2020)
Volume 10: 4 Issues (2019)
Volume 9: 4 Issues (2018)
Volume 8: 4 Issues (2017)
Volume 7: 4 Issues (2016)
Volume 6: 4 Issues (2015)
Volume 5: 4 Issues (2014)
Volume 4: 4 Issues (2013)
Volume 3: 4 Issues (2012)
Volume 2: 4 Issues (2011)
Volume 1: 4 Issues (2010)
View Complete Journal Contents Listing