Sciweavers

1068 search results - page 12 / 214
» Extremely randomized trees
Sort
View
DM
2008
104views more  DM 2008»
13 years 8 months ago
On edge-weighted recursive trees and inversions in random permutations
We introduce random recursive trees, where deterministically weights are attached to the edges according to the labeling of the trees. We will give a bijection between recursive t...
Markus Kuba, Alois Panholzer
IPL
2002
119views more  IPL 2002»
13 years 8 months ago
Randomized splay trees: Theoretical and experimental results
Splay trees are self-organizing binary search trees that were introduced by Sleator and Tarjan [12]. In this paper we present a randomized variant of these trees. The new algorith...
Susanne Albers, Marek Karpinski
PAMI
1998
127views more  PAMI 1998»
13 years 8 months ago
The Random Subspace Method for Constructing Decision Forests
—Much of previous attention on decision trees focuses on the splitting criteria and optimization of tree sizes. The dilemma between overfitting and achieving maximum accuracy is ...
Tin Kam Ho
VLDB
1992
ACM
137views Database» more  VLDB 1992»
14 years 20 days ago
Random Sampling from Pseudo-Ranked B+ Trees
In the past, two basic approaches for sampling f5-om B+ trees have been suggested: sampling from the ranked trees and acceptance/rejection sampling i?om non-ranked trees. The firs...
Gennady Antoshenkov
EJC
2010
13 years 8 months ago
The shape of unlabeled rooted random trees
We consider the number of nodes in the levels of unlabelled rooted random trees and show that the stochastic process given by the properly scaled level sizes weakly converges to th...
Michael Drmota, Bernhard Gittenberger