Evolutionary Bi-objective Learning with Lowest Complexity in Neural Networks: Empirical Comparisons

  • Yamina Mohamed Ben Ali
Conference paper

DOI: 10.1007/978-3-540-71618-1_15

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4431)
Cite this paper as:
Mohamed Ben Ali Y. (2007) Evolutionary Bi-objective Learning with Lowest Complexity in Neural Networks: Empirical Comparisons. In: Beliczynski B., Dzielinski A., Iwanowski M., Ribeiro B. (eds) Adaptive and Natural Computing Algorithms. ICANNGA 2007. Lecture Notes in Computer Science, vol 4431. Springer, Berlin, Heidelberg

Abstract

This paper introduces a new study in evolutionary computation technique in order to learn optimal configuration of a multilayer neural network. Inspired from thermodynamic perception, the used evolutionary framework undertakes the optimal configuration problem as a Bi-objective optimization problem. The first objective aims to learn optimal layer topology by considering optimal nodes and optimal connections by nodes. Second objective aims to learn optimal weights setting. The evaluation function of both concurrent objectives is founded on an entropy function which leads the global system to optimal generalization point. Thus, the evolutionary framework shows salient improvements in both modeling and results. The performance of the required algorithms was compared to estimations distribution algorithms in addition to the Backpropagation training algorithm.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Berlin Heidelberg 2007

Authors and Affiliations

  • Yamina Mohamed Ben Ali
    • 1
  1. 1.Research Group on Artificial Intelligence, Computer Science Department, Badji Mokhtar University BP 12, AnnabaAlgeria

Personalised recommendations