Sciweavers

565 search results - page 2 / 113
» A Generalized Quadratic Loss for Support Vector Machines
Sort
View
TIT
2002
164views more  TIT 2002»
13 years 4 months ago
On the generalization of soft margin algorithms
Generalization bounds depending on the margin of a classifier are a relatively recent development. They provide an explanation of the performance of state-of-the-art learning syste...
John Shawe-Taylor, Nello Cristianini
CVPR
2008
IEEE
14 years 7 months ago
Classification using intersection kernel support vector machines is efficient
Straightforward classification using kernelized SVMs requires evaluating the kernel for a test vector and each of the support vectors. For a class of kernels we show that one can ...
Subhransu Maji, Alexander C. Berg, Jitendra Malik
PKDD
2010
Springer
152views Data Mining» more  PKDD 2010»
13 years 3 months ago
Online Knowledge-Based Support Vector Machines
Prior knowledge, in the form of simple advice rules, can greatly speed up convergence in learning algorithms. Online learning methods predict the label of the current point and the...
Gautam Kunapuli, Kristin P. Bennett, Amina Shabbee...
NIPS
2003
13 years 6 months ago
Margin Maximizing Loss Functions
Margin maximizing properties play an important role in the analysis of classi£cation models, such as boosting and support vector machines. Margin maximization is theoretically in...
Saharon Rosset, Ji Zhu, Trevor Hastie
ICNC
2005
Springer
13 years 10 months ago
Training Data Selection for Support Vector Machines
Abstract. In recent years, support vector machines (SVMs) have become a popular tool for pattern recognition and machine learning. Training a SVM involves solving a constrained qua...
Jigang Wang, Predrag Neskovic, Leon N. Cooper