Sciweavers

495 search results - page 24 / 99
» Probability Trees
Sort
View
142
Voted
PODS
2007
ACM
203views Database» more  PODS 2007»
16 years 2 months ago
Decision trees for entity identification: approximation algorithms and hardness results
We consider the problem of constructing decision trees for entity identification from a given relational table. The input is a table containing information about a set of entities...
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Samb...
150
Voted
DATAMINE
1999
143views more  DATAMINE 1999»
15 years 1 months ago
Partitioning Nominal Attributes in Decision Trees
To find the optimal branching of a nominal attribute at a node in an L-ary decision tree, one is often forced to search over all possible L-ary partitions for the one that yields t...
Don Coppersmith, Se June Hong, Jonathan R. M. Hosk...
112
Voted
ACTA
2008
88views more  ACTA 2008»
15 years 14 days ago
Weighted height of random trees
We consider a model of random trees similar to the split trees of Devroye [30] in which a set of items is recursively partitioned. Our model allows for more flexibility in the cho...
Nicolas Broutin, Luc Devroye, Erin McLeish
IBPRIA
2003
Springer
15 years 7 months ago
Smoothing Techniques for Tree-k-Grammar-Based Natural Language Modeling
Abstract. In a previous work, a new probabilistic context-free grammar (PCFG) model for natural language parsing derived from a tree bank corpus has been introduced. The model esti...
Jose L. Verdú-Mas, Jorge Calera-Rubio, Rafa...
135
Voted
ENTCS
2008
120views more  ENTCS 2008»
15 years 1 months ago
Reasoning about B+ Trees with Operational Semantics and Separation Logic
The B+ tree is an ordered tree structure with a fringe list. It is the most widely used data structure for data organisation and searching in database systems specifically, and, p...
Alan P. Sexton, Hayo Thielecke