Sciweavers

3055 search results - page 23 / 611
» Randomized Search Trees
Sort
View
SSDBM
2002
IEEE
122views Database» more  SSDBM 2002»
14 years 1 months ago
ATreeGrep: Approximate Searching in Unordered Trees
An unordered labeled tree is a tree in which each node has a string label and the parent-child relationship is significant, but the order among siblings is unimportant. This pape...
Dennis Shasha, Jason Tsong-Li Wang, Huiyuan Shan, ...
COLT
2003
Springer
14 years 2 months ago
Learning Random Log-Depth Decision Trees under the Uniform Distribution
We consider three natural models of random logarithmic depth decision trees over Boolean variables. We give an efficient algorithm that for each of these models learns all but an ...
Jeffrey C. Jackson, Rocco A. Servedio
DM
2008
104views more  DM 2008»
13 years 9 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
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