283 search results - page 15 / 57 » Bounds on the Generalization Performance of Kernel Machine E... |
ICML
2008
IEEE
14 years 8 months ago
2008
IEEE
In this paper, we consider a smoothing kernelbased classification rule and propose an algorithm for optimizing the performance of the rule by learning the bandwidth of the smoothi...
BMCBI
2010
13 years 7 months ago
2010
Background: Generally speaking, different classifiers tend to work well for certain types of data and conversely, it is usually not known a priori which algorithm will be optimal ...
NIPS
2007
13 years 8 months ago
2007
The notion of algorithmic stability has been used effectively in the past to derive tight generalization bounds. A key advantage of these bounds is that they are designed for spec...
AIRS
2008
Springer
14 years 1 months ago
2008
Springer
Spam filtering is defined as a task trying to label emails with spam or ham in an online situation. The online feature requires the spam filter has a strong timely generalization a...
MLDM
2001
Springer
13 years 11 months ago
2001
Springer
Abstract. This paper proposes a general local learning framework to effectively alleviate the complexities of classifier design by means of “divide and conquer” principle and ...