Data Mining using Advanced Ant Colony Optimization Algorithm and Application to Bankruptcy Prediction

2013 ◽  
Vol 4 (3) ◽  
pp. 33-56 ◽  
Author(s):  
Vishal Arora ◽  
Vadlamani Ravi
Keyword(s):  
Data Mining ◽  
Ant Colony Optimization ◽  
Predictive Accuracy ◽  
Bankruptcy Prediction ◽  
Ant Colony ◽  
Data Repository ◽  
Ant Colony Optimization Algorithm ◽  
Data Mining Technique ◽  
Benchmark Datasets ◽  
Prediction Problems

Ant Colony Optimization (ACO) is gaining popularity as data mining technique in the domain of Swarm Intelligence for its simple, accurate and comprehensive nature of classification. In this paper the authors propose a novel advanced version of the original ant colony based miner (Ant-Miner) in order to extract classification rules from data. They call this Advanced ACO-Miner (ADACOM). The main goal of ADACOM is to explore the flexibility of using a different knowledge extraction heuristic approach viz. Gini’s Index to increase the predictive accuracy and the simplicity of the rules extracted. Further, the authors increase the information and the prediction level of the set of rules extracted by dynamically changing specific parameters. Simulations are performed with ADACOM on a few benchmark datasets Wine, WBC (Wisconsin Breast Cancer) and Iris from UCI (University of California at Irvine) data repository and compared with Ant-Miner (Parpinelli, Lopes, & Freitas, 2002), Ant-Miner2 (Liu, Abbass, & McKay, 2002), Ant-Miner3 (Liu, Abbass, & McKay, 2003), Ant-Miner+ (Martens, De Backer, Haesen, Vanthienen, Snoeck, & Baesens, 2007) and C4.5 (Quinlan, 1993). The results show that ADACOM outperforms the above mentioned algorithms in terms of predictive accuracy, simplicity of rules, sensitivity, specificity and AUC values (area under ROC curve). In addition, the ADACOM is also employed to extract rules from bank datasets (UK, US, Spanish and Turkish) for bankruptcy prediction and the results are compared with that obtained by Ant-Miner. Again ADACOM yielded better results and is proven to be the better choice for solving bankruptcy prediction problems in banks

Data Mining using Advanced Ant Colony Optimization Algorithm and Application to Bankruptcy Prediction

2014 ◽  
pp. 1554-1576
Author(s):  
Vishal Arora ◽  
Vadlamani Ravi
Keyword(s):  
Data Mining ◽  
Ant Colony Optimization ◽  
Predictive Accuracy ◽  
Bankruptcy Prediction ◽  
Ant Colony ◽  
Data Repository ◽  
Ant Colony Optimization Algorithm ◽  
Data Mining Technique ◽  
Benchmark Datasets ◽  
Area Under Roc Curve

Ant Colony Optimization (ACO) is gaining popularity as data mining technique in the domain of Swarm Intelligence for its simple, accurate and comprehensive nature of classification. In this paper the authors propose a novel advanced version of the original ant colony based miner (Ant-Miner) in order to extract classification rules from data. They call this Advanced ACO-Miner (ADACOM). The main goal of ADACOM is to explore the flexibility of using a different knowledge extraction heuristic approach viz. Gini's Index to increase the predictive accuracy and the simplicity of the rules extracted. Further, the authors increase the information and the prediction level of the set of rules extracted by dynamically changing specific parameters. Simulations are performed with ADACOM on a few benchmark datasets Wine, WBC (Wisconsin Breast Cancer) and Iris from UCI (University of California at Irvine) data repository and compared with Ant-Miner (Parpinelli, Lopes, & Freitas, 2002), Ant-Miner2 (Liu, Abbass, & McKay, 2002), Ant-Miner3 (Liu, Abbass, & McKay, 2003), Ant-Miner+ (Martens, De Backer, Haesen, Vanthienen, Snoeck, & Baesens, 2007) and C4.5 (Quinlan, 1993). The results show that ADACOM outperforms the above mentioned algorithms in terms of predictive accuracy, simplicity of rules, sensitivity, specificity and AUC values (area under ROC curve). In addition, the ADACOM is also employed to extract rules from bank datasets (UK, US, Spanish and Turkish) for bankruptcy prediction and the results are compared with that obtained by Ant-Miner. Again ADACOM yielded better results and is proven to be the better choice for solving bankruptcy prediction problems in banks

