Effectiveness of approximation strategy in surrogate-assisted fireworks algorithm

Yan Pei, Shaoqiu Zheng, Ying Tan, Hideyuki Takagi

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

We investigate the effectiveness of approximation strategy in a surrogate-assisted fireworks algorithm, which obtains the elite from approximate fitness landscape to enhance its optimization performance. We study the effectiveness of approximation strategy from the aspects of approximation method, sampling data selection method and sampling size. We discuss and analyse the optimization performance of each method. For the approximation method, we use least square approximation, spline interpolation, Newton interpolation, and support vector regression to approximate fitness landscape of fireworks algorithm in projected lower dimensional, original and higher dimensional search space. With regard to the sampling data selection method, we define three approaches, i.e., best sampling method, distance near the best fitness individual sampling method, and random sampling method to investigate each sampling method’s performance. With regard to sample size, this is set as 3, 5, and 10 sampling data in both the approximation method and sampling method. We discuss and compare the optimization performance of each method using statistical tests. The advantages of the fireworks algorithm, a number of open topics, and new discoveries arising from evaluation results, such as multi-production mechanism of the fireworks algorithm, optimization performance of each method, elite rank, interpolation times and extrapolation times of elites are analysed and discussed.

Original languageEnglish
Pages (from-to)795-810
Number of pages16
JournalInternational Journal of Machine Learning and Cybernetics
Volume6
Issue number5
DOIs
Publication statusPublished - Oct 21 2015

Fingerprint

Sampling
Interpolation
Least squares approximations
Statistical tests
Extrapolation
Splines

All Science Journal Classification (ASJC) codes

  • Software
  • Computer Vision and Pattern Recognition
  • Artificial Intelligence

Cite this

Effectiveness of approximation strategy in surrogate-assisted fireworks algorithm. / Pei, Yan; Zheng, Shaoqiu; Tan, Ying; Takagi, Hideyuki.

In: International Journal of Machine Learning and Cybernetics, Vol. 6, No. 5, 21.10.2015, p. 795-810.

Research output: Contribution to journalArticle

@article{071cd8fa10434d97bd433e818fb9d14d,
title = "Effectiveness of approximation strategy in surrogate-assisted fireworks algorithm",
abstract = "We investigate the effectiveness of approximation strategy in a surrogate-assisted fireworks algorithm, which obtains the elite from approximate fitness landscape to enhance its optimization performance. We study the effectiveness of approximation strategy from the aspects of approximation method, sampling data selection method and sampling size. We discuss and analyse the optimization performance of each method. For the approximation method, we use least square approximation, spline interpolation, Newton interpolation, and support vector regression to approximate fitness landscape of fireworks algorithm in projected lower dimensional, original and higher dimensional search space. With regard to the sampling data selection method, we define three approaches, i.e., best sampling method, distance near the best fitness individual sampling method, and random sampling method to investigate each sampling method’s performance. With regard to sample size, this is set as 3, 5, and 10 sampling data in both the approximation method and sampling method. We discuss and compare the optimization performance of each method using statistical tests. The advantages of the fireworks algorithm, a number of open topics, and new discoveries arising from evaluation results, such as multi-production mechanism of the fireworks algorithm, optimization performance of each method, elite rank, interpolation times and extrapolation times of elites are analysed and discussed.",
author = "Yan Pei and Shaoqiu Zheng and Ying Tan and Hideyuki Takagi",
year = "2015",
month = "10",
day = "21",
doi = "10.1007/s13042-015-0388-8",
language = "English",
volume = "6",
pages = "795--810",
journal = "International Journal of Machine Learning and Cybernetics",
issn = "1868-8071",
publisher = "Springer Science + Business Media",
number = "5",

}

TY - JOUR

T1 - Effectiveness of approximation strategy in surrogate-assisted fireworks algorithm

AU - Pei, Yan

AU - Zheng, Shaoqiu

AU - Tan, Ying

AU - Takagi, Hideyuki

PY - 2015/10/21

Y1 - 2015/10/21

N2 - We investigate the effectiveness of approximation strategy in a surrogate-assisted fireworks algorithm, which obtains the elite from approximate fitness landscape to enhance its optimization performance. We study the effectiveness of approximation strategy from the aspects of approximation method, sampling data selection method and sampling size. We discuss and analyse the optimization performance of each method. For the approximation method, we use least square approximation, spline interpolation, Newton interpolation, and support vector regression to approximate fitness landscape of fireworks algorithm in projected lower dimensional, original and higher dimensional search space. With regard to the sampling data selection method, we define three approaches, i.e., best sampling method, distance near the best fitness individual sampling method, and random sampling method to investigate each sampling method’s performance. With regard to sample size, this is set as 3, 5, and 10 sampling data in both the approximation method and sampling method. We discuss and compare the optimization performance of each method using statistical tests. The advantages of the fireworks algorithm, a number of open topics, and new discoveries arising from evaluation results, such as multi-production mechanism of the fireworks algorithm, optimization performance of each method, elite rank, interpolation times and extrapolation times of elites are analysed and discussed.

AB - We investigate the effectiveness of approximation strategy in a surrogate-assisted fireworks algorithm, which obtains the elite from approximate fitness landscape to enhance its optimization performance. We study the effectiveness of approximation strategy from the aspects of approximation method, sampling data selection method and sampling size. We discuss and analyse the optimization performance of each method. For the approximation method, we use least square approximation, spline interpolation, Newton interpolation, and support vector regression to approximate fitness landscape of fireworks algorithm in projected lower dimensional, original and higher dimensional search space. With regard to the sampling data selection method, we define three approaches, i.e., best sampling method, distance near the best fitness individual sampling method, and random sampling method to investigate each sampling method’s performance. With regard to sample size, this is set as 3, 5, and 10 sampling data in both the approximation method and sampling method. We discuss and compare the optimization performance of each method using statistical tests. The advantages of the fireworks algorithm, a number of open topics, and new discoveries arising from evaluation results, such as multi-production mechanism of the fireworks algorithm, optimization performance of each method, elite rank, interpolation times and extrapolation times of elites are analysed and discussed.

UR - http://www.scopus.com/inward/record.url?scp=84942018995&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84942018995&partnerID=8YFLogxK

U2 - 10.1007/s13042-015-0388-8

DO - 10.1007/s13042-015-0388-8

M3 - Article

VL - 6

SP - 795

EP - 810

JO - International Journal of Machine Learning and Cybernetics

JF - International Journal of Machine Learning and Cybernetics

SN - 1868-8071

IS - 5

ER -