AN IMPROVED MULTI-VERSE OPTIMIZER FOR TEXT DOCUMENTS CLUSTERING

Authors

  • Ammar Abasi Artificial Intelligence Research Center (AIRC), College of Engineering and Information Technology, Ajman University, United Arab Emaraties - School of Computer Sciences, Universiti Sains Malaysia, 11800, Penang, Malaysia https://orcid.org/0000-0003-0725-6167
  • Ahamad Tajudin Khader School of Computer Sciences, Universiti Sains Malaysia, 11800, Penang, Malaysia
  • Mohammed Azmi Al-Betar Department of information technology, Al-Huson University College, Al-Huson, Irbid-Jordan

DOI:

https://doi.org/10.30572/2018/KJE/130203

Keywords:

Multi-verse optimizer, Optimization, Test clustering, Data clustering, Neighborhood selection strateg

Abstract

Text document clustering (TDC) represents a key task in text mining and unsupervised machine learning, which partitions a specific documents’ collection into varied K-groups according to certain similarity/dissimilarity criterion. The multi-verse optimizer algorithm (MVO) is a stochastic population-based algorithm, which was recently introduced and successfully utilized to tackle many optimization problems that are complex. The original MVO performance is limited to the utilization of only the best solution in the exploitation phase (local search capability), which makes it suffer from entrapment in local optima and low convergence rate. This paper aims to propose a novel method of modifying the MVO algorithm called link-based multi-verse optimizer algorithm (LBMVO) to enhance the exploitation phase in the original MVO. Generally, LBMVO has outperformed or at least showed that it is profoundly competitive compared with the original MVO algorithm.

Downloads

Download data is not yet available.

Downloads

Published

2022-04-01

How to Cite

Abasi, Ammar, et al. “AN IMPROVED MULTI-VERSE OPTIMIZER FOR TEXT DOCUMENTS CLUSTERING”. Kufa Journal of Engineering, vol. 13, no. 2, Apr. 2022, pp. 28-42, doi:10.30572/2018/KJE/130203.

Similar Articles

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 > >> 

You may also start an advanced similarity search for this article.