Journal
IEEE TRANSACTIONS ON NEURAL NETWORKS
Volume 12, Issue 6, Pages 1288-1298Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/72.963765
Keywords
classification; decomposition methods; support vector machines (SVMs)
Ask authors/readers for more resources
The decomposition method is currently one of the major methods for solving support vector machines (SVMs). Its convergence properties have not been fully understood. The general asymptotic convergence was first proposed by Chang et al. However, their working set selection does not coincide with existing implementation. A later breakthrough by Keerthi and Gilbert proved the convergence finite termination for practical cases while the size of the working set is restricted to two. In this paper, we prove the asymptotic convergence of the algorithm used by the software SVMlight and other later implementation. The size of the working set can be any even number. Extensions to other SVM formulations are also discussed.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available