• DocumentCode
    349986
  • Title

    Distance modulation competitive co-evolution method to find initial configuration independent cellular automata rules

  • Author

    Berlanga, A. ; Isasi, P. ; Sanchis, A. ; Molina, J.M.

  • Author_Institution
    Dept. de Inf., Univ. Carlos III de Madrid, Madrid, Spain
  • Volume
    5
  • fYear
    1999
  • fDate
    1999
  • Firstpage
    607
  • Abstract
    One of the main problems in machine learning methods based on examples is the over-adaptation. This problem supposes the exact adaptation to the training examples losing the capability of generalization. A solution of these problems arises in using large sets of examples. In most of the problems, to achieve generalized solutions, almost infinity examples sets are needed. This make the method useless in practice. In this paper, one way to overcome this problem is proposed, based on biological competitive evolution ideas. The evolution is produced as a result of a competition between sets of solutions and sets of examples, trying to beat each other. This mechanism allows the generation of generalized solutions using short example sets
  • Keywords
    cellular automata; generalisation (artificial intelligence); learning (artificial intelligence); learning systems; cellular automata; coevolution; competitive evolution; generalization; learning by examples; machine learning; Engines; Evolution (biology); Evolutionary computation; Genetics; H infinity control; Machine learning; Sampling methods; Sequences; Sorting; Testing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Systems, Man, and Cybernetics, 1999. IEEE SMC '99 Conference Proceedings. 1999 IEEE International Conference on
  • Conference_Location
    Tokyo
  • ISSN
    1062-922X
  • Print_ISBN
    0-7803-5731-0
  • Type

    conf

  • DOI
    10.1109/ICSMC.1999.815621
  • Filename
    815621