Abstract
The aim of this paper is to introduce a robust semantic to genetic learning behavior. The conceptualization of new genetic machine learning relies on the specification model of Entity-Relation. According to this perspective, the learning behavior is decomposed in two evolution dimensions. In addition to some added concepts, the model uses the learning metaphor of coarse adaptability. The configuration of the system leads to a decentralized architecture where entities and interactions provide more reality to the overall genetic machinery. Based upon an adaptation function, the learning put emphasizes on adjustments of mutation rates through generations. This landscape draws the best strategy to control the intensity of convergence velocity along of evolution.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bäck, T.: An overview of parameter control methods by self-adaptation in evolutionary algorithms. Foundamenta Informaticae 35(1-4), 51–66 (1998)
Bäck, T., Fogel, D.B., Michalewicz, Z.: Evolutionary computation 2: advanced algorithms and operators. Institute of physics publishing (2000)
Fogel, D.B.: Evolutionary computing. IEEE Press, Los Alamitos (2002)
Beyer, H.-G.: Towards a theory of Evolution Strategies: Self-adaptation. Evolutionary Computation 3(3), 311–347 (1996)
Beyer, H.-G., Deb, K.: On self-adaptive features in real-parameter evolutionary algorithms. IEEE Transaction on Evolutionary Computation 5(3), 250–270 (2001)
Beyer, H.-G.: The theory of evolution strategies. Natural Computing series. Springer, Heidelberg (2001)
Eiben, A.E., Hinterding, R., Michalewicz, Z.: Parameter control in evolutionary algorithms. IEEE transaction on Evolutionary computation 3, 124–141 (1999)
Fogel, L.G., Angeline, P.J., Fogel, D.B.: An evolutionary programming approach to selfadaptation on finite state machines. In: Mac Donnell, J.R., Reynolds, R.G., Fogel, D.B. (eds.) Proceeding on the fourth international conference on evolutionary programming, pp. 355–365 (1995)
Garnier, J., Kallel, L., Schoenauer, M.: Rigorous hitting times for binary mutations. Evolutionary Computation 7, 173–203 (1999)
Hinterding, R., Michalewicz, Z., Peachey, T.: Self adaptive genetic algorithm for numeric functions. In: Proceedings of the Fourth Conference on Parallel Problem Solving from Nature, pp. 420–429. Springer, Heidelberg (1996)
Liang, K.-H., Yao, X., Liu, Y., Newton, C.: Dynamic control of adaptive parameters in Evolutionary Programming. In: McKay, B., Yao, X., Newton, C.S., Kim, J.-H., Furuhashi, T. (eds.) SEAL 1998. LNCS (LNAI), vol. 1585, pp. 42–49. Springer, Heidelberg (1999)
Spears, W.M.: Adapting crossover in evolutionary algorithms. In: Mc Donnel, J., Reynolds, R., Fogel, D. (eds.) Proceedings of the Fourth Annual Conference on Evolutionary Programming, pp. 367–384. MIT Press, Cambridge (1995)
Spears, W.M.: Evolutionary algorithms: The role of Mutation and Recombination. Springer, Heidelberg (2000)
Smith, R.E., Smuda, E.: Adaptively resizing populations: Algorithm, analysis and first results. Complex Systems 9(1), 47–72 (1995)
Thierens, D.: Adaptive mutation rate control schemes in genetic algorithms (2002), http://citeseer.nj.nec.com/thierens02adaptive.html
Wegener, I.: Theoretical aspects of evolutionary algorithms. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, p. 64. Springer, Heidelberg (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ali, Y.M.B., Laskri, M.T. (2004). Robust Semantic for an Evolved Genetic Algorithm-Based Machine Learning. In: Tawfik, A.Y., Goodwin, S.D. (eds) Advances in Artificial Intelligence. Canadian AI 2004. Lecture Notes in Computer Science(), vol 3060. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24840-8_40
Download citation
DOI: https://doi.org/10.1007/978-3-540-24840-8_40
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22004-6
Online ISBN: 978-3-540-24840-8
eBook Packages: Springer Book Archive