Personal tools
You are here: Home Publications Reducing run-time complexity in SVMs
Document Actions

E. Osuna and F. Girosi (1998)

Reducing run-time complexity in SVMs

In: Proceedings of the 14th International Conf. on Pattern Recognition, Brisbane, Australia.

The authors focus on SVM for classification and investigate the problem of reducing its run-time complexity. Two results are presented: a) the use of SVM itself as a regression tool to approximate the decision surface with a user-specified accuracy; and b) a reformulation of the training problem that yields the exact same decision surface using a smaller number of basis functions.

by admin last modified 2007-01-31 11:07

Powered by Plone CMS, the Open Source Content Management System