On making problems evolutionarily friendly part 1: Evolving the most convenient representations (original) (raw)

• 181 Accesses
• 9 Citations

Abstract

The idea of evolutionary friendliness recognizes that problem representations have a significant impact on the performance of evolutionary algorithms. There are two aspects of these representations. Different solution schemes exploit different natural symmetries. Very commonly, problems also possess symmetries that are determined by the coordinate systems used to represent them. Solution symmetries are typically specified by the user and are not allowed to evolve. The problem coordinate system is again typically chosen by the user and not evolved. In this first paper, the most appropriate solution symmetry is evolved. In the second paper, the coordinate system is evolved. In this paper, common detection problems with decision boundaries that possess special symmetries are solved using an evolutionary programming (EP) framework that is capable of exploiting these symmetries to quickly generate solutions. In particular, neural networks possessing appropriate symmetries are evolved by optimizing both their bases and their parameters. Simulation results indicate that the EP procedure is capable of selecting appropriate basis functions for different regions of the input space as well as optimizing the associated set of parameters.

Funded in part by the California Institute for Energy Efficiency Project on Diagnostics for Building Commissioning And Operation. The authors are indebted to Lee Eng Lock for many hours of very fruitful tutelage and conversation regarding proper ways to visualize detection of anomalous behavior in large class A building HVAC systems.

Preview

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

• Fogel DB, Wasson EC, Boughton EM, Porto VW, Shively JW (1997), “Initial results of training neural networks to detect breast cancer using evolutionary programming,” Control and Cybernetics, vol.26, no.3, Polish Acad. Sci, pp. 497–510.
  Google Scholar
• Harrald PG, Kamstra M (1997), “Evolving artificial neural networks to combine financial forecasts,” IEEE Transactions on Evolutionary Computation, vol. 1, no.1, pp. 40–52, April.
  Google Scholar
• Heimes F, Zalesski G, Land W Jr, Oshima M (1997), “Traditional and evolved dynamic neural networks for aircraft simulation,” 1997 IEEE International Conference on Systems, Man, and Cybernetics: Computational Cybernetics and Simulation, vol.3, pp. 1995–2000, NY: IEEE.
  Google Scholar
• Saravanan N and Fogel DB (1995), “Evolving Neural Control Systems,” IEEE Expert, vol. 10, no.3, June, pp. 23–27.
  Google Scholar
• Ugur A and Conrad M (1997), “Structuring pattern generalization through evolutionary techniques,” Evolutionary Programming VI: Proceedings of the Sixth Annual Conference on Evolutionary Programming, pp. 311–321, Springer-Verlag.
  Google Scholar
• Yao X and Liu Y (1995), “Evolving Artificial Neural Networks through Evolutionary Programming,” Evolutionary Programming V: Proceedings of the Fifth Annual Conference On Evolutionary Programming, pp. 257–266, MIT Press: Cambridge.
  Google Scholar
• Yao X, Liu Y (1997), “EPNet for chaotic time-series prediction,” Simulated Evolution and Learning. First Asia-Pacific Conference, pp. 146–156, Berlin: Springer-Verlag, 1997.
  Google Scholar

Download references

Author information

Authors and Affiliations

1. Center for Information Engineering Department of Electrical and Computer Engineering, University of California at San Diego, 92037-4007, La Jolla, CA
   A. V. Sebald & K. Chellapilla

Authors

1. A. V. Sebald
2. K. Chellapilla

Editor information

V. W. Porto N. Saravanan D. Waagen A. E. Eiben

Rights and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sebald, A.V., Chellapilla, K. (1998). On making problems evolutionarily friendly part 1: Evolving the most convenient representations. In: Porto, V.W., Saravanan, N., Waagen, D., Eiben, A.E. (eds) Evolutionary Programming VII. EP 1998. Lecture Notes in Computer Science, vol 1447. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0040780

Download citation

• .RIS
• .ENW
• .BIB
• DOI: https://doi.org/10.1007/BFb0040780
• Published: 10 December 2005
• Publisher Name: Springer, Berlin, Heidelberg
• Print ISBN: 978-3-540-64891-8
• Online ISBN: 978-3-540-68515-9
• eBook Packages: Springer Book Archive

Keywords

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Publish with us