Sciweavers

187 search results - page 6 / 38
» BOAT-Optimistic Decision Tree Construction
Sort
View
ML
2008
ACM
135views Machine Learning» more  ML 2008»
13 years 7 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
ICML
2004
IEEE
14 years 8 months ago
Lookahead-based algorithms for anytime induction of decision trees
The majority of the existing algorithms for learning decision trees are greedy--a tree is induced top-down, making locally optimal decisions at each node. In most cases, however, ...
Saher Esmeir, Shaul Markovitch
AAAI
2006
13 years 9 months ago
When a Decision Tree Learner Has Plenty of Time
The majority of the existing algorithms for learning decision trees are greedy--a tree is induced top-down, making locally optimal decisions at each node. In most cases, however, ...
Saher Esmeir, Shaul Markovitch
SAC
2004
ACM
14 years 1 months ago
Interval and dynamic time warping-based decision trees
This work presents decision trees adequate for the classification of series data. There are several methods for this task, but most of them focus on accuracy. One of the requirem...
Juan José Rodríguez, Carlos J. Alons...
KIVS
2009
Springer
14 years 2 months ago
Towards the Design of Unexploitable Construction Mechanisms for Multiple-Tree Based P2P Streaming Systems
Abstract. In peer-to-peer based live streaming systems, a great number of participants have to cooperate to efficiently and reliably distribute a continuous flow of data. Each rec...
Michael Brinkmeier, Mathias Fischer, Sascha Grau, ...