Solving Support Vector Machine Model Selection Problem Using Continuous Ant Colony Optimization

• Main Authors: Alwan, Hiba Basim, Ku-Mahamud, Ku Ruhana
• Format: Article
• Language: English
• Published: AICIT. Korea 2013
• Subjects: QA76 Computer software
• Online Access: http://repo.uum.edu.my/9843/1/H.pdf; http://repo.uum.edu.my/9843/; http://dx.doi.org/10.4156/ijipm.vol4.issue2.10

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.