Abstract
A main branch in Evolutionary Computation is learning a system directly from input/output samples without investigating internal behaviors of the system. Input/output samples captured from a real system are usually incomplete, biased and noisy. In order to evolve a precise system, the sample set should include a complete set of samples. Thus, a large number of samples should be used. Fitness functions being used in Evolutionary Algorithms usually based on the matched ratio of samples. Unfortunately, some of these samples may be exactly or semantically duplicated. These duplicated samples cannot be identified simply because we do not know the internal behavior of the system being evolved. This paper proposes a method to overcome this problem by using a dynamic fitness function that incorporates the contribution of each sample in the evolutionary process. Experiments on evolving Finite State Machines with Genetic Algorithms are presented to demonstrate the effect on improving the successful rate and convergent speed of the proposed method.
This is a preview of subscription content, log in via an institution to check access.
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
Ashlock D., Freeman, J.: A Pure Finite State Baseline for Tartarus. Proc. of Evolutionary Computation (2000). 1223–1230
Bowman, C.F.: Pattern Matching Using Finite State Machines. Dr. Dobb.s Journal of Software Tools, Vol. 12, No. 10, (Oct. 1987). 46–7,49-50,52,55,57,92-4,96,106-8
Chongstitvatana, P., Aporntewan, C.: Improving Correctness of Finite-State Machine Synthesis from Multiple Partial Input/Output Sequences. Proc. of the 1st NASD/DoD Workshop on Evolvable Hardware (1999). 262–266
Goldberg, D.E.: Genetic Algorithm in Search, Optimization and Machine Learning. Addison-Wesley (1989).
Holland, J.H.: Adaptation in Natural and Artificial Systems. The University of Michigan Press (1975)
Huang, S.H., Kwai, D.M.: A High-Speed Built-in-Self-Test Design for DRAMs. Proc. of Int Symp. on VLSI Technology, Systems, and Applications (1999). 50–53
Manovit, C., Aporntewan, C., Chongstitvatana, P.: Synthesis of Synchronous Sequential Logic Circuits from Partial Input/Output Sequences. Proc. of Int Conf. on Evolvable Systems: From Biology to Hardware (1998). 98–105
Parhi, K.K.: High-Speed Huffman Decoder Architectures. Proc. of Conf. on Signals, Systems and Computers, Vol. 1, (1991). 64–68
Warshauer, M.L.: Conway.s Parallel Sorting Algorithm. Journal of Algorithms, Vol. 7, (1986). 270–276
Zhou, H., Grefenstette, J.J.: Induction of Finite Automata by Genetic Algorithms. Proc. of Int Conf. on Systems, Man and Cybernetics (1986). 170–174
Tanomaru, J.: Evolving Turing Machines from Examples. Proc. of the 3rd European Conf. on Artificial Evolution (1997). 167–180
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Leung, K.S., Lee, K.H., Cheang, S.M. (2001). Balancing Samples’ Contributions on GA Learning. In: Liu, Y., Tanaka, K., Iwata, M., Higuchi, T., Yasunaga, M. (eds) Evolvable Systems: From Biology to Hardware. ICES 2001. Lecture Notes in Computer Science, vol 2210. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45443-8_23
Download citation
DOI: https://doi.org/10.1007/3-540-45443-8_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42671-4
Online ISBN: 978-3-540-45443-4
eBook Packages: Springer Book Archive