Sciweavers

63 search results - page 1 / 13
» MDL-Based Decision Tree Pruning
Sort
View
KDD
1995
ACM
176views Data Mining» more  KDD 1995»
13 years 8 months ago
MDL-Based Decision Tree Pruning
This paper explores the application of the Minimum Description Length principle for pruning decision trees. We present a new algorithm that intuitively captures the primary goal o...
Manish Mehta 0002, Jorma Rissanen, Rakesh Agrawal
SGAI
2010
Springer
13 years 3 months ago
Induction of Modular Classification Rules: Using Jmax-pruning
The Prism family of algorithms induces modular classification rules which, in contrast to decision tree induction algorithms, do not necessarily fit together into a decision tree s...
Frederic T. Stahl, Max Bramer
PPSN
2004
Springer
13 years 10 months ago
Detecting and Pruning Introns for Faster Decision Tree Evolution
We show how the understandability and speed of genetic programming classification algorithms can be improved, without affecting the classification accuracy. By analyzing the dec...
Jeroen Eggermont, Joost N. Kok, Walter A. Kosters
AAAI
2012
11 years 7 months ago
Tree-Based Solution Methods for Multiagent POMDPs with Delayed Communication
Planning under uncertainty is an important and challenging problem in multiagent systems. Multiagent Partially Observable Markov Decision Processes (MPOMDPs) provide a powerful fr...
Frans Adriaan Oliehoek, Matthijs T. J. Spaan
IJAR
2007
87views more  IJAR 2007»
13 years 5 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