4.6 Article

An evolutionary constructive and pruning algorithm for artificial neural networks and its prediction applications

Journal

NEUROCOMPUTING
Volume 86, Issue -, Pages 140-149

Publisher

ELSEVIER
DOI: 10.1016/j.neucom.2012.01.024

Keywords

Evolutionary algorithm; Neural network; Constructive; Pruning; Prediction

Funding

  1. National Science Council, Taiwan, R.O.C. [NSC 99-2221-E-009-107]
  2. Industrial Technology Research Institute [A353C40000B1-4]

Ask authors/readers for more resources

We propose a method for designing artificial neural networks (ANNs) for prediction problems based on an evolutionary constructive and pruning algorithm (ECPA). The proposed ECPA begins with a set of ANNs with the simplest possible structure, one hidden neuron connected to an input node, and employs crossover and mutation operators to increase the complexity of an ANN population. Additionally, cluster-based pruning (CBP) and age-based survival selection (ABSS) are proposed as two new operators for ANN pruning. The CBP operator retains significant neurons and prunes insignificant neurons on a probability basis and therefore prevents the exponential growth of an ANN. The ABSS operator can delete old ANNs with potentially complex structures and then introduce new ANNs with simple structures; thus, the ANNs are less likely to be trapped in a fully connected topology. The ECPA framework incorporates constructive and pruning approaches in an attempt to efficiently evolve compact ANNs. As a demonstration of the method, ECPA is applied to three prediction problems: the Mackey-Glass time series, the number of sunspots, and traffic flow. The numerical results show that ECPA makes the design of ANNs more feasible and practical for real-world applications. Crown Copyright (C) 2012 Published by Elsevier B.V. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available