Search Results - (( using continuous optimization algorithm ) OR ( java application status algorithm ))

Optimization and discretization of dragonfly algorithm for solving continuous and discrete optimization problems by Bibi Amirah Shafaa, Emambocus

“…Furthermore, the original DA is only suitable for solving continuous optimization problems. Although there is a binary version of the algorithm, it cannot be directly used for solving discrete optimization problems like the Traveling Salesman Problem (TSP). …”
Get full text
Get full text

Modification of particle swarm optimization algorithm for optimization of discrete values by Mohd Yassin, Ahmad Ihsan, Jusoh, Muhammad Huzaimy, Abdul Rahman, Farah Yasmin

“…Using this method, the optimization is still done in continuous form, but the solution is generated in discrete form. …”
Get full text
Get full text

Identification of continuous-time hammerstein model using improved archimedes optimization algorithm by Islam, Muhammad Shafiqul, Mohd Ashraf, Ahmad, Cho, Bo Wen

“…Therefore, this article identified various continuous-time Hammerstein models based on an improved Archimedes optimization algorithm (IAOA) to address these concerns. …”
Get full text
Get full text
Get full text
Get full text

Optimizing support vector machine parameters using continuous ant colony optimization by Alwan, Hiba Basim, Ku-Mahamud, Ku Ruhana

“…Hence, in applying Ant Colony Optimization for optimizing Support Vector Machine parameters, which are continuous parameters, there is a need to discretize the continuous value into a discrete value.This discretization process results in loss of some information and, hence, affects the classification accuracy and seek time.This study proposes an algorithm to optimize Support Vector Machine parameters using continuous Ant Colony Optimization without the need to discretize continuous values for Support Vector Machine parameters.Seven datasets from UCI were used to evaluate the performance of the proposed hybrid algorithm.The proposed algorithm demonstrates the credibility in terms of classification accuracy when compared to grid search techniques.Experimental results of the proposed algorithm also show promising performance in terms of computational speed.…”
Get full text
Get full text
Get full text

Incremental continuous ant colony optimization for tuning support vector machine’s parameters by Alwan, Hiba Basim, Ku-Mahamud, Ku Ruhana

“…Hence, in applying Ant Colony Optimization for optimizing Support Vector Machine parameters, which are continuous in nature, the values wil have to be discretized.The discretization process will result in loss of some information and, hence, affects the classification accuracy and seeks time.This paper presents an algorithm to optimize Support Vector Machine parameters using Incremental continuous Ant Colony Optimization without the need to discretize continuous values.Eight datasets from UCI were used to evaluate the performance of the proposed algorithm.The proposed algorithm demonstrates the credibility in terms of classification accuracy when compared to grid search techniques, GA with feature chromosome-SVM, PSO-SVM, and GA-SVM.Experimental results of the proposed algorithm also show promising performance in terms of classification accuracy and size of features subset.…”
Get full text
Get full text
Get full text

Data-driven continuous-time Hammerstein modeling with missing data using improved Archimedes optimization algorithm by Islam, Muhammad Shafiqul, Mohd Ashraf, Ahmad

Get full text
Get full text
Get full text

A hybrid metaheuristic algorithm for identification of continuous-time Hammerstein systems by Jui, Julakha Jahan, Mohd Ashraf, Ahmad

“…This paper presents a new hybrid identification algorithm called the Average Multi-Verse Optimizer and Sine Cosine Algorithm for identifying the continuous-time Hammerstein system. …”
Get full text
Get full text

Hybrid harmony search algorithm for continuous optimization problems by Ala’a Atallah, Hamad Alomoush

“…Taken together, the proposed hybrid algorithm, called IHS-GWO, aims to address continuous optimization problems. …”
Get full text
Get full text

An improve unsupervised discretization using optimization algorithms for classification problems by Mohamed, Rozlini, Samsudin, Noor Azah

“…This paper addresses the classification problem in machine learning focusing on predicting class labels for datasets with continuous features. Recognizing the critical role of discretization in enhancing classification performance, the study integrates equal width binning (EWB) with two optimization algorithms: the bat algorithm (BA), referred to as EB, and the whale optimization algorithm (WOA), denoted as EW. …”
Get full text
Get full text
Get full text

An improve unsupervised discretization using optimization algorithms for classification problems by Mohamed, Rozlini, Samsudin, Noor Azah

“…This paper addresses the classification problem in machine learning, focusing on predicting class labels for datasets with continuous features. Recognizing the critical role of discretization in enhancing classification performance, the study integrates equal width binning (EWB) with two optimization algorithms: the bat algorithm (BA), referred to as EB, and the whale optimization algorithm (WOA), denoted as EW. …”
Get full text
Get full text
Get full text

Optimization of travelling salesman problem with precedence constraint using modified GA encoding by M. F. F., Ab Rashid, N. M. Zuki, N. M., F. R. M., Romlay, M., Jusop

“…Genetic algorithm (GA) is one of popular algorithm used to optimize TSPPC. …”
Get full text
Get full text
Get full text

Formulating new enhanced pattern classification algorithms based on ACO-SVM by Alwan, Hiba Basim, Ku-Mahamud, Ku Ruhana

“…This paper presents two algorithms that integrate new Ant Colony Optimization (ACO) variants which are Incremental Continuous Ant Colony Optimization (IACOR) and Incremental Mixed Variable Ant Colony Optimization (IACOMV) with Support Vector Machine (SVM) to enhance the performance of SVM.The first algorithm aims to solve SVM model selection problem. …”
Get full text
Get full text
Get full text

Identification of continuous-time model of hammerstein system using modified multi-verse optimizer by Most. Julakha, Jahan Jui

“…his thesis implements a novel nature-inspired metaheuristic optimization algorithm, namely the modified Multi-Verse Optimizer (mMVO) algorithm, to identify the continuous-time model of Hammerstein system. …”
Get full text
Get full text

Solving Support Vector Machine Model Selection Problem Using Continuous Ant Colony Optimization by Alwan, Hiba Basim, Ku-Mahamud, Ku Ruhana

“…Ant Colony Optimization has been used to solve Support Vector Machine model selection problem.Ant Colony Optimization originally deals with discrete optimization problem.In applying Ant Colony Optimization for optimizing Support Vector Machine parameters which are continuous variables, there is a need to discretize the continuously value into discrete value.This discretize process would result in loss of some information and hence affect the classification accuracy and seeking time.This study proposes an algorithm that can optimize Support Vector Machine parameters using Continuous Ant Colony Optimization without the need to discretize continuous value for Support Vector Machine parameters.Eight datasets from UCI were used to evaluate the credibility of the proposed hybrid algorithm in terms of classification accuracy and size of features subset.Promising results were obtained when compared to grid search technique, GA with feature chromosome-SVM, PSO-SVM, and GA-SVM.…”
Get full text
Get full text
Get full text

Enhancing three variants of harmony search algorithm for continuous optimization problems by Alomoush, Alaa A., Alsewari, Abdulrahman A., Kamal Z., Zamli, Alrosan, Ayat, Alomoush, Waleed, Alissa, Khalid

Get full text
Get full text
Get full text

Hybrid ACO and SVM algorithm for pattern classification by Alwan, Hiba Basim

“…Ant Colony Optimization (ACO) is a metaheuristic algorithm that can be used to solve a variety of combinatorial optimization problems. …”
Get full text
Get full text
Get full text

A New Quadratic Binary Harris Hawk Optimization For Feature Selection by Abdullah, Abdul Rahim, Too, Jing Wei, Mohd Saad, Norhashimah

“…Harris hawk optimization (HHO) is one of the recently proposed metaheuristic algorithms that has proven to be work more effectively in several challenging optimization tasks. …”
Get full text
Get full text
Get full text

Solving SVM model selection problem using ACOR and IACOR by Alwan, Hiba Basim, Ku-Mahamud, Ku Ruhana

“…In applying ACO for optimizing SVM parameters which are continuous variables, there is a need to discretize the continuously value into discrete values.This discretize process would result in loss of some information and hence affect the classification accuracy.In order to enhance SVM performance and solving the discretization problem, this study proposes two algorithms to optimize SVM parameters using Continuous ACO (ACOR) and Incremental Continuous Ant Colony Optimization (IACOR) without the need to discretize continuous value for SVM parameters.Eight datasets from UCI were used to evaluate the credibility of the proposed integrated algorithm in terms of classification accuracy and size of features subset.Promising results were obtained when compared to grid search technique, GA with feature chromosome-SVM, PSO-SVM, and GA-SVM. …”
Get full text
Get full text
Get full text

A Multi-objective Evolutionary Algorithm Based On Decomposition For Continuous Optimization Using A Step-function Technique by Chuah, How Siang

Get full text
Get full text

Distance evaluated simulated kalman filter with state encoding for combinatorial optimization problems by Yusof, Zulkifli Md., Ibrahim, Zuwairie, Adam, Asrul, Azmi, Kamil Zakwan Mohd, Ab. Rahman, Tasiransurini, Muhammad, Badaruddin, Ab. Aziz, Nor Azlina, Abd Aziz, Nor Hidayati, Mokhtar, Norrima, Shapiai, Mohd Ibrahim, Muhammad, Mohd Saberi

“…The SKF algorithm only capable to solve numerical optimization problems which involve continuous search space. …”
Get full text
Get full text