Skip to main content

A Population Diversity-Oriented Gene Expression Programming for Function Finding

  • Conference paper
Simulated Evolution and Learning (SEAL 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6457))

Included in the following conference series:

Abstract

Gene expression programming (GEP) is a novel evolutionary algorithm, which combines the advantages of simple genetic algorithm (SGA) and genetic programming (GP). Owing to its special structure of linear encoding and nonlinear decoding, GEP has been applied in various fields such as function finding and data classification. In this paper, we propose a modified GEP (Mod-GEP), in which, two strategies including population updating and population pruning are used to increase the diversity of population. Mod-GEP is applied into two practical function finding problems, the results show that Mod-GEP can get a more satisfactory solution than that of GP, GEP and GEP based on statistical analysis and stagnancy (AMACGEP).

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Witten, I.H., Frank, E.: Data mining: Concepts and Techniques. Morgan Kaufmann, San Francisco (1999)

    Google Scholar 

  2. Ferreira, C.: Gene Expression Programming: A New Adaptive Algorithm for Solving Problems. J. Complex System. 13, 87–129 (2001)

    MathSciNet  MATH  Google Scholar 

  3. Li, T.Y., Tang, C.J., He, T., Wu, J., Qin, W.B.: Gene Expression Programming without Reduplicate Individuals. In: Fifth International Conference on Natural Computation, vol. 4, pp. 249–253. IEEE Press, New York (2009)

    Chapter  Google Scholar 

  4. Zhou, A.M., Gao, H.Q., Kang, L.S., Huang, Y.Z.: The Automatic Modeling of Complex Functions Based on Genetic Programming. J. System Simulation. 15, 797–799 (2003)

    Google Scholar 

  5. Li, K.S., Pan, W.F., Zhang, W.S., Chen, Z.X.: Automatic Modeling of a Novel Gene Expression Analysis and Critical Velocity. In: 2008 IEEE Congress on Evolutionary Computation, pp. 641–647. IEEE Press, New York (2008)

    Google Scholar 

  6. Ferreira, C.: Gene Expression Programming, 2nd edn. Springer, Berlin (2006)

    MATH  Google Scholar 

  7. Gan, Z.H., Yang, Z.K., Li, G.B., Jiang, M.: Automatic Modeling of Complex Functions with Clonal Selection-based Gene Expression Programming. In: Third International Conference on Natural Computation, vol. 4, pp. 228–232. IEEE Press, New York (2007)

    Google Scholar 

  8. Chen, L.: An Adaptive Genetic Algorithm Based on Population Diversity Strategy. In: Third International Conference on Genetic and Evolutionary Computing, pp. 93–96. IEEE Press, New York (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Liu, R., Lei, Q., Liu, J., Jiao, L. (2010). A Population Diversity-Oriented Gene Expression Programming for Function Finding. In: Deb, K., et al. Simulated Evolution and Learning. SEAL 2010. Lecture Notes in Computer Science, vol 6457. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17298-4_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-17298-4_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-17297-7

  • Online ISBN: 978-3-642-17298-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics