Back
Large Scale Transductive SVMs
We show how the Concave-Convex Procedure can be applied to the optimization of Transductive SVMs, which traditionally requires solving a combinatorial search problem. This provides for the first time a highly scalable algorithm in the nonlinear case. Detailed experiments verify the utility of our approach.
@article{3765, title = {Large Scale Transductive SVMs}, journal = {Journal of Machine Learning Research}, abstract = {We show how the Concave-Convex Procedure can be applied to the optimization of Transductive SVMs, which traditionally requires solving a combinatorial search problem. This provides for the first time a highly scalable algorithm in the nonlinear case. Detailed experiments verify the utility of our approach.}, volume = {7}, pages = {1687-1712}, organization = {Max-Planck-Gesellschaft}, school = {Biologische Kybernetik}, month = aug, year = {2006}, slug = {3765}, author = {Collobert, R. and Sinz, F. and Weston, J. and Bottou, L.}, month_numeric = {8} }