Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

An ant colony optimisation and Nelder-Mead simplex hybrid algorithm for training neural networks: an application to bankruptcy prediction in banks

An ant colony optimisation and Nelder-Mead simplex hybrid algorithm for training neural networks:... In this paper, we propose the application of a hybrid meta-heuristic, viz., ant colony optimisation-Nelder-Mead simplex hybrid (ACONM) for training multi-layer perceptron MLP instead of the back-propagation algorithm to solve classification problems. The resulting network is called ACONM-NN. In the ACONM, the ACO part is employed to find a promising region in the search space and then the simplex search is applied to quickly converge to the optimum solution. The influence of the parameters on the performance of the algorithm is also investigated. The effectiveness of the ACONM-NN is tested on the three benchmark datasets viz., Iris, Wine and Wisconsin Breast cancer and bankruptcy prediction problem in banks. The bankruptcy datasets analysed are that of Spanish, Turkish and US banks. Throughout the study we performed ten-fold cross validation. Based on the experiments, it is clear that the proposed ACONM-NN outperformed many other approaches in terms of accuracy. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png International Journal of Information and Decision Sciences Inderscience Publishers

An ant colony optimisation and Nelder-Mead simplex hybrid algorithm for training neural networks: an application to bankruptcy prediction in banks

Loading next page...
 
/lp/inderscience-publishers/an-ant-colony-optimisation-and-nelder-mead-simplex-hybrid-algorithm-F8kPlg2Jb4
Publisher
Inderscience Publishers
Copyright
Copyright © Inderscience Enterprises Ltd. All rights reserved
ISSN
1756-7017
eISSN
1756-7025
DOI
10.1504/IJIDS.2013.053798
Publisher site
See Article on Publisher Site

Abstract

In this paper, we propose the application of a hybrid meta-heuristic, viz., ant colony optimisation-Nelder-Mead simplex hybrid (ACONM) for training multi-layer perceptron MLP instead of the back-propagation algorithm to solve classification problems. The resulting network is called ACONM-NN. In the ACONM, the ACO part is employed to find a promising region in the search space and then the simplex search is applied to quickly converge to the optimum solution. The influence of the parameters on the performance of the algorithm is also investigated. The effectiveness of the ACONM-NN is tested on the three benchmark datasets viz., Iris, Wine and Wisconsin Breast cancer and bankruptcy prediction problem in banks. The bankruptcy datasets analysed are that of Spanish, Turkish and US banks. Throughout the study we performed ten-fold cross validation. Based on the experiments, it is clear that the proposed ACONM-NN outperformed many other approaches in terms of accuracy.

Journal

International Journal of Information and Decision SciencesInderscience Publishers

Published: Jan 1, 2013

There are no references for this article.