64 search results - page 6 / 13 » On the Boosting Ability of Top-Down Decision Tree Learning A... |
ICML
1990
IEEE
14 years 24 days ago
1990
IEEE
Decision trees that are limited to testing a single variable at a node are potentially much larger than trees that allow testing multiple variables at a node. This limitation redu...
NLP
2000
14 years 10 days ago
2000
In this article we compare the performance of various machine learning algorithms on the task of constructing word-sense disambiguation rules from data. The distinguishing characte...
CVPR
2006
IEEE
14 years 10 months ago
2006
IEEE
Edge detection is one of the most studied problems in computer vision, yet it remains a very challenging task. It is difficult since often the decision for an edge cannot be made ...
KDD
2003
ACM
14 years 9 months ago
2003
ACM
In this paper we study the problem of constructing accurate decision tree models from data streams. Data streams are incremental tasks that require incremental, online, and any-ti...
IJCAI
1997
13 years 10 months ago
1997
Windowing has been proposed as a procedure for efficient memory use in the ID3 decision tree learning algorithm. However, it was shown that it may often lead to a decrease in perf...