Function discovery system by evolutionary computation using search accumulation
Mitsutoshi Saito, Seiichi Serikawa · Electronics and Communications in Japan · 2010
Abstract Recently, a system using bug‐type artificial life was proposed for function discovery, and has been improved further. This system is an extended model of GA and GP. However, when the observation data is very complicated, the function is occasionally not obtained. A new concept is now introduced so that the function search can be applied to complicated observation data. The function search by the S‐System is performed two or more times. This is termed search accumulation. To confirm the validity of search accumulation, the Himmelblau function, the valley function, and equal loudness level contours (ISO 226) are used as observation data. Since the distributions of the data are complicated, it is difficult to express them as an approximation function. By the use of the search accumulation strategy, a 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. © 2010 Wiley Periodicals, Inc. Electron Comm Jpn, 93(10): 53–62, 2010; Published online in Wiley Online Library ( wileyonlinelibrary.com ). DOI 10.1002/ecj.10098 3