Skip to main content

Improvement of a Sorting-Out GMDH Algorithm Using Recurrent Estimation of Model Parameters

  • Conference paper
  • First Online:
Advances in Intelligent Systems and Computing IV (CSIT 2019)

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 1080))

Included in the following conference series:

  • 644 Accesses

Abstract

The paper presents and discusses a GMDH algorithm MULTI-R being an improved and revised version of the known multistage algorithm MULTI based on the successive search of model of the globally optimal structure. This means that the MULTI algorithm is intended for discovering the result of exhaustive search by the combinatorial algorithm COMBI GMDH with radically less computations. But this algorithm has some substantial drawbacks, for example, it tends to choose underfitted models in the searching process and is not optimized with respect to the parameter estimation procedures. The new revised version MULTI-R differs from the original algorithm MULTI by using a recurrent procedure of parameters estimation and additional optimizing the model structure to enhance both the computation speed and accuracy of discovering the globally optimal model. The comparative numerical characteristics of the processing speed and structural accuracy of this modified algorithm and the original one are given for several test tasks.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Ivakhnenko, A.G.: Heuristic self-organization in problems of automatic control. Automatica (IFAC) 6, 207–219 (1970)

    Article  Google Scholar 

  2. Farlow, S.J. (ed.): Self-Organizing Methods in Modeling: GMDH Type Algorithms. Marcel Decker Inc., New York (1984)

    MATH  Google Scholar 

  3. Madala, H.R., Ivakhnenko, A.G.: Inductive Learning Algorithms for Complex Systems Modeling. CRC Press, New York (1994)

    MATH  Google Scholar 

  4. Snorek, M., Kordik, P.: Inductive modelling world wide the state of the art. In: Proceedings of the 2nd International Workshop on Inductive Modelling, Prague, pp. 302–304. CTU (2007)

    Google Scholar 

  5. Stepashko, V.: Developments and prospects of GMDH-based inductive modeling. In: Shakhovska, N., Stepashko, V. (eds.) Advances in Intelligent Systems and Computing II. AISC, vol. 689, pp. 474–491. Springer, Cham (2018)

    Google Scholar 

  6. Stepashko, V.S.: A combinatorial algorithm of the group method of data handling with optimal model scanning scheme. Sov. Autom. Control 14(3), 24–28 (1981)

    MathSciNet  Google Scholar 

  7. Ivakhnenko, A.G., Müller, J.-A.: Recent developments of self-organising modeling in prediction and analysis of stock market. Microelectron. Reliab. 37, 1053–1072 (1997)

    Article  Google Scholar 

  8. Anastasakis, L., Mort, N.: The development of self-organization techniques in modelling: a review of the group method of data handling (GMDH). Research Report 813, Department of Automatic Control & Systems Engineering, The University of Sheffield, UK (2001)

    Google Scholar 

  9. Yefimenko, S., Stepashko, V.: Intelligent recurrent-and-parallel computing for solving inductive modeling problems. In: Proceedings of 16th International Conference on Computational Problems of Electrical Engineering (CPEE 2015), Lviv, Ukraine, pp. 236–238 (2015)

    Google Scholar 

  10. Stepashko, V.S.: A finite selection procedure for pruning an exhaustive search of models. Sov. Autom. Control 16(4), 84–88 (1983)

    MathSciNet  MATH  Google Scholar 

  11. Stepashko, V.S., Kostenko, Yu.V.: Combinatorial-selective algorithm for consecutive search for a model of optimal complexity. In: Proceedings of the 1st International Conference on Inductive Modeling, ICIM 2002. SRDIII, Lviv, vol. 1(1), pp. 72–76 (2002). (in Russian)

    Google Scholar 

  12. Seber, G.A.F.: Linear Regression Analysis. Wiley, New York (1977)

    MATH  Google Scholar 

  13. Gergely, J.: Matrix inversion and the solution of systems of linear and non-linear equations by the method of bordering. USSR Comput. Math. Math. Phys. 19(4), 1–10 (1979)

    Article  Google Scholar 

  14. Stepashko, V.S., Efimenko, S.N.: Sequential estimation of the parameters of regression model. Cybern. Syst. Anal. 41(4), 631–634 (2005)

    Article  Google Scholar 

  15. Yefimenko, S., Stepashko, V.: Revised successive search GMDH algorithm with recurrent estimating model parameters. In: Proceedings of the International Scientific Conference “Computer Sciences and Information Technologies” (CSIT 2019), vol. 1, pp. 191–194. IEEE (2019)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Serhiy Yefimenko .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Yefimenko, S., Stepashko, V. (2020). Improvement of a Sorting-Out GMDH Algorithm Using Recurrent Estimation of Model Parameters. In: Shakhovska, N., Medykovskyy, M.O. (eds) Advances in Intelligent Systems and Computing IV. CSIT 2019. Advances in Intelligent Systems and Computing, vol 1080. Springer, Cham. https://doi.org/10.1007/978-3-030-33695-0_35

Download citation

Publish with us

Policies and ethics