Comparative Study on Fitness Landscape Approximation with Fourier Transform | Zendy

Yan Pei | Zendy; Hideyuki Takagi | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Comparative Study on Fitness Landscape Approximation with Fourier Transform

Author(s) -

Yan Pei,

Hideyuki Takagi

Publication year - 2012

Publication title -

qir (kyushu university institutional repository) (kyushu university)

Language(s) - English

Resource type - Conference proceedings

DOI - 10.1109/icgec.2012.74

Subject(s) - benchmark (surveying) , discrete fourier transform (general) , fitness landscape , dimension (graph theory) , computational complexity theory , computer science , acceleration , computation , principal component analysis , fourier transform , algorithm , evolutionary computation , process (computing) , mathematical optimization , mathematics , artificial intelligence , short time fourier transform , fourier analysis , physics , mathematical analysis , population , demography , geodesy , classical mechanics , sociology , pure mathematics , geography , operating system

Ⅰ.INTRODUCTION / Ⅱ.DISCRETE FOURIER TRANSFORM / Ⅲ.APPROXIMATING FITNESS LANDSCAPE BY FOURIER TRANSFORM TO ACCELERATE EVOLUTIONARY SEARCH / Ⅳ.EXPERIMENTAL EVALUATIONS / Ⅴ.DISCUSSION / Ⅵ.CONCLUSION AND FUTURE WORKICGEC 2012 : 2012 Sixth International Conference on Genetic and Evolutionary Computing (ICGEC) : 25-28 August 2012 : Kitakyushu, JapanWe propose to apply n dimensional discrete Fourier transform (DFT) to a fitness landscape, search an elite individual using obtained principal frequency component and accelerate evolutionary computation (EC) search. A comparative evaluation with our previous works is conducted using eight benchmark functions. The evaluation shows that our proposed approach can obtain the accurate fitness landscape than that with 1 dimensional DFT, and EC acceleration performance can be improved significantly. However, it needs more computational time in the process of conducting n dimensional DFT than that in 1 dimension. We also investigate the computational complexity of the two approaches and some related issues

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research