Large Scale Transductive SVMs

13 years 10 months ago

Download jmlr.csail.mit.edu

We show how the concave-convex procedure can be applied to transductive SVMs, which traditionally require 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. Software is available at http://www.kyb.tuebingen.mpg.de/bs/people/fabee/transduction. html.

Ronan Collobert, Fabian H. Sinz, Jason Weston, L&e

Real-time Traffic

Combinatorial Search Problem | Concave-convex Procedure | JMLR 2006 | Scalable Algorithm |

claim paper

» A Parallel Mixture of SVMs for Very Large Scale Problems

» A sequential dual method for large scale multiclass linear svms

» Large scale manifold transduction

» Sparse Kernel SVMs via CuttingPlane Training

» Approximated Structured Prediction for Learning Large Scale Graphical Models

» Training linear SVMs in linear time

» MaximumGain Working Set Selection for SVMs

» Training a Support Vector Machine in the Primal

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2006
Where	JMLR
Authors	Ronan Collobert, Fabian H. Sinz, Jason Weston, Léon Bottou

Comments (0)

Sciweavers

Large Scale Transductive SVMs

Combinatorial Search Problem | Concave-convex Procedure | JMLR 2006 | Scalable Algorithm |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers