1248 search results - page 102 / 250 » Decision Tree Grafting |
231
Voted
ICIP
2010
IEEE
15 years 2 months ago
2010
IEEE
The Random forest classifier comes to be the working horse for visual recognition community. It predicts the class label of an input data by aggregating the votes of multiple tree...
238
Voted
ICAART
2010
INSTICC
16 years 1 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...
125
click to vote
CIE
2007
Springer
15 years 10 months ago
2007
Springer
Concerning the set of rooted binary trees, one shows that Higman’s Lemma and Dershowitz’s recursive path ordering can be used for the decision of its maximal order type accordi...
110
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
A data structure, called a biased range tree, is presented that preprocesses a set S of n points in R2 and a query distribution D for 2-sided orthogonal range counting queries. The...
154
click to vote
PRL
2008
15 years 4 months ago
2008
Boosting is a set of methods for the construction of classifier ensembles. The differential feature of these methods is that they allow to obtain a strong classifier from the comb...