Discrete Artificial Bee Colony Optimization Algorithm for Financial Classification Problems

Author(s):  
Yannis Marinakis ◽  
Magdalene Marinaki ◽  
Nikolaos Matsatsinis ◽  
Constantin Zopounidis

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.

2011 ◽  
Vol 2 (1) ◽  
pp. 1-17 ◽  
Author(s):  
Yannis Marinakis ◽  
Magdalene Marinaki ◽  
Nikolaos Matsatsinis ◽  
Constantin Zopounidis

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.


Author(s):  
L. S. Suma ◽  
S. S. Vinod Chandra

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.


2018 ◽  
Vol 422 ◽  
pp. 462-479 ◽  
Author(s):  
Emrah Hancer ◽  
Bing Xue ◽  
Mengjie Zhang ◽  
Dervis Karaboga ◽  
Bahriye Akay

Sign in / Sign up

Export Citation Format

Share Document