A Nature Inspired Hybrid Partitional Clustering Method Based on Grey Wolf Optimization and JAYA Algorithm

A NATURE INSPIRED HYBRID PARTITIONAL CLUSTERING METHOD BASED ON GWO AND JAYA ALGORITHM

Authors

  • GYANARANJAN SHIAL Sambalpur University
  • Dr. Sabita Sahoo Sambalpur Univerisity
  • Dr. Sibarama Panigrahi Sambalpur University Institute of Information Technology, Burla

DOI:

https://doi.org/10.7494/csci.2023.24.3.4962

Abstract

This paper presents a hybrid meta-heuristic algorithm using Grey Wolf optimization (GWO) and JAYA algorithm for data clustering. The idea is use exploitative capability of JAYA algorithm in the explorative phase of GWO to form compact clusters. Here, instead of using one best and one worst solution for generating offspring, three best wolfs and three worst omega wolfs of the population are used. So, the best wolfs and worst omega wolfs assist in moving the new solutions towards the best solutions and simultaneously helps in staying away from the worst solutions. This enhances the chances of reaching the near optimal solutions. The superiority of the proposed method is compared with five promising algorithms, namely GWO, Sine-Cosine Algorithm (SCA), Particle Swarm Optimization (PSO), JAYA and K-means algorithms. The result obtained from the Duncan’s multiple range test and Nemenyi hypothesis based statistical test confirms the superiority and robustness of our proposed method.

Downloads

Download data is not yet available.

References

J. H. Holland and others, Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence. MIT press, 1992.

S. Mirjalili, S. M. Mirjalili, and A. Lewis, “Grey Wolf Optimizer,” Adv. Eng. Softw., vol. 69, pp. 46–61, Mar. 2014, doi: 10.1016/j.advengsoft.2013.12.007.

R. V. Rao, V. J. Savsani, and D. P. Vakharia, “Teaching--learning-based optimization: a novel method for constrained mechanical design optimization problems,” Comput. Des., vol. 43, no. 3, pp. 303–315, 2011.

C. Guo, H. Tang, B. Niu, and C. B. P. Lee, “A survey of bacterial foraging optimization,” Neurocomputing, vol. 452, pp. 728–746, 2021.

S. Mirjalili and A. Lewis, “The whale optimization algorithm,” Adv. Eng. Softw., vol. 95, pp. 51–67, 2016.

R. Rao, “Jaya: A simple and new optimization algorithm for solving constrained and unconstrained optimization problems,” Int. J. Ind. Eng. Comput., vol. 7, no. 1, pp. 19–34, 2016.

M. Dorigo and G. Di Caro, “Ant colony optimization: a new meta-heuristic,” in Proceedings of the 1999 congress on evolutionary computation-CEC99 (Cat. No. 99TH8406), 1999, vol. 2, pp. 1470–1477.

S. Mirjalili, “SCA: a sine cosine algorithm for solving optimization problems,” Knowledge-based Syst., vol. 96, pp. 120–133, 2016.

S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, “Optimization by simulated annealing,” Science (80-. )., vol. 220, no. 4598, pp. 671–680, 1983.

G. Dhiman and V. Kumar, “Spotted hyena optimizer: a novel bio-inspired based metaheuristic technique for engineering applications,” Adv. Eng. Softw., vol. 114, pp. 48–70, 2017.

S. Mirjalili, “The ant lion optimizer,” Adv. Eng. Softw., vol. 83, pp. 80–98, 2015.

J. Kennedy and R. Eberhart, “Particle swarm optimization,” in Proceedings of ICNN’95-international conference on neural networks, 1995, vol. 4, pp. 1942–1948.

A. Y. S. Lam and V. O. K. Li, “Chemical-reaction-inspired metaheuristic for optimization,” IEEE Trans. Evol. Comput., vol. 14, no. 3, pp. 381–399, 2009.

R. Storn and K. Price, “Differential evolution--a simple and efficient heuristic for global optimization over continuous spaces,” J. Glob. Optim., vol. 11, no. 4, pp. 341–359, 1997.

O. A. M. Jafar and R. Sivakumar, “Ant-based clustering algorithms: A brief survey,” Int. J. Comput. theory Eng., vol. 2, no. 5, p. 787, 2010.

