Skip to main content

Hybrid Sorting-Out Algorithm COMBI-GA with Evolutionary Growth of Model Complexity

  • Conference paper
  • First Online:
Advances in Intelligent Systems and Computing II (CSIT 2017)

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

Included in the following conference series:

Abstract

Paper presents latest achievements in the development of the sorting-out hybrid COMBI-GA algorithm based on a new mechanism of evolutionary growth of models complexity to find the optimal model structure. The mechanism uses generation of model structures of GA initial population by binomial random number generator with low probability and specific mutation operator with adding some units in model structures. The effectiveness of this mechanism is compared with two another mechanisms of evolutionary simplification (using binomial random number generator with big probability to form the GA initial population and mutation operator with reducing amount of units in model structures) and conventional random changing the complexity (using binomial random number generator with average probability of forming the GA initial population and mutation operator where gene values in a chromosome are inverted according to a given probability). The presented experimental results demonstrate that this new algorithm with evolutionary complication of model structures performs quickly, accurately and reliably when solving both artificial and real inductive modelling 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 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.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. Madala, H.R., Ivakhnenko, A.G.: Inductive Learning Algorithms for Complex Systems Modeling. CRC Press, New York (1994)

    Google Scholar 

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

    MathSciNet  Google Scholar 

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

    MathSciNet  Google Scholar 

  4. Samoilenko, O., Stepashko, V.A.: Method of successive elimination of spurious arguments for effective solution of the search-based modelling tasks. In: 2nd International Conference on Inductive Modelling, pp. 36–39. IRTC ITS NASU, Kyiv (2008)

    Google Scholar 

  5. Samoylenko, A.A.: The weight criterion to evaluate the arguments informativeness in the successive selection modeling methods, no. 2, pp. 33–39 (2013). (in Russian)

    Google Scholar 

  6. Moroz, O., Stepashko, V.: On the approaches to construction of hybrid GMDH algorithms. In: Proceedings of 6th International Workshop on Inductive Modelling IWIM-2013, pp. 26–30. IRTC ITS NASU, Kyiv (2015)

    Google Scholar 

  7. Stepashko, V., Bulgakova, O.: Generalized iterative algorithm GIA GMDH. In: International Conference on Inductive Modelling ICIM-2013, pp. 119–123. IRTC ITS NASU, Kyiv (2013)

    Google Scholar 

  8. Stepashko, V., Moroz, O.: Hybrid searching GMDH-GA algorithm for solving inductive modeling tasks. In: 1st International IEEE Conference 2016, Data Stream Mining & Processing, pp. 350–355. IEEE (2016)

    Google Scholar 

  9. Srinivas, M., Patnaik, L.M.: Binomially distributed populations for modelling GAs. In: 5th International Conference on Genetic Algorithms 1993, San Francisco, CA, USA, pp. 138–145 (1993)

    Google Scholar 

  10. Moroz, O.G., Stepashko, V.S.: Comparative analysis of model structures generators in sorting-out GMDH algorithm. In: Inductive Modeling of Complex Systems, vol. 8, pp. 173–191. IRTC ITS NASU, Kyiv (2016). (in Ukrainian)

    Google Scholar 

  11. Moroz, O.: Effectiveness of mutation operators in the genetic search for optimal model in a sorting-out GMDH algorithm. In: 7th International Workshop on Inductive Modeling (IWIM-2016), pp. 14–18. IRTC ITS NASU, Kyiv (2016)

    Google Scholar 

  12. Moroz, O.H.: Sorting-out GMDH algorithm with genetic search of optimal model. Contr. Syst. Mach. 6, 73–79 (2016). (in Russian)

    Google Scholar 

  13. Holland, J.: Adaptation in Natural and Artificial Systems: An Introductory Analysis with Application to Biology, Control, and Artificial Intelligence. MIT Press, Cambridge (1975). University of Michigan

    Google Scholar 

  14. Kaya, Y., Uyar, M., Tekin, R.: A novel crossover operator for genetic algorithms: ring crossover. Presented at CoRR (2011)

    Google Scholar 

  15. http://archive.ics.uci.edu/ml/. Accessed 21 May 2017

  16. https://archive.ics.uci.edu/ml/datasets/SkillCraft1+Master+Table+Dataset. Accessed 24 Apr 2017

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Olha Moroz .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Moroz, O., Stepashko, V. (2018). Hybrid Sorting-Out Algorithm COMBI-GA with Evolutionary Growth of Model Complexity. In: Shakhovska, N., Stepashko, V. (eds) Advances in Intelligent Systems and Computing II. CSIT 2017. Advances in Intelligent Systems and Computing, vol 689. Springer, Cham. https://doi.org/10.1007/978-3-319-70581-1_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-70581-1_25

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-70580-4

  • Online ISBN: 978-3-319-70581-1

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics