Search Results - (( simulation optimization modified algorithm ) OR ( variable optimization svm algorithm ))

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

“…The first two algorithms, ACOR-SVM and IACOR-SVM, tune the SVM parameters while the second two algorithms, ACOMV-R-SVM and IACOMV-R-SVM, tune the SVM parameters and select the feature subset simultaneously. …”
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

Feature selection and model selection algorithm using incremental mixed variable ant colony optimization for support vector machine classifier by Alwan, Hiba Basim, Ku-Mahamud, Ku Ruhana

“…In order to enhance SVM performance, these problems must be solved simultaneously because error produced from the feature subset selection phase will affect the values of the SVM parameters and resulted in low classification accuracy.Most approaches related with solving SVM model selection problem will discretize the continuous value of SVM parameters which will influence its performance.Incremental Mixed Variable Ant Colony Optimization (IACOMV) has the ability to solve SVM model selection problem without discretising the continuous values and simultaneously solve the two problems.This paper presents an algorithm that integrates IACOMV and SVM.Ten datasets from UCI were used to evaluate the performance of the proposed algorithm.Results showed that the proposed algorithm can enhance the classification accuracy with small number of features.…”
Get full text
Get full text
Get full text

Mixed variable ant colony optimization technique for feature subset selection and model selection by Alwan, Hiba Basim, Ku-Mahamud, Ku Ruhana

“…This paper presents the integration of Mixed Variable Ant Colony Optimization and Support Vector Machine (SVM) to enhance the performance of SVM through simultaneously tuning its parameters and selecting a small number of features.The process of selecting a suitable feature subset and optimizing SVM parameters must occur simultaneously,because these processes affect each ot her which in turn will affect the SVM performance.Thus producing unacceptable classification accuracy.Five datasets from UCI were used to evaluate the proposed algorithm.Results showed that the proposed algorithm can enhance the classification accuracy with the small size of features subset.…”
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

Intelligent classification algorithms in enhancing the performance of support vector machine by Alwan, Hiba Basim, Ku-Mahamud, Ku Ruhana

“…This paper presents two intelligent algorithms that hybridized between ant colony optimization (ACO) and SVM for tuning SVM parameters and selecting feature subset without having to discretize the continuous values. …”
Get full text
Get full text
Get full text

Integrated ACOR/IACOMV-R-SVM Algorithm by Alwan, Hiba Basim, Ku-Mahamud, Ku Ruhana

“…The first algorithm, ACOR-SVM, will tune SVM parameters, while the second IACOMV-R-SVM algorithm will simultaneously tune SVM parameters and select the feature subset. …”
Get full text
Get full text
Get full text

A Modified Simulated Kalman Filter Optimizer with State Measurement, Substitution Mutation, Hamming Distance Calculation, and 2-Opt Operator by Suhazri Amrin, Rahmad, Zuwairie, Ibrahim, Zulkifli, Md. Yusof

“…The simulated Kalman filter (SKF) is an algorithm for population-based optimization based on the Kalman filter framework. …”
Get full text
Get full text
Get full text
Get full text

Optimized clustering with modified K-means algorithm by Alibuhtto, Mohamed Cassim

“…Testing on real data sets showed consistency results as the simulated ones. Generally, the proposed modified k-means algorithm is able to determine the optimum number of clusters for huge data.…”
Get full text
Get full text
Get full text
Get full text

A Modified Simulated Kalman Filter Optimizer with State Measurement, Substitution Mutation, Hamming Distance Calculation, and Swap Operator by Suhazri Amrin, Rahmad, Zuwairie, Ibrahim, Zulkifli, Md. Yusof

“…The modified algorithm is called Discrete Simulated Kalman Filter Optimizer (DSKFO). …”
Get full text
Get full text
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

A Modified Gravitational Search Algorithm for Discrete Optimization Problem by Zuwairie, Ibrahim, Zulkifli, Md. Yusof, Shahdan, Sudin, Sophan Wahyudi, Nawawi, Amar Faiz, Zainal Abidin, Muhammad Arif, Abdul Rahim, Kamal, Khalil

Get full text
Get full text
Get full text

A novel quasi-oppositional modified Jaya algorithm for multi-objective optimal power flow solution by Warid, Warid, Hizam, Hashim, Mariun, Norman, Abdul Wahab, Noor Izzri

“…This study introduces a novel meta-heuristic optimization algorithm known as quasi-oppositional modified Jaya (QOMJaya) to solve different multi-objective optimal power flow (MOOPF) problems. …”
Get full text
Get full text
Get full text

Simulated kalman filter with modified measurement, substitution mutation and hamming distance calculation for solving traveling salesman problem by Suhazri Amrin, Rahmad, Zuwairie, Ibrahim, Zulkifli, Md. Yusof

Get full text
Get full text
Get full text
Get full text

Simulated Kalman Filter with modified measurement, substitution mutation and hamming distance calculation for solving traveling salesman problem by Suhazri Amrin, Rahmad, Zuwairie, Ibrahim, Zulkifli, Md. Yusof

Get full text
Get full text
Get full text
Get full text

Process Planning Optimization In Reconfigurable Manufacturing Systems by Musharavati, Farayi

“…The five (5) AADTs include; a variant of the simulated annealing algorithm that implements heuristic knowledge at critical decision points, two (2) cooperative search schemes based on a “loose hybridization” of the Boltzmann Machine algorithm with (i) simulated annealing, and (ii) genetic algorithm search techniques, and two (2) modified genetic algorithms. …”
Get full text
Get full text

New random approaches of modified adaptive bats sonar algorithm for reservoir operation optimization problems by Nor Shuhada, Ibrahim

“…In the fourth phase, the newly developed algorithm undergoes testing on the formulated ROOPs and compared to several contemporary optimizer algorithms. …”
Get full text
Get full text

Modification of the ant colony optimization algorithm for solving multi-agent task allocation problem in agricultural application by Hardhienata, Medria Kusuma Dewi, Priandana, Karlisa, Putra, Daffa Rangga, Sriatun, Mamiek, Wulandari, Buono, Agus, Mohamed, Raihani

“…In this study, Ant Colony Optimization (ACO) algorithm is employed to find the best coalition of agents. …”
Get full text
Get full text
Get full text

Optimal power flow using the Jaya algorithm by Warid, Warid, Hizam, Hashim, Mariun, Norman, Abdul Wahab, Noor Izzri

“…Simulations are carried out on the modified IEEE 30-bus and IEEE 118-bus networks to determine the effectiveness of the Jaya algorithm. …”
Get full text
Get full text
Get full text

An application of modified adaptive bats sonar algorithm (MABSA) on fuzzy logic controller for dc motor accuracy by Nurainaa, Elas

“…Therefore, this research presents works on the FLC system which is the fuzzy inference system that will be optimized by the modified adaptive bats sonar algorithm (MABSA) for the DC servo motor position control. …”
Get full text
Get full text