Modified ISR hyper-heuristic for tuning automatic genetic clustering chromosome size

2Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Recent works using hyper-heuristics for solving clustering problems have been focusing on Genetic Algorithm. However, to the best of this research knowledge, no work is using hyper-heuristics dedicated for tuning the Genetic algorithm's chromosome size for automatic clustering problem. The ability to tune the chromosome size is important because it allows the automatic clustering algorithm to be adaptive and dynamic. This paper proposes and evaluates a modified Improvement Selection Rules hyper-heuristic algorithm for tuning automatic genetic clustering chromosome size. The paper reviews related works of Genetic algorithm's parameters tuning and selective hyper-heuristic algorithms and proposes a modified algorithm. The Iris, Breast Cancer, Wine and E-coli datasets are used for evaluation of the algorithm, based on the fitness, accuracy and robustness. The results indicate that the hyper-heuristic algorithm has produced good performance (fitness) and accuracy but consume considerably higher execution times.

Cite

CITATION STYLE

APA

Adnan, M. H., Hassan, M. F., Aziz, I. A., Nurika, O., & Husain, M. S. (2020). Modified ISR hyper-heuristic for tuning automatic genetic clustering chromosome size. In IOP Conference Series: Materials Science and Engineering (Vol. 932). IOP Publishing Ltd. https://doi.org/10.1088/1757-899X/932/1/012065

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free