Search Results - (( sequence optimization path algorithm ) OR ( parameter 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

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

Application of the Bees Algorithm to find optimal drill path sequence by Zainal Abidin, Muhammad Harith, Kamaruddin, Shafie, Adam Malek, Afiqah, Sukindar, Nor Aiman

“…These results show that the Bees Algorithm can be an alternative approach to find the optimal drilling sequence.…”
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

Improved Manta Ray Foraging Optimizer-based SVM for Feature Selection Problems: A Medical Case Study by Got, Adel, Zouache, Djaafar, Moussaoui, Abdelouahab, Laith, Abualigah *, Alsayat, Ahmed

“…In this paper, the MRFO + SVM algorithm is introduced by investigating the recent manta ray foraging optimizer to fine-tune the SVM parameters and identify the optimal feature subset simultaneously. …”
Get full text
Get full text

Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator: article by Othman, Nor Shuhaida

“…The Smith-Waterman is been simplified into four modules which were initialization, score calculation, matrix filling and optimal path. The scope of the paper based on optimal path trace back using graph theory. …”
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

LS-SVM Hyper-parameters Optimization Based on GWO Algorithm for Time Series Forecasting by Zuriani, Mustaffa, Mohd Herwan, Sulaiman, M. N. M., Kahar

Get full text
Get full text
Get full text

Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator by Othman, Nor Shuhaida

“…The Smith-Waterman is been simplified into four modules which were initialization, score calculation, matrix filling and optimal path. The scope of the paper based on optimal path trace back using graph theory. …”
Get full text
Get full text

Abnormalities and fraud electric meter detection using hybrid support vector machine & genetic algorithm by Yap K.S., Abidin I.Z., Ahmad A.R., Hussien Z.F., Pok H.L., Ismail F.I., Mohamad A.M.

Subjects:

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

Optimization of drilling path using the bees algorithm by Kamaruddin, Shafie, Rosdi, Mohamad Naqiuddin, Sukindar, Nor Aiman

“…This study uses the Bees Algorithm to find the best sequence of drilling holes (minimum total path length) and the results found are compared with the result of other algorithms. …”
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

Improved hybrid teaching learning based optimization-jaya and support vector machine for intrusion detection systems by Mohammad Khamees Khaleel, Alsajri

“…Meanwhile, an improved parallel Jaya (IPJAYA) algorithm was proposed for searching the best parameters (C, Gama) values of SVM. …”
Get full text
Get full text

Path optimization using genetic algorithm in laser scanning system by Chen, Chai Phing, Koh, Johnny Siaw Paw, Aris, Ishak, Fong, Albert Yu Chooi, Tiong, Sieh Kiong

“…In this paper, the genetic algorithm (GA) has been proposed to optimize the scanning sequence, thus shortening the required laser scanning path. …”
Get full text
Get full text

Path optimization using genetic algorithm in laser scanning system by Chen C.P., Koh S.P., Aris I.B., Albert F.Y.C., Tiong S.K.

Subjects:

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

MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD by ABDULLAH, H., LAW BOON HUI, C., ZAKARIA, M. S.

“…Matlab software was used to develop the algorithm based on Ant Colony, which was then used to optimize the process sequence. …”
Get full text
Get full text

MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD by ABDULLAH, H., LAW BOON HUI, C., ZAKARIA, M. S.

“…Matlab software was used to develop the algorithm based on Ant Colony, which was then used to optimize the process sequence. …”
Get full text
Get full text

MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD by ABDULLAH, H., LAW BOON HUI, C., ZAKARIA, M. S.

“…Matlab software was used to develop the algorithm based on Ant Colony, which was then used to optimize the process sequence. …”
Get full text
Get full text