Sciweavers

70 search results - page 4 / 14
» The Problem of Missing Values in Decision Tree Grafting
Sort
View
ICML
2006
IEEE
16 years 5 months ago
Learning the structure of Factored Markov Decision Processes in reinforcement learning problems
Recent decision-theoric planning algorithms are able to find optimal solutions in large problems, using Factored Markov Decision Processes (fmdps). However, these algorithms need ...
Thomas Degris, Olivier Sigaud, Pierre-Henri Wuille...
IJAR
2007
87views more  IJAR 2007»
15 years 4 months ago
Pruning belief decision tree methods in averaging and conjunctive approaches
The belief decision tree (BDT) approach is a decision tree in an uncertain environment where the uncertainty is represented through the Transferable Belief Model (TBM), one interp...
Salsabil Trabelsi, Zied Elouedi, Khaled Mellouli
SSPR
1998
Springer
15 years 8 months ago
Multi-interval Discretization Methods for Decision Tree Learning
Properly addressing the discretization process of continuos valued features is an important problem during decision tree learning. This paper describes four multi-interval discreti...
Petra Perner, Sascha Trautzsch
PODS
2007
ACM
203views Database» more  PODS 2007»
16 years 4 months ago
Decision trees for entity identification: approximation algorithms and hardness results
We consider the problem of constructing decision trees for entity identification from a given relational table. The input is a table containing information about a set of entities...
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Samb...
KBS
2002
141views more  KBS 2002»
15 years 4 months ago
Using J-pruning to reduce overfitting in classification trees
The automatic induction of classification rules from examples in the form of a decision tree is an important technique used in data mining. One of the problems encountered is the o...
Max Bramer