Least Mean Square vs. Outer Bounding Ellipsoid Algorithm in Confidence Estimation of the GMDH Neural Networks

  • Marcin Mrugalski
  • Józef Korbicz
Conference paper

DOI: 10.1007/978-3-540-71629-7_3

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4432)
Cite this paper as:
Mrugalski M., Korbicz J. (2007) Least Mean Square vs. Outer Bounding Ellipsoid Algorithm in Confidence Estimation of the GMDH Neural Networks. In: Beliczynski B., Dzielinski A., Iwanowski M., Ribeiro B. (eds) Adaptive and Natural Computing Algorithms. ICANNGA 2007. Lecture Notes in Computer Science, vol 4432. Springer, Berlin, Heidelberg

Abstract

The paper deals with the problem of determination of the model uncertainty during the system identification with the application of the Group Method of Data Handling (GMDH) neural network. The main objective is to show how to employ the Least Mean Square (LMS) and the Outer Bounding Ellipsoid (OBE) algorithm to obtain the corresponding model uncertainty.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Berlin Heidelberg 2007

Authors and Affiliations

  • Marcin Mrugalski
    • 1
  • Józef Korbicz
    • 1
  1. 1.Institute of Control and Computation Engineering, University of Zielona Góra, ul. Podgórna 50, 65–246 Zielona GóraPoland

Personalised recommendations