Skip to main content
SpringerLink
Log in

Analytic Programming Powered by Chaotic Dynamics

  • Conference paper
Nostradamus 2014: Prediction, Modeling and Analysis of Complex Systems

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

  • 1175 Accesses

Abstract

In this paper we discuss alternative tool for symbolic regression so called Analytical programming and compare its variants powered by classical random as well as chaotic random-like number generator. Experimental data are used from the previous experiments reported for genetic programming. Selected algorithms are differential evolution, SOMA, particle swarm, simulated annealing and evolutionary strategies. All of them are mutually used in scheme Master-Slave meta-evolution for final complex structure fitting and its parameter estimation.

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

Access this chapter

Log in via an institution
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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Price, K.: An Introduction to Differential Evolution. In: Corne, D., Dorigo, M., Glover, F. (eds.) New Ideas in Optimization, pp. 79–108. McGraw-Hill, London (1999)

    Google Scholar 

  2. Zelinka, I.: SOMA – Self Organizing Migrating Algorithm. In: Babu, B.V., Onwubolu, G. (eds.) New Optimization Techniques in Engineering. STUDFUZZ, vol. 141, pp. 167–218. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  3. Koza, J.: Genetic Programming: A paradigm for genetically breeding populations of computer programs to solve problems, Stanford University, Computer Science Department, Technical Report, STAN-CS-90-1314 (1990)

    Google Scholar 

  4. Koza, J.: Genetic Programming. MIT Press (1998)

    Google Scholar 

  5. Ryan, C., Collins, J.J., O’Neill, M.: Grammatical evolution: Evolving programs for an arbitrary language. In: Banzhaf, W., Poli, R., Schoenauer, M., Fogarty, T.C. (eds.) EuroGP 1998. LNCS, vol. 1391, pp. 83–96. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  6. Zelinka, I., Oplatkova, Z., Nolle, L.: Analytic programming – Symbolic regression by means of arbitrary evolutionary algorithms. Int. J. of Simulation, Systems, Science and Technology 6(9), 44–56 (2005)

    Google Scholar 

  7. Johnson, C.: Artificial immune systems programming for symbolic regression. In: Ryan, C., Soule, T., Keijzer, M., Tsang, E.P.K., Poli, R., Costa, E. (eds.) EuroGP 2003. LNCS, vol. 2610, pp. 345–353. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  8. Weisser, R., Osmera, P.: Two-Level Transplant Evolution for Optimization of General Controllers. In: New Trends in Technologies, Sciyo (2010)

    Google Scholar 

  9. Weisser, R., Osmera, P.: Two-level Tranpslant Evolution. In: 17th Zittau Fuzzy Colloquium, Zittau, Germany (2010)

    Google Scholar 

  10. Weisser, R., Osmera, P., Matousek, R.: Transplant Evolution with Modified Schema of Differential Evolution: Optimization Structure of Controllers. In: International Conference on Soft Computing MENDEL, Brno, Czech Republic (2010)

    Google Scholar 

  11. O’Neill, M., Brabazon, A.: Grammatical Differential Evolution. In: Proceedings of International Conference on Artificial Intelligence, pp. 231–236. CSEA Press (2006)

    Google Scholar 

  12. Koza, J., Bennet, F., Andre, D., Keane, M.: Genetic Programming III. Morgan Kaufmann, New York (1999)

    MATH  Google Scholar 

  13. Zelinka, I., Oplatkova, Z.: Analytic programming – Comparative study. In: Proceedings of Second International Conference on Computational Intelligence, Robotics, and Autonomous Systems, Singapore (2003)

    Google Scholar 

  14. Koza, J., Keane, M., Streeter, M.: Evolving inventions, pp. 40–47. Scientific American (2003)

    Google Scholar 

  15. Oplatkova, Z., Zelinka, I.: Investigation on artificial ant using analytic programming. In: Proceedings of Genetic and Evolutionary Computation Conference, Seattle, WA, pp. 949–950 (2006)

    Google Scholar 

  16. O’Neill, M., Ryan, C.: Grammatical Evolution, Evolutionary Automatic Programming in an Arbitrary Language. Springer, New York (2003)

    MATH  Google Scholar 

  17. Zelinka, I., Chen, G., Celikovsky, S.: Chaos Synthesis by Means of Evolutionary algorithms. International Journal of Bifurcation and Chaos 18(4), 911–942 (2008) ISSN 0218-1274

    Article  MATH  MathSciNet  Google Scholar 

  18. Zelinka, I., Celikovsky, S., Richter, H., Chen, G. (eds.): Evolutionary Algorithms and Chaotic Systems. SCI, vol. 267. Springer, Heidelberg (2010)

    MATH  Google Scholar 

  19. Zelinka, I., Davendra, D., Senkerik, R., Jasek, R., Oplatkova, Z.: Analytical Programming - a Novel Approach for Evolutionary Synthesis of Symbolic Structures. In: Kita, E. (ed.) Evolutionary Algorithms. InTech (2011), http://www.intechopen.com/books/evolutionary-algorithms/analytical-programming-a-novel-approach-for-evolutionary-synthesis-of-symbolic-structures , doi:10.5772/16166, ISBN: 978-953-307-171-8

  20. Zelinka, I., Senkerik, R., Pluhacek, M.: Do Evolutionary Algorithms Indeed Require Randomness? In: IEEE Congress on Evolutionary Computation, Cancun, Mexico, pp. 2283–2289 (2013)

    Google Scholar 

  21. Zelinka, I., Chadli, M., Davendra, D., Senkerik, R., Pluhacek, M., Lampinen, J.: Hidden Periodicity - Chaos Dependance on Numerical Precision. In: Zelinka, I., Chen, G., Rössler, O.E., Snasel, V., Abraham, A. (eds.) Nostradamus 2013: Prediction, Model. & Analysis. AISC, vol. 210, pp. 47–59. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  22. Zelinka, I., Chadli, M., Davendra, D., Senkerik, R., Pluhacek, M., Lampinen, J.: Do Evolutionary Algorithms Indeed Require Random Numbers? Extended Study. In: Zelinka, I., Chen, G., Rössler, O.E., Snasel, V., Abraham, A. (eds.) Nostradamus 2013: Prediction, Model. & Analysis. AISC, vol. 210, pp. 61–75. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  23. Beyer, H.-G.: Theory of Evolution Strategies. Springer, New York (2001)

    Book  Google Scholar 

  24. Cerný, V.: Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm. J. Opt. Theory Appl. 45(1), 41–51 (1985)

    Article  MATH  Google Scholar 

  25. Kirkpatrick, S., Gelatt Jr., C.D., Vecchi, M.P.: Optimization by Simulated Annealing. Science 220(4598), 671–680 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  26. Clerc, M.: Particle Swarm Optimization. ISTE Publishing Company (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. VSB-Technical University of Ostrava, 17. listopadu 15, 708 33, Ostrava-Poruba, Czech Republic

    Ivan Zelinka, Lenka Skanderova & Petr Šaloun

  2. Faculty of Applied Informatics, Tomas Bata University in Zlin, Zlin, Czech Republic

    Roman Senkerik

  3. MERLIN, Ton Duc Thang University, 19 Nguyen Huu Tho Str., Dist. 7, Ho Chi Minh City, Vietnam

    Ivan Zelinka, Tran Trong Dao & Duy Vo Hoang

Authors
  1. Ivan Zelinka
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lenka Skanderova
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Petr Šaloun
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Roman Senkerik
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Tran Trong Dao
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Duy Vo Hoang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ivan Zelinka .

Editor information

Editors and Affiliations

  1. Department of Computer Science, VŠB-TUO, Ostrava-Poruba, Czech Republic

    Ivan Zelinka

  2. Nanyang Technological University, Singapore, Singapore

    Ponnuthurai Nagaratnam Suganthan

  3. Department of Electronic Engineering, City University of Hong Kong, Hong Kong, China

    Guanrong Chen

  4. Department of Computer Science, VŠB-TUO, Ostrava-Poruba, Czech Republic

    Vaclav Snasel

  5. Scientific Network for Innovation and Research Excellence, Machine Intelligence Research Labs (MIR Labs), Auburn, Washington, USA

    Ajith Abraham

  6. Institute for Physical and Theoretical Chemistry, University of Tübingen, Tübingen, Baden-Württemberg, Germany

    Otto Rössler

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Zelinka, I., Skanderova, L., Šaloun, P., Senkerik, R., Dao, T.T., Hoang, D.V. (2014). Analytic Programming Powered by Chaotic Dynamics. In: Zelinka, I., Suganthan, P., Chen, G., Snasel, V., Abraham, A., Rössler, O. (eds) Nostradamus 2014: Prediction, Modeling and Analysis of Complex Systems. Advances in Intelligent Systems and Computing, vol 289. Springer, Cham. https://doi.org/10.1007/978-3-319-07401-6_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-07401-6_12

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-07400-9

  • Online ISBN: 978-3-319-07401-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation