Abstract

Using Support Vector Machine (SVM) requires the selection of several parameters such as multi-class strategy type (one-against-all or one-against-one), the regularization parameter C, kernel function and their parameters. The choice of these parameters has a great influence on the performance of the final classifier. This paper considers the grid search method and the particle swarm optimization (PSO) technique that have allowed to quickly select and scan a large space of SVM parameters. A comparative study of the SVM models is also presented to examine the convergence speed and the results of each model. SVM is applied to handwritten Arabic characters learning, with a database containing 4840 Arabic characters in their different positions (isolated, beginning, middle and end). Some very promising results have been achieved.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.