Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Leave-one-out error

Known as: Leave one out error 
* Expected-to-leave-one-out error () Stability An algorithm f has stability if for each n there exists a and a such that: , with and going to zero… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
We propose a new leaning method for Multiple Kernel Learning (MKL) based on the upper bounds of the leave-one-out error that is… Expand
  • table 1
Is this relevant?
2009
2009
Error estimation is a problem of high current interest in many areas of application. This paper concerns the classical problem of… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2005
2005
In least squares support vector (LS-SVM), the key challenge lies in the selection of free parameters such as kernel parameters… Expand
  • table 1
  • table 2
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We study the leave-one-out and generalization errors of voting combinations of learning machines. A special case considered is a… Expand
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2002
Highly Cited
2002
1,078,620. Thermal regenerators. H. BRANDT, and A. KRITZLER [trading as APPARATEBAU ROTHEMUHLE BRANDT & KRITZLER]. Sept. 28, 1965… Expand
  • table 1
Is this relevant?
Highly Cited
2002
Highly Cited
2002
We define notions of stability for learning algorithms and show how to use these notions to derive generalization error bounds… Expand
Is this relevant?
2002
2002
In this paper, we compare two well-known estimates of the generalization error : the training error and the leave-one-out error… Expand
Is this relevant?
Highly Cited
2002
Highly Cited
2002
DNA micro-arrays now permit scientists to screen thousands of genes simultaneously and determine whether those genes are active… Expand
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
2000
Highly Cited
2000
We introduce a method of feature selection for Support Vector Machines. The method is based upon finding those features which… Expand
  • figure 1
  • figure 2
Is this relevant?
1999
1999
We present a new learning algorithm for pattern recognition inspired by a recent upper bound on leave-one-out error [Jaakkola and… Expand
Is this relevant?