The Dynamics of Negative Correlation Learning

Authors:
Mark Eastwood;Bogdan Gabrys
Affiliations:
Computational Intelligence Research Group, School of Design, Engineering and Computing, Bournemouth University, Bournemouth, UK;Computational Intelligence Research Group, School of Design, Engineering and Computing, Bournemouth University, Bournemouth, UK
Venue:
Journal of VLSI Signal Processing Systems
Year:
2007

Citing 5
Cited 1

Bagging predictors

Machine Learning
Ensemble learning via negative correlation

Neural Networks
Random Forests

Machine Learning
Constructing diverse classifier ensembles using artificial training examples

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
A constructive algorithm for training cooperative neural network ensembles

IEEE Transactions on Neural Networks

GRADIENT: Grammar-driven genetic programming framework for building multi-component, hierarchical predictive systems

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we combine two points made in two previous papers on negative correlation learning (NC) by different authors, which have theoretical implications for the optimal setting of 驴, a parameter of the method whose correct choice is critical for stability and good performance. An expression for the optimal 驴 is derived whose value 驴* depends only on the number of classifiers in the ensemble. This result arises from the form of the ambiguity decomposition of the ensemble error, and the close links between this and the error function used in NC. By analyzing the dynamics of the outputs we find dramatically different behavior for 驴驴驴*, 驴驴=驴驴* and 驴驴驴驴*, providing further motivation for our choice of 驴 and theoretical explanations for some empirical observations in other papers on NC. These results will be illustrated using well known synthetic and medical datasets.