## The analysis of decomposition methods for support vector machines (1999)

### Cached

### Download Links

Venue: | IEEE Transactions on Neural Networks |

Citations: | 108 - 21 self |

### BibTeX

@ARTICLE{Lin99theanalysis,

author = {Chih-jen Lin and Nello Cristianini},

title = {The analysis of decomposition methods for support vector machines},

journal = {IEEE Transactions on Neural Networks},

year = {1999},

volume = {12},

pages = {291--314}

}

### Years of Citing Articles

### OpenURL

### Abstract

Abstract. The decomposition method is currently one of the major methods for solving support vector machines. An important issue of this method is the selection of working sets. In this paper through the design of decomposition methods for bound-constrained SVM formulations we demonstrate that the working set selection is not a trivial task. Then from the experimental analysis we propose a simple selection of the working set which leads to faster convergences for difficult cases. Numerical experiments on different types of problems are conducted to demonstrate the viability of the proposed method.