25 search results - page 2 / 5 » When a Decision Tree Learner Has Plenty of Time |
ICTAI
2002
IEEE
13 years 10 months ago
2002
IEEE
There are many machine learning algorithms currently available. In the 21st century, the problem no longer lies in writing the learner, but in choosing which learners to run on a ...
ATAL
2008
Springer
13 years 7 months ago
2008
Springer
Future agent applications will increasingly represent human users autonomously or semi-autonomously in strategic interactions with similar entities. Hence, there is a growing need...
PRICAI
2000
Springer
13 years 8 months ago
2000
Springer
While the decision tree is an effective representation that has been used in many domains, a tree can often encode a concept inefficiently. This happens when the tree has to repres...
SAC
2005
ACM
13 years 11 months ago
2005
ACM
: This paper presents a system for induction of forest of functional trees from data streams able to detect concept drift. The Ultra Fast Forest of Trees (UFFT) is an incremental a...
ADMA
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. Most of the work in Machine Learning assume that examples are generated at random according to some stationary probability distribution. In this work we study the problem...