Abstract
Support vector machines SVM) is a very popular algorithm used widely in the classification problem. The basic idea of SVM is to construct two parallel hyperplanes to separate two classes of instances and maximize the distance between the hyperplanes. In this paper, we propose a new algorithm called SVM-ICC-DBTCPRP one to solve the parameter optimization problem by improving the grid algorithm used by Fayed and Atiya. In the new algorithm there are two main sub-algorithms that are used to preselect the support vectors for reducing the time of training and preselect the parameter range to reduce the number of training respectively. Six typical data sets are selected to verify the effectiveness of our algorithm. The computed results show that our algorithm has the obvious advantage on the aspect of elapsed time than the one of Fayed and Atiya.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
