Abstract
Observations over recent studies indicate that most of the methods and algorithms used to deal with clustering problems are based on hybrid metaheuristic and metaheuristic algorithms to rectify the solutions. However, these approaches are restricted by the number of heuristics. Hyperheuristic algorithms are new generation of metaheuristic algorithm that use a collection of low-level search strategies and high-level heuristics which works in heuristic space and solution spaces, while metaheuristic algorithms just work in solution space to find better solutions. The main goal of this research is to propose a hyperheuristic framework for clustering problem which is able to optimize the difference of all data objects of one cluster from their respective cluster centres. The proposed hyperheuristic clustering algorithm has used from pool of meta-heuristic and heuristic approaches and mapping between solution space and heuristic spaces is one of the prevalent and powerful methods in the optimization domains. By mapping the solution spaces into heuristic space, it would be possible to make easy decision to settle data clustering problems. Our suggested hyperheuristic clustering works into three major spaces including high-level space, low-level space and problem space. The experiments of this study have proven that the suggested method has successfully generated efficient and robust clustering results.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Reference s
Yang, F., Sun, T., Zhang, C.: An efficient hybrid data clustering method based on K-harmonic means and particle swarm optimization. Exp. Syst. Appl. 36(6), 9847–9852 (2009)
Güngör, Z., Ünler, A.: K-harmonic means data clustering with tabu-search method. Appl. Math. Model. 32(6), 1115–1125 (2008)
Bonab, M.B., Hashim, S.Z.M., Alsaedi, A.K.Z., Hashim, U.R.: Modified k-means combined with artificial bee colony algorithm and differential evolution for color image segmentation. In: Phon-Amnuaisuk, S., Thien Wan, Au. (eds.) Computational Intelligence in Information Systems, pp. 221–231. Springer, Cham (2015)
Hamerly, G., Elkan, C.: Alternatives to the k-means algorithm that find better clusterings. In: Proceedings of the 11th International Conference on Information and Knowledge Management, McLean, Virginia, USA, pp. 600–607. ACM (2002)
Bonab, M.B., et al.: An Efficient Robust Hyper-Heuristic Algorithm to Clustering Problem. Springer, Cham (2019)
Bonab, M.B., et al.: A new swarm-based simulated annealing hyper-heuristic algorithm for clustering problem. Procedia Comput. Sci. 163, 228–236 (2019)
Babrdel Bonab, M., et al.: An effective hybrid of bees algorithm and differential evolution algorithm in data clustering. Math. Probl. Eng. 2015, 17 (2015)
Niknam, T., Amiri, B.: An efficient hybrid approach based on PSO, ACO and k-means for cluster analysis. Appl. Soft Comput. 10(1), 183–197 (2010)
Nguyen, C.D., Cios, K.J.: GAKREM: a novel hybrid clustering algorithm. Inf. Sci. 178(22), 4205–4227 (2008)
Kao, Y.-T., Zahara, E., Kao, I.W.: A hybridized approach to data clustering. Exp. Syst. Appl. 34(3), 1754–1762 (2008)
Afshar, A., et al.: Honey-bee mating optimization (HBMO) algorithm for optimal reservoir operation. J. Franklin Inst. 344(5), 452–462 (2007)
Žalik, K.R.: An efficient k′-means clustering algorithm. Pattern Recogn. Lett. 29(9), 1385–1391 (2008)
Krishna, K., Murty, M.N.: Genetic K-means algorithm. IEEE Trans. Syst. Man Cybern. Part B Cybern. 29(3), 433–439 (1999)
Maulik, U., Bandyopadhyay, S.: Genetic algorithm-based clustering technique. Patt. Recogn. 33(9), 1455–1465 (2000)
Laszlo, M., Mukherjee, S.: A genetic algorithm that exchanges neighboring centers for k-means clustering. Patt. Recogn. Lett. 28(16), 2359–2366 (2007)
Shelokar, P.S., Jayaraman, V.K., Kulkarni, B.D.: An ant colony approach for clustering. Anal. Chim. Acta 509(2), 187–195 (2004)
Bonab, M.B.: Modified k modified k-means algorithm for genetic clustering means algorithm for genetic clustering means algorithm for genetic clustering. IJCSNS 11(9), 24 (2011)
Bonab, M.B., Hashim, S.Z.M.L Image segmentation with genetic clustering using weighted combination of particle swarm optimization. In: 14th International Conference on Applied Computer and Applied Computational Science, ACACOS 2015 (2015)
Acknowledgment
This study was funded through the university grant with the number of (IPSR/RMC/UTARRF/2019-C2/M01. The authors would like to express their deepest gratitude to Universiti Tunku Abdul Rahman (UTAR) and Centre for Artificial Intelligence and Computing Applications (CAICA) for their supports and comments to make this research a meaningful one.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Bonab, M.B., Bok-Min, G., Nair, M.a.B., Huat, C.K., Chwee, W.C. (2021). A New Genetic-Based Hyper-Heuristic Algorithm for Clustering Problem. In: Abraham, A., et al. Proceedings of the 12th International Conference on Soft Computing and Pattern Recognition (SoCPaR 2020). SoCPaR 2020. Advances in Intelligent Systems and Computing, vol 1383. Springer, Cham. https://doi.org/10.1007/978-3-030-73689-7_15
Download citation
DOI: https://doi.org/10.1007/978-3-030-73689-7_15
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-73688-0
Online ISBN: 978-3-030-73689-7
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)