Search Results - (( parameter optimization _ algorithm ) OR ( variables classification problems algorithm ))

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

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 Hybrid Adaptive Leadership GWO Optimization with Category Gradient Boosting on Decision Trees Algorithm for Credit Risk Control Classification by Suihai, Chen, Chih How, Bong, Po Chan, Chiu

“…Initially, the Grey Wolf algorithm (GWO) is leveraged to exploit its advantages in identifying optimal parameters. …”
Get full text
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

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

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

Incremental continuous ant colony optimization technique for support vector machine model selection problem 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. …”
Get full text
Get full text

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

“…BRF algorithm combines the strengths of random subset and greedy selection procedures in creating new maximal ordered variable relevance weights. …”
Get full text
Get full text
Get full text
Get full text

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

“…Three major factors that determine the performance of a machine learning are the choice of a representative set of features, choosing a suitable machine learning algorithm and the right selection of the training parameters for a specified machine learning algorithm. …”
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

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

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

Framework of Meta-Heuristic Variable Length Searching for Feature Selection in High-Dimensional Data by Qadir Saraf, Tara Othman, Fuad, Norfaiza, Md Taujuddin, Nik Shahidah Afifi

“…The literature contains various meta-heuristic algorithms with variable length searching. All of them enable searching in high dimensional problems. …”
Get full text
Get full text
Get full text

Framework of Meta-Heuristic Variable Length Searching for Feature Selection in High-Dimensional Data by Qadir Saraf, Tara Othman, Fuad, Norfaiza, Md Taujuddin, Nik Shahidah Afifi

“…The literature contains various meta-heuristic algorithms with variable length searching. All of them enable searching in high dimensional problems. …”
Get full text
Get full text
Get full text

Framework of Meta-Heuristic Variable Length Searching for Feature Selection in High-Dimensional Data by Qadir Sara, Tara Othman, Fuad, Norfaiza, Md Taujuddin, Nik Shahidah Afifi

“…The literature contains various meta-heuristic algorithms with variable length searching. All of them enable searching in high dimensional problems. …”
Get full text
Get full text
Get full text

Pattern Recognition for Human Diseases Classification in Spectral Analysis by Nur Hasshima Hasbi, Abdullah Bade, Fuei, Pien Chee, Muhammad Izzuddin Rumaling

“…On the other hand, classification methods are techniques or algorithms used to group samples into a predetermined category. …”
Get full text
Get full text
Get full text
Get full text
Get full text