An efficient parameter tuning method based on the Latin Hypercube Hammersley Sampling and fuzzy C-Means clustering methods

被引:6
作者
Eryoldas, Yasemin [1 ]
Durmusoglu, Alptekin [1 ]
机构
[1] Gaziantep Univ, Dept Ind Engn, Gaziantep, Turkey
关键词
LHHS; Fuzzy C-means Clustering; Metaheuristics; Parameter tuning; CHESS RATING SYSTEM; COMPUTER EXPERIMENTS; ALGORITHM; OPTIMIZATION; CALIBRATION; DESIGN;
D O I
10.1016/j.jksuci.2022.08.011
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Metaheuristic algorithms, which are developed to find near-optimal solutions to optimization problems within acceptable times, have specific parameters that have a significant impact on their performance. And fine-tuning these parameters can lead to an effective and good-performing version of such algo-rithms. We propose a novel algorithm configuration method based on Latin Hypercube Hammersley Sampling (LHHS) and Fuzzy C-means Clustering (FCM) methods. Usage of these methods is first in the algorithm configuration literature. We evaluated the proposed tuning method in two experiments and four cases and compared its performance with the current state-of-the-art automatic parameter tuning methods. In the first experiment, we tune three numerical parameters of the Standard Genetic Algorithm (SGA) and in the second experiment, we tune two numerical parameters of the Artificial Bee Colony (ABC) algorithm. Our experimental results show the proposed tuning method showed better performance than other state-of-the-art tuning methods in two cases. And demonstrated competitive performance with the other algorithm configuration methods for the other two cases. The most impor-tant result of our experiments is that not only the best configuration but also other configurations that remained in the final configuration set demonstrated competitive results with the best configuration found with other state-of-the-art parameter tuning methods. However, because the proposed method is designed to find the best-performing configurations among a large initial configuration set using all the available tuning budgets, it requires more computational time.(c) 2022 The Author(s). Published by Elsevier B.V. on behalf of King Saud University. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/).
引用
收藏
页码:8307 / 8322
页数:16
相关论文
共 58 条
[1]   Fine-tuning of algorithms using fractional experimental designs and local search [J].
Adenso-Díaz, B ;
Laguna, M .
OPERATIONS RESEARCH, 2006, 54 (01) :99-114
[2]  
[Anonymous], 2010, Experimental Methods for the Analysis of Optimization Algorithms, DOI DOI 10.1007/978-3-642
[3]  
[Anonymous], 1994, MACHINE LEARNING P 1, DOI [10.1016/B978-1-55860-335-6.50031-3, DOI 10.1016/B978-1-55860-335-6.50031-3]
[4]  
[Anonymous], 1994, P 6 INT C NEUR INF
[5]  
Ansótegui C, 2015, PROCEEDINGS OF THE TWENTY-FOURTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI), P733
[6]   Fuzzy C-Means clustering algorithm for data with unequal cluster sizes and contaminated with noise and outliers: Review and development [J].
Askari, Salar .
EXPERT SYSTEMS WITH APPLICATIONS, 2021, 165
[7]  
Bartz-Beielstein T, 2005, IEEE C EVOL COMPUTAT, P773
[8]  
Bezdek J. C., 1981, Pattern recognition with fuzzy objective function algorithms
[9]   FCM - THE FUZZY C-MEANS CLUSTERING-ALGORITHM [J].
BEZDEK, JC ;
EHRLICH, R ;
FULL, W .
COMPUTERS & GEOSCIENCES, 1984, 10 (2-3) :191-203
[10]  
Birattari M., 2002, Gecco, P11, DOI DOI 10.5555/2955491.2955494