scholarly journals K-Means Clustering Algorithm Based on Chaotic Adaptive Artificial Bee Colony

Algorithms ◽  
2021 ◽  
Vol 14 (2) ◽  
pp. 53
Author(s):  
Qibing Jin ◽  
Nan Lin ◽  
Yuming Zhang
Keyword(s):  
Artificial Bee Colony ◽  
Clustering Algorithm ◽  
Heuristic Algorithms ◽  
Fitness Function ◽  
Step Length ◽  
Standard Test ◽  
Local Optimum ◽  
Bee Colony ◽  
Clustering Problems ◽  
Speed And Accuracy

K-Means Clustering is a popular technique in data analysis and data mining. To remedy the defects of relying on the initialization and converging towards the local minimum in the K-Means Clustering (KMC) algorithm, a chaotic adaptive artificial bee colony algorithm (CAABC) clustering algorithm is presented to optimally partition objects into K clusters in this study. This algorithm adopts the max–min distance product method for initialization. In addition, a new fitness function is adapted to the KMC algorithm. This paper also reports that the iteration abides by the adaptive search strategy, and Fuch chaotic disturbance is added to avoid converging on local optimum. The step length decreases linearly during the iteration. In order to overcome the shortcomings of the classic ABC algorithm, the simulated annealing criterion is introduced to the CAABC. Finally, the confluent algorithm is compared with other stochastic heuristic algorithms on the 20 standard test functions and 11 datasets. The results demonstrate that improvements in CAABA-K-means have an advantage on speed and accuracy of convergence over some conventional algorithms for solving clustering problems.

Sentiment Analysis on Microblogging with K-Means Clustering and Artificial Bee Colony

2019 ◽  
Vol 18 (03) ◽  
pp. 1950017 ◽  
Author(s):  
Korawit Orkphol ◽  
Wu Yang
Keyword(s):  
Artificial Bee Colony ◽  
Clustering Algorithm ◽  
Global Optimum ◽  
High Dimensional ◽  
Local Optimum ◽  
Short Message ◽  
Initial State ◽  
Bee Colony ◽  
Analysis Technique ◽  
Value Decomposition

Microblogging is a type of blog used by people to express their opinions, attitudes, and feelings toward entities with a short message and this message is easily shared through the network of connected people. Knowing their sentiments would be beneficial for decision-making, planning, visualization, and so on. Grouping similar microblogging messages can convey some meaningful sentiments toward an entity. This task can be accomplished by using a simple and fast clustering algorithm, [Formula: see text]-means. As the microblogging messages are short and noisy they cause high sparseness and high-dimensional dataset. To overcome this problem, term frequency–inverse document frequency (tf–idf) technique is employed for selecting the relevant features, and singular value decomposition (SVD) technique is employed for reducing the high-dimensional dataset while still retaining the most relevant features. These two techniques adjust dataset to improve the [Formula: see text]-means efficiently. Another problem comes from [Formula: see text]-means itself. [Formula: see text]-means result relies on the initial state of centroids, the random initial state of centroids usually causes convergence to a local optimum. To find a global optimum, artificial bee colony (ABC), a novel swarm intelligence algorithm, is employed to find the best initial state of centroids. Silhouette analysis technique is also used to find optimal [Formula: see text]. After clustering into [Formula: see text] groups, each group will be scored by SentiWordNet and we analyzed the sentiment polarities of each group. Our approach shows that combining various techniques (i.e., tf–idf, SVD, and ABC) can significantly improve [Formula: see text]-means result (41% from normal [Formula: see text]-means).

scholarly journals Spatial information of fuzzy clustering based mean best artificial bee colony algorithm for phantom brain image segmentation

2021 ◽  
Vol 11 (5) ◽  
pp. 4050
Author(s):  
Waleed Alomoush ◽  
Ayat Alrosan ◽  
Ammar Almomani ◽  
Khalid Alissa ◽  
Osama A. Khashan ◽  
...  
Keyword(s):  
Image Segmentation ◽  
Fuzzy Clustering ◽  
Artificial Bee Colony Algorithm ◽  
Artificial Bee Colony ◽  
Clustering Algorithm ◽  
Spatial Information ◽  
Medical Image Segmentation ◽  
Local Optimum ◽  
Brain Image ◽  
Bee Colony

