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 arl 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 the first paper, the most appropriate symmetry was evolved. In this second paper, the coordinate system is evolved. In this paper, common detection problems arl solved by evolving appropriate coordinate systems. These coordinate systems effectively transform the nonlinear detection problem into a linear detection problem, which is then solved using simple gradient descent. These coordinate systems arl modeled through a pair of equations and are represented as parse trees. Evolutionary programming (EP) is used to optimize these coordinate systems in light of a fitness function based on the number of correct detections. Results indicate that such coordinate systems can be efficiently evolved to solve non-trivial detection problems.
Funded in part by the California Institute For Energy Efficiency Project On Diagnostics for Building Commissioning And Operation. The authors are indebted to LeeEng Lock for many hours of very fruitful tutclage and conversation regarding proper ways to visualize detection of anomalous behavior in large classA building HVAC systems.
Preview
Unable to display preview. Download preview PDF.
References
Bishop CM (1995), Neural networks for pattern recognition, Oxford, NY: Oxford University Press.
Chellapilla K (1997a), “Evolutionary programming with tree mutations: evolving computer programs without crossover,” Genetic Programming 1997: Proc. of the Second Annual Conference on Genetic Programming, pp. 431–438, CA: Morgan Kaufmann, USA.
Chellapilla K (1997b), “Evolving computer programs without subtree crossover,” IEEE Trans. On Evolutionary Computation, vol. 1, No. 3, pp. 209–216. Sept. 1997.
Fogel DB (1994), “Asymptotic convergence properties of genetic algorithms and evolutionary programming: analysis and experiments,” Cybernetics and Systems, vol. 25:3, pp. 389–407.
Fogel DB (1995) Evolutionary computation: toward a new philosophy of machine intelligence, Piscataway, NJ: IEEE Press, 1995.
Jang J-SR, Sun C-T, and Mizutani E (1997), Neuro-fuzzy and soft computing — a computational approach to learning and machine intelligence, Upper Saddle River, NJ: Prentice Hall.
Koza JR (1992), Genetic programming: on the programming of computers by means of natural selection. Cambridge, MA: MIT Press, 1992.
Rudolph G (1994), “Convergence analysis of canonical genetic algorithms,” IEEE Trans. Neural Networks, vol 5:1, pp. 96–101.
Sidgewick R (1988) Algorithms, Reading, MA: Addison-Wesley, 1988.
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, Berlin: Springer-Verlag.
Author information
Authors and Affiliations
Editor information
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 2: Evolving the most convenient coordinate systems within which to pose (and solve) the given problem. 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/BFb0040781
Download citation
DOI: https://doi.org/10.1007/BFb0040781
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64891-8
Online ISBN: 978-3-540-68515-9
eBook Packages: Springer Book Archive