Sciweavers

160 search results - page 4 / 32
» Efficient Kernel-based Learning for Trees
Sort
View
IJAIT
2000
50views more  IJAIT 2000»
14 years 9 months ago
Stable Decision Trees: Using Local Anarchy for Efficient Incremental Learning
Dimitrios Kalles, Athanassios Papagelis
JMLR
2002
102views more  JMLR 2002»
14 years 9 months ago
Efficient Algorithms for Decision Tree Cross-validation
Cross-validation is a useful and generally applicable technique often employed in machine learning, including decision tree induction. An important disadvantage of straightforward...
Hendrik Blockeel, Jan Struyf
IJCAI
1997
14 years 10 months ago
Noise-Tolerant Windowing
Windowing has been proposed as a procedure for efficient memory use in the ID3 decision tree learning algorithm. However, it was shown that it may often lead to a decrease in perf...
Johannes Fürnkranz
ML
2008
ACM
135views Machine Learning» more  ML 2008»
14 years 9 months ago
Compiling pattern matching to good decision trees
We address the issue of compiling ML pattern matching to compact and efficient decisions trees. Traditionally, compilation to decision trees is optimized by (1) implementing decis...
Luc Maranget