Fuzzy c-means algorithm (FCM) is among the most commonly used in the medical image segmentation process. Nevertheless, the traditional FCM clustering approach has been several weaknesses such as noise sensitivity and stuck in local optimum, due to FCM hasn’t able to consider the information of contextual. To solve FCM problems, this paper presented spatial information of fuzzy clustering-based mean best artificial bee colony algorithm, which is called SFCM-MeanABC. This proposed approach is used contextual information in the spatial fuzzy clustering algorithm to reduce sensitivity to noise and its used MeanABC capability of balancing between exploration and exploitation that is explore the positive and negative directions in search space to find the best solutions, which leads to avoiding stuck in a local optimum. The experiments are carried out on two kinds of brain images the Phantom MRI brain image with a different level of noise and simulated image. The performance of the SFCM-MeanABC approach shows promising results compared with SFCM-ABC and other stats of the arts.

scholarly journals Particle Swarm and Bacterial Foraging Inspired Hybrid Artificial Bee Colony Algorithm for Numerical Function Optimization

2016 ◽  
Vol 2016 ◽  
pp. 1-10 ◽  
Author(s):  
Li Mao ◽  
Yu Mao ◽  
Changxi Zhou ◽  
Chaofeng Li ◽  
Xiao Wei ◽  
...  
Keyword(s):  
Artificial Bee Colony ◽  
Optimization Problems ◽  
Particle Swarm ◽  
Function Optimization ◽  
Local Optimum ◽  
Search Range ◽  
Bacterial Foraging Optimization ◽  
Numerical Function ◽  
Bacterial Foraging ◽  
Bee Colony

Artificial bee colony (ABC) algorithm has good performance in discovering the optimal solutions to difficult optimization problems, but it has weak local search ability and easily plunges into local optimum. In this paper, we introduce the chemotactic behavior of Bacterial Foraging Optimization into employed bees and adopt the principle of moving the particles toward the best solutions in the particle swarm optimization to improve the global search ability of onlooker bees and gain a hybrid artificial bee colony (HABC) algorithm. To obtain a global optimal solution efficiently, we make HABC algorithm converge rapidly in the early stages of the search process, and the search range contracts dynamically during the late stages. Our experimental results on 16 benchmark functions of CEC 2014 show that HABC achieves significant improvement at accuracy and convergence rate, compared with the standard ABC, best-so-far ABC, directed ABC, Gaussian ABC, improved ABC, and memetic ABC algorithms.

Selection of Pathway Markers for Cancer Using Collaborative Binary Multi-Swarm Optimization

2018 ◽  
pp. 337-363
Author(s):  
Prativa Agarwalla ◽  
Sumitra Mukhopadhyay
Keyword(s):  
Particle Swarm Optimization ◽  
Artificial Bee Colony ◽  
Gene Selection ◽  
Heuristic Algorithms ◽  
Particle Swarm ◽  
High Accuracy ◽  
Marker Genes ◽  
Binary Particle Swarm Optimization ◽  
Swarm Optimization ◽  
Bee Colony

Pathway information for cancer detection helps to find co-regulated gene groups whose collective expression is strongly associated with cancer development. In this paper, a collaborative multi-swarm binary particle swarm optimization (MS-BPSO) based gene selection technique is proposed that outperforms to identify the pathway marker genes. We have compared our proposed method with various statistical and pathway based gene selection techniques for different popular cancer datasets as well as a detailed comparative study is illustrated using different meta-heuristic algorithms like binary coded particle swarm optimization (BPSO), binary coded differential evolution (BDE), binary coded artificial bee colony (BABC) and genetic algorithm (GA). Experimental results show that the proposed MS-BPSO based method performs significantly better and the improved multi swarm concept generates a good subset of pathway markers which provides more effective insight to the gene-disease association with high accuracy and reliability.

An Intelligent Traffic Engineering Method over Software Defined Networks for Video Surveillance Systems Based on Artificial Bee Colony

2016 ◽  
Vol 12 (4) ◽  
pp. 45-62 ◽  
Author(s):  
Reza Mohammadi ◽  
Reza Javidan
Keyword(s):  
Video Surveillance ◽  
Traffic Engineering ◽  
Surveillance System ◽  
Artificial Bee Colony ◽  
Heuristic Algorithms ◽  
Optimal Solution ◽  
Video Data ◽  
Surveillance Systems ◽  
Bee Colony

In applications such as video surveillance systems, cameras transmit video data streams through network in which quality of received video should be assured. Traditional IP based networks cannot guarantee the required Quality of Service (QoS) for such applications. Nowadays, Software Defined Network (SDN) is a popular technology, which assists network management using computer programs. In this paper, a new SDN-based video surveillance system infrastructure is proposed to apply desire traffic engineering for practical video surveillance applications. To keep the quality of received videos adaptively, usually Constraint Shortest Path (CSP) problem is used which is a NP-complete problem. Hence, heuristic algorithms are suitable candidate for solving such problem. This paper models streaming video data on a surveillance system as a CSP problem, and proposes an artificial bee colony (ABC) algorithm to find optimal solution to manage the network adaptively and guarantee the required QoS. The simulation results show the effectiveness of the proposed method in terms of QoS metrics.