Ant Colony Optimization Applied to the Training of a High Order Neural Network with Adaptable Exponential Weights

2020 ◽  
pp. 82-95
Author(s):  
Ashraf M. Abdelbar ◽  
Islam Elnabarawy ◽  
Donald C. Wunsch II ◽  
Khalid M. Salama
Keyword(s):  
Neural Network ◽  
Neural Networks ◽  
Ant Colony Optimization ◽  
High Order ◽  
Ant Colony ◽  
Ant Colony Optimization Algorithm ◽  
Test Set ◽  
Benchmark Datasets ◽  
Gradient Based ◽  
High Order Neural Network

High order neural networks (HONN) are neural networks which employ neurons that combine their inputs non-linearly. The HONEST (High Order Network with Exponential SynapTic links) network is a HONN that uses neurons with product units and adaptable exponents. The output of a trained HONEST network can be expressed in terms of the network inputs by a polynomial-like equation. This makes the structure of the network more transparent and easier to interpret. This study adapts ACOℝ, an Ant Colony Optimization algorithm, to the training of an HONEST network. Using a collection of 10 widely-used benchmark datasets, we compare ACOℝ to the well-known gradient-based Resilient Propagation (R-Prop) algorithm, in the training of HONEST networks. We find that our adaptation of ACOℝ has better test set generalization than R-Prop, though not to a statistically significant extent.

Ant Colony Optimization Applied to the Training of a High Order Neural Network with Adaptable Exponential Weights

2016 ◽  
pp. 362-374 ◽  
Author(s):  
Ashraf M. Abdelbar ◽  
Islam Elnabarawy ◽  
Donald C. Wunsch II ◽  
Khalid M. Salama
Keyword(s):  
Neural Network ◽  
Neural Networks ◽  
Ant Colony Optimization ◽  
High Order ◽  
Ant Colony ◽  
Ant Colony Optimization Algorithm ◽  
Test Set ◽  
Benchmark Datasets ◽  
Gradient Based ◽  
High Order Neural Network

High order neural networks (HONN) are neural networks which employ neurons that combine their inputs non-linearly. The HONEST (High Order Network with Exponential SynapTic links) network is a HONN that uses neurons with product units and adaptable exponents. The output of a trained HONEST network can be expressed in terms of the network inputs by a polynomial-like equation. This makes the structure of the network more transparent and easier to interpret. This study adapts ACOR, an Ant Colony Optimization algorithm, to the training of an HONEST network. Using a collection of 10 widely-used benchmark datasets, we compare ACOR to the well-known gradient-based Resilient Propagation (R-Prop) algorithm, in the training of HONEST networks. We find that our adaptation of ACOR has better test set generalization than R-Prop, though not to a statistically significant extent.

scholarly journals Ant colony optimization based founder sequence reconstruction

2018 ◽  
Vol 33 (2) ◽  
Author(s):  
Anh Vu Thi Ngoc ◽  
Dinh Phuc Thai ◽  
Hoang Duc Nguyen ◽  
Thanh Hai Dang ◽  
Dong Do Duc
Keyword(s):  
Ant Colony Optimization ◽  
Evolutionary Biology ◽  
Optimization Problem ◽  
Gene Sequence ◽  
Ant Colony ◽  
Ant Colony Optimization Algorithm ◽  
Benchmark Datasets ◽  
Sequence Reconstruction ◽  
Test Sets ◽  
Founder Gene

