140 search results - page 2 / 28 » From the Nearest Neighbour Rule to Decision Trees |
IDA
2005
Springer
13 years 10 months ago
2005
Springer
Inducing a classification function from a set of examples in the form of labeled instances is a standard problem in supervised machine learning. In this paper, we are concerned w...
AAAI
1994
13 years 6 months ago
1994
We apply decision tree induction to the problem of discourse clue word sense disambiguation. The automatic partitioning of the training set which is intrinsic to decision tree ind...
ICPR
2000
IEEE
13 years 9 months ago
2000
IEEE
It is well known that editing techniques can be applied to (large) sets of prototypes in order to bring the error rate of the Nearest Neighbour classifier close to the optimal Ba...
KDD
1998
ACM
13 years 9 months ago
1998
ACM
This paper develops the concept of usefulness in the context of supervised learning. We argue that usefulness can be used to improve the performance of classification rules (as me...
ACL
1996
13 years 6 months ago
1996
We report on a method for compiling decision trees into weighted finite-state transducers. The key assumptions are that the tree predictions specify how to rewrite symbols from an...