Metaheuristic algorithm selection system for continuous black-box optimization problems based on collaborative filtering

被引:0
|
作者
Zhang Y.-W. [1 ]
Wang L. [2 ]
机构
[1] College of Electronics and Information, Jiangsu University of Science and Technology, Zhenjiang
[2] College of Electronics and Information Engineering, Tongji University, Shanghai
来源
Zhang, Yong-Wei (ywzhang@just.edu.cn) | 1600年 / Northeast University卷 / 35期
关键词
Algorithm selection; Black-box optimization; Collaborative filtering; Continuous optimization; Meta-heuristics; Recommendation system;
D O I
10.13195/j.kzyjc.2018.0801
中图分类号
学科分类号
摘要
Selecting the best algorithm out of an algorithm set for a given problem is referred to as the algorithm selection (AS) problems. The importance of AS problems increases with the emerge of many optimization algorithms. Therefore, a five-star ranking system based on clustering is proposed, which maps the algorithm performance criteria to integers and reduces the ranking space. An algorithm set is prepared, including 24 commonly used optimization algorithms and four algorithms that win the CEC competition in 2016 and 2017. By testing the performance of the selected algorithms on 219 benchmark problems, a ranking matrix is obtained. The ranking matrix is used as the data source of the collaborative filtering (CF) algorithm to obtain a prediction model of algorithm ranking. For a new problem instance, the model predicts the ranking of all the algorithms in the algorithm set. The results show that the prediction accuracy is high, and over 90% of predicted best algorithms are capable of solving the problem instance. Sensitivity analysis shows that the proposed method can still maintain high prediction accuracy with limited prior information. © 2020, Editorial Office of Control and Decision. All right reserved.
引用
收藏
页码:1297 / 1306
页数:9
相关论文
共 36 条
  • [1] Wolpert D H, Macready W G, No free lunch theorems for optimization, IEEE Trans on Evolutionary Computation, 1, 1, pp. 67-82, (1997)
  • [2] Zeng Z L, Zhang H J, Zhang R, Summary of algorithm selection problem based on meta-learning, Control and Decision, 29, 6, pp. 961-968, (2014)
  • [3] Rice J R, The algorithm selection problem, Advances in Computers, 15, C, pp. 65-118, (1976)
  • [4] Mersmann O, Bischl B, Trautmann H, Et al., Exploratory landscape analysis, The 13th Annual Conference on Genetic and Evolutionary Computation, pp. 829-836, (2011)
  • [5] Munoz M A, Kirley M, Halgamuge S K, Exploratory landscape analysis of continuous space optimization problems using information content, IEEE Transactions on Evolutionary Computation, 19, 1, pp. 74-87, (2015)
  • [6] Kanda J, Carvalho A de, Hruschka E, Meta-learning to select the best meta-heuristic for the traveling salesman problem: A comparison of meta-features, Neurocomputing, 205, pp. 393-406, (2016)
  • [7] Parmezan A R S, Lee H D, Wu F C, Metalearning for choosing feature selection algorithms in data mining: proposal of a new framework, Expert Systems with Applications, 75, pp. 1-24, (2017)
  • [8] Ferrari D G, De Castro L N, Clustering algorithm selection by meta-learning systems: A new distance-based problem characterization and ranking combination methods, Information Sciences, 301, pp. 181-194, (2015)
  • [9] Brazdil P B, Soares C., A comparison of ranking methods for classification algorithm selection, European Conference on Machine Learning, pp. 63-75, (2000)
  • [10] Kerschke P, Trautmann H, Automated algorithm selection on continuous black-box problems by combining exploratory landscape analysis and machine learning, Evolutionary Computation, 27, 1, pp. 99-127, (2019)