140 search results - page 8 / 28 » Learning Relational Concepts with Decision Trees |
ICML
2000
IEEE
14 years 8 months ago
2000
IEEE
This paper investigates how the splitting criteria and pruning methods of decision tree learning algorithms are influenced by misclassification costs or changes to the class distr...
AAAI
2006
13 years 9 months ago
2006
Most existing decision tree inducers are very fast due to their greedy approach. In many real-life applications, however, we are willing to allocate more time to get better decisi...
ECML
2007
Springer
14 years 1 months ago
2007
Springer
In this paper we investigate the relation between transfer learning in reinforcement learning with function approximation and supervised learning with concept drift. We present a n...
CIS
2004
Springer
14 years 1 months ago
2004
Springer
Concept drifting in data streams often occurs unpredictably at any time. Currently many classification mining algorithms deal with this problem by using an incremental learning ap...
ECML
1997
Springer
13 years 11 months ago
1997
Springer
We investigate an inherent limitation of top-down decision tree induction in which the continuous partitioning of the instance space progressively lessens the statistical support o...