Function-Discovery-System by the Evolutionary Computation Using the Search-Accumulation

DOI Web Site Web Site 8 References

Bibliographic Information

Other Title
  • 累積探索を用いた進化論的手法による関数発見システム
  • ルイセキ タンサク オ モチイタ シンカロンテキ シュホウ ニ ヨル カンスウ ハッケン システム

Search this article

Abstract

Recently, a system using the bug-type artificial life was proposed for discovering the function, and has been improved further. This system is one of the extended models of the GA and GP. However, when the observation data is very complicated, the function is occasionally not obtained. In this study, a new concept has been introduced in order that the function search can be applied to the complicated observation data. The function search by the S-System is executed twice or more number of times. This is termed search-accumulation. To confirm the validity of search-accumulation, the Himmelblau function, valley function, and equal-loudness level contours (ISO226) are used as the observation data. Since the distributions of the data are complicated, it is difficult to express them as the function of approximation. By the use of the search-accumulation strategy, the function that is in good agreement with the distribution can be successfully obtained. Thus, the validity of this strategy is confirmed. Search-accumulation is also applicable to GP.

Journal

References(8)*help

See more

Keywords

Details 詳細情報について

Report a problem

Back to top