Copyright © 2006 The Institute of Electronics, Information and Communication Engineers
Regular Section -- Papers -- Biocybernetics, Neurocomputing |
A Pruning Algorithm for Training Cooperative Neural Network Ensembles
The authors are with the Department of Human and Artificial Intelligence Systems, University of Fukui, Fukui-shi, 910–8507 Japan. E-mail: murase{at}synapse.his.fukui-u.ac.jp
We present a training algorithm to create a neural network (NN) ensemble that performs classification tasks. It employs a competitive decay of hidden nodes in the component NNs as well as a selective deletion of NNs in ensemble, thus named a pruning algorithm for NN ensembles (PNNE). A node cooperation function of hidden nodes in each NN is introduced in order to support the decaying process. The training is based on the negative correlation learning that ensures diversity among the component NNs in ensemble. The less important networks are deleted by a criterion that indicates over-fitting. The PNNE has been tested extensively on a number of standard benchmark problems in machine learning, including the Australian credit card assessment, breast cancer, circle-in-the-square, diabetes, glass identification, ionosphere, iris identification, and soybean identification problems. The results show that classification performances of NN ensemble produced by the PNNE are better than or competitive to those by the conventional constructive and fixed architecture algorithms. Furthermore, in comparison to the constructive algorithm, NN ensemble produced by the PNNE consists of a smaller number of component NNs, and they are more diverse owing to the uniform training for all component NNs.
Key Words: neural network ensemble, ensemble design, negative correlation learning, pruning, node decay, over-fitting, generalization
Manuscript received May 30, 2005. Manuscript revised September 13, 2005.