254 search results - page 5 / 51 » Multi-interval Discretization Methods for Decision Tree Lear... |
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...
ICML
1996
IEEE
14 years 8 months ago
1996
IEEE
In this paper, we describe two di erent learning tasks for relational structures. When learning a classi er for structures, the relational structures in the training sets are clas...
ICDM
2010
IEEE
13 years 5 months ago
2010
IEEE
Traditional Markov network structure learning algorithms perform a search for globally useful features. However, these algorithms are often slow and prone to finding local optima d...
CP
2009
Springer
14 years 8 months ago
2009
Springer
Decision tree induction techniques attempt to find small trees that fit a training set of data. This preference for smaller trees, which provides a learning bias, is often justifie...
ICAART
2010
INSTICC
14 years 4 months ago
2010
INSTICC
There has been a lot of recent work on Bayesian methods for reinforcement learning exhibiting near-optimal online performance. The main obstacle facing such methods is that in most...