Search Results - (( variables classification problem algorithm ) OR ( simulation optimization method algorithm ))

Bayesian random forests for high-dimensional classification and regression with complete and incomplete microarray data by Oyebayo, Olaniran Ridwan

“…Random Forests (RF) are ensemble of trees methods widely used for data prediction, interpretation and variable selection purposes. …”
Get full text
Get full text
Get full text
Get full text

Information Theoretic-based Feature Selection for Machine Learning by Muhammad Aliyu, Sulaiman

“…In these extended IFS method, feature selection method was defined and presented as a 0-1 Knapsack Problem (MKP). …”
Get full text
Get full text
Get full text
Get full text

Classification for large number of variables with two imbalanced groups by Ahmad Hakiim, Jamaluddin

“…This study proposed two algorithms of classification namely Algorithm 1 and Algorithm 2 which combine resampling, variable extraction, and classification procedure. …”
Get full text
Get full text
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

“…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

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

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

Study on numerical solution of a variable order fractional differential equation based on symmetric algorithm by Liu, Jingrui, Pan, Dongyang

“…A fully symmetric classification of the boundary value problem for a class of fractional differential equations with variable sequences is determined by using a fully symmetric differential sequence sorting algorithm. …”
Get full text
Get full text
Get full text

Application of Optimization Methods for Solving Clustering and Classification Problems by Shabanzadeh, Parvaneh

“…The focus of this thesis is on solvingclustering and classification problems. Specifically, we will focus on new optimization methods for solving clustering and classification problems. …”
Get full text
Get full text

Mixed-variable ant colony optimisation algorithm for feature subset selection and tuning support vector machine parameter by Alwan, Hiba Basim, Ku-Mahamud, Ku Ruhana

“…This paper presents a hybrid classification algorithm, ACOMV-SVM which is based on ant colony and support vector machine.A new direction for ant colony optimisation is to optimise mixed (discrete and continuous) variables.The optimised variables are then feed into selecting feature subset and tuning its parameters are two main problems of SVM.Most approaches related to tuning support vector machine parameters will discretise the continuous value of the parameters which will give a negative effect on the performance. …”
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

“…However, the original HHO is developed to solve the continuous optimization problems, but not to the problems with binary variables. …”
Get full text
Get full text
Get full text

Optimization of turning parameters using genetic algorithm method by Shah Izwandi, Mohd Zawawi

“…The simulation based on Genetic Algorithm are successful develop and the optimum parameters values are obtained from the simulation.…”
Get full text
Get full text

Hybrid firefly and particle swarm optimization algorithm for multi-objective optimal power flow with distributed generation by Khan, Abdullah

“…This thesis proposes and simulates the three novel optimization algorithms to handle DG allocation, different single-objective, and multi-objective OPF problems. …”
Get full text
Get full text

A discrete simulated kalman filter optimizer for combinatorial optimization problems by Suhazri Amrin, Rahmad

“…An example of a numerical algorithm is the simulated Kalman filter (SKF). Various method has been introduced as an extension of a numerical algorithm to adapt it to a discrete search space. …”
Get full text
Get full text

Route optimization using shortest path method / Muhamad Faisal Amin Shakri by Shakri, Muhamad Faisal Amin

“…Therefore, the effectiveness of route planning is very essential. The method to study route optimization is called shortest path method. …”
Get full text
Get full text

Improved particle swarm optimization by fast annealing algorithm by Bashath, Samar, Ismail, Amelia Ritahani

“…We also apply the algorithm in clustering problem, and the results shows that the proposed method has better accuracy than the optimization methods.…”
Get full text
Get full text
Get full text
Get full text

Asynchronous simulated kalman filter optimization algorithm by Zuwairie, Ibrahim, Nor Azlina, Ab. Aziz, Nor Hidayati, Abd Aziz, Tasiransurini, Ab Rahman

“…Simulated Kalman filter (SKF) is an optimization algorithm which is inspired by Kalman filtering method. …”
Get full text
Get full text
Get full text
Get full text

Simulated Kalman Filter algorithms for solving optimization problems by Nor Hidayati, Abdul Aziz

“…In this research, two novel estimation-based metaheuristic optimization algorithms, named as Simulated Kalman Filter (SKF), and single-solution Simulated Kalman Filter (ssSKF) algorithms are introduced for global optimization problems. …”
Get full text
Get full text

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

“…A direction for ACO is to optimize continuous and mixed (discrete and continuous) variables in solving problems with various types of data. …”
Get full text
Get full text
Get full text

Gas Identi cation by Using a Cluster-k-Nearest-Neighbor by Brahim Belhaouari, samir

“…We find 98.7% of accuracy in the classification of 6 different types of Gas by using K-means cluster algorithm and we find almost the same by using the new clustering algorithm.…”
Get full text
Get full text

Optimization of milling parameters using ant colony optimization by Mohd Saupi, Mohd Sauki

“…The simulation based on ACO algorithm are successful develop and the optimization of parameters values is to maximize the production rate is obtain from the simulation.…”
Get full text
Get full text