E. R. Hruschka, R. J. G. B. Campello, A. A. Freitas, and others, “A survey of evolutionary algorithms for clustering,” IEEE Trans. Syst. Man, Cybern. Part C (Applications Rev., vol. 39, no. 2, pp. 133–155, 2009.

A. Hatamlou, S. Abdullah, and H. Nezamabadi-Pour, “Application of gravitational search algorithm on data clustering,” in International conference on rough sets and knowledge technology, 2011, pp. 337–346.

A. Hatamlou, S. Abdullah, and H. Nezamabadi-Pour, “A combined approach for clustering based on K-means and gravitational search algorithms,” Swarm Evol. Comput., vol. 6, pp. 47–52, 2012.

A. Hatamlou, S. Abdullah, and M. Hatamlou, “Data clustering using big bang--big crunch algorithm,” in International conference on innovative computing technology, 2011, pp. 383–388.

S. J. Nanda and G. Panda, “A survey on nature inspired metaheuristic algorithms for partitional clustering,” Swarm Evol. Comput., vol. 16, pp. 1–18, 2014.

I. Aljarah, M. Mafarja, A. A. Heidari, H. Faris, and S. Mirjalili, “Clustering analysis using a novel locality-informed grey wolf-inspired clustering approach,” Knowl. Inf. Syst., 2020, doi: 10.1007/s10115-019-01358-x.

T. Niknam and B. Amiri, “An efficient hybrid approach based on PSO, ACO and k-means for cluster analysis,” Appl. Soft Comput., vol. 10, no. 1, pp. 183–197, 2010.

P. S. Shelokar, V. K. Jayaraman, and B. D. Kulkarni, “An ant colony approach for clustering,” Anal. Chim. Acta, vol. 509, no. 2, pp. 187–195, 2004.

T. Niknam, B. B. Firouzi, and M. Nayeripour, “An efficient hybrid evolutionary algorithm for cluster analysis,” 2008.

A. Mostafa et al., “A hybrid grey wolf based segmentation with statistical image for ct liver images,” in International Conference on Advanced Intelligent Systems and Informatics, 2016, pp. 846–855.

R. Thilagavathy and R. Sabitha, “Using cloud effectively in concept based text mining using grey wolf self organizing feature map,” Cluster Comput., vol. 22, no. 5, pp. 10697–10707, 2019.

V. K. Kamboj, S. K. Bath, and J. S. Dhillon, “Solution of non-convex economic load dispatch problem using Grey Wolf Optimizer,” Neural Comput. Appl., vol. 27, no. 5, pp. 1301–1316, 2016.

E. Emary, H. M. Zawbaa, C. Grosan, and A. E. Hassenian, “Feature subset selection approach by gray-wolf optimization,” in Afro-European conference for industrial advancement, 2015, pp. 1–13.

W. H. El-Ashmawi, A. F. Ali, and A. Slowik, “An improved jaya algorithm with a modified swap operator for solving team formation problem,” Soft Comput., vol. 24, pp. 16627–16641, 2020.

M. Gunduz and M. Aslan, “DJAYA: A discrete Jaya algorithm for solving traveling salesman problem,” Appl. Soft Comput., vol. 105, p. 107275, 2021.

M. A. Rahman and M. Z. Islam, “A hybrid clustering technique combining a novel genetic algorithm with K-Means,” Knowledge-Based Syst., vol. 71, pp. 345–365, 2014.

I. Aljarah, M. Mafarja, A. A. Heidari, H. Faris, and S. Mirjalili, “Multi-verse optimizer: theory, literature review, and application in data clustering,” Nature-inspired Optim., pp. 123–141, 2020.

Y. Zhang, A. Chi, and S. Mirjalili, “Enhanced Jaya algorithm: A simple but efficient optimization method for constrained engineering design problems,” Knowledge-Based Syst., vol. 233, p. 107555, 2021.

M.-Y. Cheng and D. Prayogo, “Symbiotic organisms search: a new metaheuristic optimization algorithm,” Comput. & Struct., vol. 139, pp. 98–112, 2014.

H. Eskandar, A. Sadollah, A. Bahreininejad, and M. Hamdi, “Water cycle algorithm--A novel metaheuristic optimization method for solving constrained engineering optimization problems,” Comput. & Struct., vol. 110, pp. 151–166, 2012.

I. B. Aydilek, “A hybrid firefly and particle swarm optimization algorithm for computationally expensive numerical problems,” Appl. Soft Comput., vol. 66, pp. 232–249, 2018.

M. Abdel-Basset, G. Manogaran, D. El-Shahat, and S. Mirjalili, “A hybrid whale optimization algorithm based on local search strategy for the permutation flow shop scheduling problem,” Futur. Gener. Comput. Syst., vol. 85, pp. 129–145, 2018.

Y. Lin, Y. Liu, W.-N. Chen, and J. Zhang, “A hybrid differential evolution algorithm for mixed-variable optimization problems,” Inf. Sci. (Ny)., vol. 466, pp. 170–188, 2018.

H. Wang, Q. Geng, and Z. Qiao, “Parameter tuning of particle swarm optimization by using Taguchi method and its application to motor design,” in 2014 4th IEEE international conference on information science and technology, 2014, pp. 722–726.

K. Gholami, H. Olfat, and J. Gholami, “An intelligent hybrid JAYA and crow search algorithms for optimizing constrained and unconstrained problems,” Soft Comput., vol. 25, no. 22, pp. 14393–14411, 2021.

K. Thirumoorthy and K. Muneeswaran, “A hybrid approach for text document clustering using Jaya optimization algorithm,” Expert Syst. Appl., vol. 178, p. 115040, 2021.

Z.-M. Gao and J. Zhao, “An improved grey wolf optimization algorithm with variable weights,” Comput. Intell. Neurosci., vol. 2019, 2019.

X. Yu, W. Xu, and C. Li, “Opposition-based learning grey wolf optimizer for global optimization,” Knowledge-Based Syst., vol. 226, p. 107139, 2021.

J. S. Akosa, “Predictive Accuracy : A Misleading Performance Measure for Highly Imbalanced Data,” 2017.

Downloads

Published

2023-10-01

How to Cite

SHIAL, G., Sahoo, S., & Panigrahi, S. . (2023). A Nature Inspired Hybrid Partitional Clustering Method Based on Grey Wolf Optimization and JAYA Algorithm: A NATURE INSPIRED HYBRID PARTITIONAL CLUSTERING METHOD BASED ON GWO AND JAYA ALGORITHM. Computer Science, 24(3). https://doi.org/10.7494/csci.2023.24.3.4962

Issue

Section

Articles