6715 search results - page 753 / 1343 » Learning from a Test Set |
186
click to vote
ICML
2000
IEEE
16 years 8 months ago
2000
IEEE
We develop an intuitive geometric interpretation of the standard support vector machine (SVM) for classification of both linearly separable and inseparable data and provide a rigo...
210
click to vote
ICML
1998
IEEE
16 years 8 months ago
1998
IEEE
In this work, we present a new bottom-up algorithmfor decision tree pruning that is very e cient requiring only a single pass through the given tree, and prove a strong performanc...
193
click to vote
MICAI
2007
Springer
16 years 1 months ago
2007
Springer
A problem of supervised approaches for text classification is that they commonly require high-quality training data to construct an accurate classifier. Unfortunately, in many real...
224
click to vote
JMLR
2006
15 years 7 months ago
2006
This paper is about non-approximate acceleration of high-dimensional nonparametric operations such as k nearest neighbor classifiers. We attempt to exploit the fact that even if w...
213
click to vote
CIKM
2010
Springer
15 years 5 months ago
2010
Springer
The major challenge in mining data streams is the issue of concept drift, the tendency of the underlying data generation process to change over time. In this paper, we propose a g...