Search Results - (( using optimization _ algorithm ) OR ( using selection problem algorithm ))

Improved Salp Swarm Algorithm based on opposition based learning and novel local search algorithm for feature selection by Tubishat, Mohammad, Idris, Norisma, Shuib, Liyana, Abushariah, Mohammad A.M., Mirjalili, Seyedali

“…An improved version of Salp Swarm Algorithm (ISSA) is proposed in this study to solve feature selection problems and select the optimal subset of features in wrapper-mode. …”
Get full text
Get full text

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

“…ACO originally deals with discrete optimization problem.In applying ACO for solving SVM model selection problem which are continuous variables, there is a need to discretize the continuously value into discrete values.This discretization process would result in loss of some information and hence affects the classification accuracy and seeking time.In this algorithm we propose to solve SVM model selection problem using IACOR without the need to discretize continuous value for SVM.The second algorithm aims to simultaneously solve SVM model selection problem and selects a small number of features.SVM model selection and selection of suitable and small number of feature subsets must occur simultaneously because error produced from the feature subset selection phase will affect the values of SVM model selection and result in low classification accuracy.In this second algorithm we propose the use of IACOMV to simultaneously solve SVM model selection problem and features subset selection.Ten benchmark datasets were used to evaluate the proposed algorithms.Results showed that the proposed algorithms can enhance the classification accuracy with small size of features subset.…”
Get full text
Get full text
Get full text

Optimization of mycelium growth using genetic algorithm for multi-objective functions by Muhamad Faiz, Abu Bakar

“…Mathematical optimization was typical use for such problem, in which it was supposed to maximizing or minimizing a function. …”
Get full text
Get full text
Get full text

A Comparative Study on three Component Selection Mechanisms for Hyper-Heuristics in Expensive Optimization by Jia Hui Ong, Jason Teo

“…Numerous studies in optimization problems often lead to tailoring a specific algorithm to adapt to the problem instances, especially in expensive optimization problems. …”
Get full text
Get full text
Get full text

Improved whale optimization algorithm for feature selection in Arabic sentiment analysis by Tubishat, Mohammad, Abushariah, Mohammad A.M., Idris, Norisma, Aljarah, Ibrahim

“…However, WOA suffers from the same problem faced by many other optimization algorithms and tend to fall in local optima. …”
Get full text
Get full text

Improved flower pollination optimization algorithm based on swap operator and dynamic switch probability selection by Iqbal, Muhammad

“…The proposed algorithm is ranked first among the stated algorithms with respect to its performance in getting the optimal solution…”
Get full text
Get full text
Get full text
Get full text

Metaheuristic algorithms for feature selection (2014–2024) by Faizan, Muhammad, Muhammad Arif, Mohamad

“…Metaheuristic algorithms are suited to provide solutions to feature selection problems because these problems are combinatorial and require an effective and efficient search through large solution spaces. …”
Get full text
Get full text
Get full text

Review of Nature Inspired Metaheuristic Algorithm Selection for Combinatorial t-way Testing by Muazu, A.A., Hashim, A.S., Sarlan, A.

“…Metaheuristic algorithm is a very important area of research that continuously improve in solving optimization problems. …”
Get full text
Get full text

Rule-Based Multi-State Gravitational Search Algorithm for Discrete Optimization Problem by Ismail, Ibrahim, Zuwairie, Ibrahim, Zulkifli, Md. Yusof

“…To evaluate the performances of the proposed algorithm and the BGSA, several experiments using six sets of selected benchmarks instances of traveling salesman problem (TSP) are conducted. …”
Get full text
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

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

“…A comparative study is conducted to compare the effectiveness of QBHHO with other feature selection algorithms such as binary differential evolution (BDE), genetic algorithm (GA), binary multi-verse optimizer (BMVO), binary flower pollination algorithm (BFPA), and binary salp swarm algorithm (BSSA). …”
Get full text
Get full text
Get full text

An improved artificial immune system based on antibody remainder method for mathematical function optimization by Yap D.F.W., Habibullah A., Koh S.P., Tiong S.K.

“…Alternatively, Genetic Algorithms (GAs) and Particle Swarm Optimization (PSO) have been used efficiently in solving complex optimization problems, but they have a tendency to converge prematurely. …”

Successor selection for Ant Colony Optimization technique algorithm / Muhammad Iskandar Isman by Isman, Muhammad Iskandar

“…Therefore, in this research, will be use Ant Colony Optimization (ACO) algorithm as an optimize technique that provide a shortest path of defining a successor that is their highest value of criteria. …”
Get full text
Get full text

Multi-Objective Portfolio Optimization Strategy using the SPEA-II Algorithm by Azarberahman, Alireza, Tohidinia, Malihe, Aliakbarzadeh, Hossein

“…Realistic constraints are applied to formulate a multi-objective optimization problem. SPEA-II and traditional multi-objective optimization methods are used to solve this problem, resulting in a set of optimal portfolios. …”
Get full text
Get full text
Get full text

Network reconfiguration and control for loss reduction using genetic algorithm by Jawad, Mohamed Hassan Izzaldeen

“…Note that the 18-bus system is originally without any capacitor. Two selection methods that are used in Genetic Algorithm are the roulette wheel and tournament selections. …”
Get full text
Get full text

Inversed Control Parameter in Whale Optimization Algorithm and Grey Wolf Optimizer for Wrapper-Based Feature Selection: A Comparative Study by Li Yu Yab, Li Yu Yab, Wahid, Noorhaniza, A Hamid, Rahayu

“…—Whale Optimization Algorithm (WOA) and Grey Wolf Optimizer (GWO) are well-perform metaheuristic algorithms used by various researchers in solving feature selection problems. …”
Get full text
Get full text

Inversed Control Parameter in Whale Optimization Algorithm and Grey Wolf Optimizer for Wrapper-Based Feature Selection: A Comparative Study by Li Yu Yab, Li Yu Yab, Wahid, Noorhaniza, A Hamid, Rahayu

“…Whale Optimization Algorithm (WOA) and Grey Wolf Optimizer (GWO) are well-perform metaheuristic algorithms used by various researchers in solving feature selection problems. …”
Get full text
Get full text

Cuckoo search algorithm and wind driven optimization based study of satellite image segmentation for multilevel thresholding using Kapur’s entropy by Bhandari, A.K., Singh, V.K, Kumar, A., Singh, G.K.

“…A new approach of CS and WDO algorithm is used for selection of optimal threshold value. …”
Get full text
Get full text

Broadening selection competitive constraint handling algorithm for faster convergence by Shaikh, T.A., Hussain, S.S., Tanweer, M.R., Hashmani, M.A.

“…The proposed algorithm has been evaluated using 24 benchmark functions. …”
Get full text
Get full text

Ant colony optimization for rule induction with simulated annealing for terms selection by Saian, Rizauddin, Ku-Mahamud, Ku Ruhana

“…This paper proposes a sequential covering based algorithm that uses an ant colony optimization algorithm to directly extract classification rules from the data set.The proposed algorithm uses a Simulated Annealing algorithm to optimize terms selection, while growing a rule.The proposed algorithm minimizes the problem of a low quality discovered rule by an ant in a colony, where the rule discovered by an ant is not the best quality rule, by optimizing the terms selection in rule construction. …”
Get full text
Get full text
Get full text