Chaotic step length artificial bee colony algorithms for protein structure prediction

2020 ◽  
Vol 23 (2) ◽  
pp. 617-629
Author(s):  
Akash Saxena ◽  
Shalini Shekhawat ◽  
Ajay Sharma ◽  
Harish Sharma ◽  
Rajesh Kumar
Keyword(s):  
Protein Structure ◽  
Protein Structure Prediction ◽  
Structure Prediction ◽  
Artificial Bee Colony ◽  
Step Length ◽  
Bee Colony

scholarly journals A Genetic XK-Means Algorithm with Empty Cluster Reassignment

Symmetry ◽  
2019 ◽  
Vol 11 (6) ◽  
pp. 744 ◽  
Author(s):  
Chun Hua ◽  
Feng Li ◽  
Chao Zhang ◽  
Jie Yang ◽  
Wei Wu
Keyword(s):  
Real World ◽  
Numerical Experiments ◽  
Clustering Algorithm ◽  
Global Optimum ◽  
Genetic Mechanism ◽  
Local Optimum ◽  
Clustering Problems ◽  
Initial Choice

K-Means is a well known and widely used classical clustering algorithm. It is easy to fall into local optimum and it is sensitive to the initial choice of cluster centers. XK-Means (eXploratory K-Means) has been introduced in the literature by adding an exploratory disturbance onto the vector of cluster centers, so as to jump out of the local optimum and reduce the sensitivity to the initial centers. However, empty clusters may appear during the iteration of XK-Means, causing damage to the efficiency of the algorithm. The aim of this paper is to introduce an empty-cluster-reassignment technique and use it to modify XK-Means, resulting in an EXK-Means clustering algorithm. Furthermore, we combine the EXK-Means with genetic mechanism to form a genetic XK-Means algorithm with empty-cluster-reassignment, referred to as GEXK-Means clustering algorithm. The convergence of GEXK-Means to the global optimum is theoretically proved. Numerical experiments on a few real world clustering problems are carried out, showing the advantage of EXK-Means over XK-Means, and the advantage of GEXK-Means over EXK-Means, XK-Means, K-Means and GXK-Means (genetic XK-Means).

A Discrete Artificial Bee Colony Algorithm for the Reverse Logistics Location and Routing Problem

2017 ◽  
Vol 16 (05) ◽  
pp. 1339-1357 ◽  
Author(s):  
Kun Guo ◽  
Qishan Zhang
Keyword(s):  
Reverse Logistics ◽  
Vehicle Routing Problem ◽  
Artificial Bee Colony ◽  
Heuristic Algorithms ◽  
Routing Problem ◽  
Waste Products ◽  
Location Allocation ◽  
Bee Colony ◽  
Np Complete ◽  
Location Allocation Problem

Reverse logistics (RL) emerges as a hot topic in both research and business with the increasing attention on the collection and recycling of the waste products. Since Location and Routing Problem (LRP) in RL is NP-complete, heuristic algorithms, especially those built upon swarm intelligence, are very popular in this research. In this paper, both Vehicle Routing Problem (RP) and Location Allocation Problem (LAP) of RL are considered as a whole. First, the features of LRP in RL are analyzed. Second, a mathematical model of the problem is developed. Then, a novel discrete artificial bee colony (ABC) algorithm with greedy adjustment is proposed. The experimental results show that the new algorithm can approach the optimal solutions efficiently and effectively.

Improved Artificial Bee Colony Clustering Algorithm Based on K-Means

2014 ◽  
Vol 556-562 ◽  
pp. 3852-3855 ◽  
Author(s):  
Xue Mei Wang ◽  
Jin Bo Wang
Keyword(s):  
Artificial Bee Colony Algorithm ◽  
Artificial Bee Colony ◽  
Clustering Algorithm ◽  
Optimal Solution ◽  
Bee Colony ◽  
The Poor ◽  
Algorithm Stability ◽  
Clustering Quality ◽  
Local Optimal Solution ◽  
Clustering Center

According to the defects of classical k-means clustering algorithm such as sensitive to the initial clustering center selection, the poor global search ability, falling into the local optimal solution. Artificial Bee Colony algorithm based on K-means was introduced in this article, then put forward an improved Artificial Bee Colony algorithm combined with k-means clustering algorithm at the same time. The experiments showed that the method has solved algorithm stability of k-means clustering algorithm well, and more effectively improved clustering quality and property.

Sign in / Sign up

Export Citation Format

Share Document