On the Generalisation 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 systems such as support vector machines (SVMs) [1] and Adaboost [2]. The difficulty with these bounds has been either their l...
Main Authors: | Shawe-Taylor, J. (Author), Cristianini, N. (Author) |
---|---|
Format: | Article |
Language: | English |
Published: |
2002-10.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
On the Eigenspectrum of the Gram matrix and the generalisation error of kernel PCA
by: Shawe-Taylor, John, et al.
Published: (2004) -
Enlarging the Margins in Perceptron Decision Trees
by: Wu, D., et al.
Published: (2000) -
Valid generalisation from approximate interpolation
by: Anthony, M., et al.
Published: (1996) -
Latent Semantic Kernels
by: Cristianini, N., et al.
Published: (2002) -
On Generalised Interval-Valued Fuzzy Soft Sets
by: Xiaoqiang Zhou, et al.
Published: (2012-01-01)