Reconstruction of founder (ancestor) genes for a given population is an important problem in evolutionary biology. It involves finding a set of genes that can combine together to form genes of all individuals in that population. Such reconstruction can be modeled as a combinatorial optimization problem, in which we have to find a set of founder (gene) sequences so that the individuals in a given population can be generated by the smallest number of recombination on these founder sequences. In this paper we propose a novel ant colony optimization algorithm (ACO) based method, equipped with some important improvements, for the founder gene sequence reconstruction problem. The proposed method yields excellent performance when validating on 108 test sets from three benchmark datasets. Comparing with the best by far method for founder sequence reconstruction, our proposed method performs better in 45 test sets, equally well in 44 and worse only in 19 sets. These experimental results demonstrate the efficacy and perspective of our proposed method.

Modeling and optimizing logistics, information, economic and financial intercluster cooperation using the ant colony optimization algorithm

2020 ◽  
Vol 26 (11) ◽  
pp. 2427-2447
Author(s):  
S.N. Yashin ◽  
E.V. Koshelev ◽  
S.A. Borisov
Keyword(s):  
Ant Colony Optimization ◽  
Optimization Algorithm ◽  
Population Decline ◽  
Innovation System ◽  
Federal District ◽  
Original Model ◽  
Ant Colony ◽  
Industrial Agglomeration ◽  
Ant Colony Optimization Algorithm

Subject. This article discusses the issues related to the creation of a technology of modeling and optimization of economic, financial, information, and logistics cluster-cluster cooperation within a federal district. Objectives. The article aims to propose a model for determining the optimal center of industrial agglomeration for innovation and industry clusters located in a federal district. Methods. For the study, we used the ant colony optimization algorithm. Results. The article proposes an original model of cluster-cluster cooperation, showing the best version of industrial agglomeration, the cities of Samara, Ulyanovsk, and Dimitrovgrad, for the Volga Federal District as a case study. Conclusions. If the industrial agglomeration center is located in these three cities, the cutting of the overall transportation costs and natural population decline in the Volga Federal District will make it possible to qualitatively improve the foresight of evolution of the large innovation system of the district under study.

Penerapan Algoritma ACO untuk Penjadwalan Kuliah Pengganti pada Perguruan Tinggi (Studi Kasus: Program Studi Informatika, Universitas Multimedia Nusantara)

2019 ◽  
Vol 9 (2) ◽  
pp. 79-85
Author(s):  
Indah Noviasari ◽  
Andre Rusli ◽  
Seng Hansun
Keyword(s):  
Ant Colony Optimization ◽  
Educational Institution ◽  
Ease Of Use ◽  
Perceived Usefulness ◽  
Ant Colony ◽  
Scheduling Problems ◽  
Perceived Ease Of Use ◽  
Ant Colony Optimization Algorithm ◽  
Scheduling System ◽  
Course Scheduling

Students and scheduling are both essential parts in a higher educational institution. However, after schedules are arranged and students has agreed to them, there are some occasions that can occur beyond the control of the university or lecturer which require the courses to be cancelled and arranged for replacement course schedules. At Universitas Multimedia Nusantara, an agreement between lecturers and students manually every time to establish a replacement course. The agreement consists of a replacement date and time that will be registered to the division of BAAK UMN which then enter the new schedule to the system. In this study, Ant Colony Optimization algorithm is implemented for scheduling replacement courses to make it easier and less time consuming. The Ant Colony Optimization (ACO) algorithm is chosen because it is proven to be effective when implemented to many scheduling problems. Result shows that ACO could enhance the scheduling system in Universitas Multimedia Nusantara, which specifically tested on the Department of Informatics replacement course scheduling system. Furthermore, the newly built system has also been tested by several lecturers of Informatics UMN with a good level of perceived usefulness and perceived ease of use. Keywords—scheduling system, replacement course, Universitas Multimedia Nusantara, Ant Colony Optimization

Sign in / Sign up

Export Citation Format

Share Document