Abstract
At present sequential minimal optimization (SMO) is one of the most popular and efficient training algorithms for support vector machines (SVM), especially for large-scale problems. A novel strategy for selecting working sets applied in SMO is presented in the paper. Based on the original feasible direction method, the new strategy also takes the efficiency of kernel cache maintained in SMO into consideration. It is shown in the experiments on the well-known data sets that computation of the kernel function and training time is reduced greatly, especially for the problems with many samples and support vectors.
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.
