scholarly journals An Adaptive Hybrid Ant Colony Optimization Algorithm for The Classification Problem

2019 ◽  
Vol 48 (4) ◽  
pp. 590-601
Author(s):  
Anxiang Ma ◽  
Xiaohong Zhang ◽  
Changsheng Zhang ◽  
Bin Zhang
Keyword(s):  
Artificial Bee Colony ◽  
Classification Problem ◽  
Ant Colony ◽  
Classification Rules ◽  
Optimization Strategy ◽  
Ant Colony Optimization Algorithm ◽  
Artificial Bee Colony Optimization ◽  
Bee Colony ◽  
Bee Colony Optimization ◽  
Rule Evaluation

Classification is an important data analysis and data mining technique. Taking into account the comprehensibility of the classifier generated, an adaptive hybrid ant colony optimization algorithm called A_HACO is proposed which can effectively solve classification problem and get the comprehensible classification rules at the same time. The algorithm incorporates the artificial bee colony optimization strategy into the ant colony algorithm. The ant colony global optimization process is used to adaptively select the appropriate rule evaluation function for the data set given. Based on the classification rules obtained, the artificial bee colony optimization strategy is used to tackle the continuous attributes for further optimization of classification rules. This approach is evaluated experimentally using different standard real datasets, and compared with some proposed related classification algorithms. It shows that A_HACO can adaptively select the appropriate rule evaluation function and has better accuracy compared with related works.

Discrete Artificial Bee Colony Optimization Algorithm for Financial Classification Problems

2011 ◽  
Vol 2 (1) ◽  
pp. 1-17 ◽  
Author(s):  
Yannis Marinakis ◽  
Magdalene Marinaki ◽  
Nikolaos Matsatsinis ◽  
Constantin Zopounidis
Keyword(s):  
Artificial Bee Colony ◽  
Classification Problem ◽  
Discrete Version ◽  
Classification Models ◽  
Classification Problems ◽  
Financial Decisions ◽  
Artificial Bee Colony Optimization ◽  
Bee Colony ◽  
Benchmark Datasets ◽  
Bee Colony Optimization

Nature-inspired methods are used in various fields for solving a number of problems. This study uses a nature-inspired method, artificial bee colony optimization that is based on the foraging behaviour of bees, for a financial classification problem. Financial decisions are often based on classification models, which are used to assign a set of observations into predefined groups. One important step toward the development of accurate financial classification models involves the selection of the appropriate independent variables (features) that are relevant to the problem. The proposed method uses a discrete version of the artificial bee colony algorithm for the feature selection step while nearest neighbour based classifiers are used for the classification step. The performance of the method is tested using various benchmark datasets from UCI Machine Learning Repository and in a financial classification task involving credit risk assessment. Its results are compared with the results of other nature-inspired methods.

Mining of structural motifs in proteins using artificial bee colony optimization framework for druggability

2021 ◽  
Author(s):  
L. S. Suma ◽  
S. S. Vinod Chandra
Keyword(s):  
Artificial Bee Colony ◽  
Area Under The Curve ◽  
Docking Studies ◽  
Artificial Bee Colony Optimization ◽  
Optimization Framework ◽  
Bee Colony ◽  
Novel Variant ◽  
Bee Colony Optimization ◽  
Novel Strategy ◽  
Sensitivity Specificity

In this work, we have developed an optimization framework for digging out common structural patterns inherent in DNA binding proteins. A novel variant of the artificial bee colony optimization algorithm is proposed to improve the exploitation process. Experiments on four benchmark objective functions for different dimensions proved the speedier convergence of the algorithm. Also, it has generated optimum features of Helix Turn Helix structural pattern based on the objective function defined with occurrence count on secondary structure. The proposed algorithm outperformed the compared methods in convergence speed and the quality of generated motif features. The motif locations obtained using the derived common pattern are compared with the results of two other motif detection tools. 92% of tested proteins have produced matching locations with the results of the compared methods. The performance of the approach was analyzed with various measures and observed higher sensitivity, specificity and area under the curve values. A novel strategy for druggability finding by docking studies, targeting the motif locations is also discussed.

Sign in / Sign up

Export Citation Format

Share Document