Skip to main content

Hybrid Nature-Inspired Algorithm for Symbol Regression Problem

  • Conference paper
  • First Online:
  • 1098 Accesses

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

Abstract

The problem of symbolic regression is to find mathematical expressions in symbolic form, approximating the relationship between the finite set of values of the independent variables and the corresponding values of the dependent variables. The criterion of quality approach is a mean square error: the sum of the squares of the difference between the model and the values of the dependent variable for all values of the independent variable as an argument. The paper offers a hybrid algorithm for solving symbolic regression. The traditional idea of an algebraic formula in syntax tree form is used. Leaf nodes correspond to variables or numeric constants rather than leaf nodes contain the operation that is performed on the child nodes. A distinctive feature of the process tree representation as a linear recording is preclude loss plurality of terminal elements, but the model can be an arbitrary function of the superposition of a set.

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

Buying options

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

Learn about institutional subscriptions

References

  1. Witten, I.H., Frank, E., Mark A.: Hall Data Mining: Practical Machine Learning Tools and Techniques, 3rd edn. Morgan Kaufmann (2011)

    Google Scholar 

  2. Sammut, C., Webb, G.I.: Symbolic Regression, Encyclopedia of Machine Learning. Springer, Berlin (2010)

    Book  MATH  Google Scholar 

  3. Barsegyan, A.A., Kupriyanov, M.S., Stepanenko, V.V., Kholod, I.I.: Metody i modeli analiza dannykh: OLAP i Data Mining [Methods and Models of Data Analysis: OLAP and Data Mining]. BKhV-Peterburg, St. Peterburg, p. 336 (2004)

    Google Scholar 

  4. Radchenko, S.G.: Metodologiya regressionnogo analiza: Monografiya [Methodology Regression Analysis: Monograph], p. 376. K.: Korniychuk (2011)

    Google Scholar 

  5. Lebedev B.K., Lebedev V.B.: Evolyutsionnaya protsedura obucheniya pri raspoznavanii obrazov [Evolutionary procedure learning in pattern recognition]. Izvestiya TRTU [Izv. TSURe] 8(43), 83–88 (2004)

    Google Scholar 

  6. Rudoy, G.I., Strizhov, V.V.: Algoritmy induktivnogo porozhdeniya superpozitsiy dlya approksimatsii izmeryaemykh dannykh [Algorithms for inductive generation of superpositions for approximation of the measured data]. Informatika i ee primeneniya [Inf. Appl.] 7(1), 44–53 (2013)

    Google Scholar 

  7. Bukhtoyarov, V.V., Semenkin, E.S.: Razrabotka i issledovanie gibridnogo metoda geneticheskogo programmirovaniya [Research and development of hybrid method of genetic programming]. Programmnye produkty i sistemy [Softw. Prod. Syst.] 3, 34–38 (2010)

    Google Scholar 

  8. Kureichik, V.M., Lebedev, B.K., Lebedev, V.B.: VLSI floorplanning based on the integration of adaptive search models. Int. J. Comput. Syst. Sci. 52(1), 80–96 (2013). ISSN: 1064_2307

    Google Scholar 

  9. Koza, J.R.: Genetic Programming IV: Routine Human-Competitive Machine Intelligence. Springer (2005)

    Google Scholar 

  10. Barmpalexis, P., Kachrimanis, K., Tsakonas, A., Georgarakis, E.: Symbolic regression via genetic programming in the optimization of a controlled release pharmaceutical formulation. Chemometr. Intell. Lab. Syst. 107(1), 75–82 (2011)

    Article  Google Scholar 

  11. Johnson, C.G.: Artificial immune systems programming for symbolic regression. In: 6th European Conference on Genetic Programming, pp. 345–353 (2003). ISBN: 3-540-00971-X

    Google Scholar 

  12. Lebedev, O.B.: Modeli adaptivnogo povedeniya murav’inoy kolonii v zadachakh proektirovaniya [Models of Adaptive Behavior, Ant Colony in the Task of Designing], p. 199. Izd-vo YuFU, Taganrog (2013)

    Google Scholar 

Download references

Acknowledgments

This research is supported by grant of the Russian Science Foundation (project # 14-11-00242) in the Southern Federal University.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Oleg B. Lebedev .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Lebedev, B.K., Lebedev, O.B., Lebedeva, E.M. (2016). Hybrid Nature-Inspired Algorithm for Symbol Regression Problem. In: Silhavy, R., Senkerik, R., Oplatkova, Z., Silhavy, P., Prokopova, Z. (eds) Artificial Intelligence Perspectives in Intelligent Systems. Advances in Intelligent Systems and Computing, vol 464. Springer, Cham. https://doi.org/10.1007/978-3-319-33625-1_33

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-33625-1_33

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-33623-7

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

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics