Sciweavers

1640 search results - page 11 / 328
» Conditional Independence Trees
Sort
View
ALGORITHMICA
2005
93views more  ALGORITHMICA 2005»
13 years 9 months ago
Universal Asymptotics for Random Tries and PATRICIA Trees
Abstract. We consider random tries and random patricia trees constructed from n independent strings of symbols drawn from any distribution on any discrete space. We show that many ...
Luc Devroye
CORR
2011
Springer
155views Education» more  CORR 2011»
13 years 4 months ago
Subexponential convergence for information aggregation on regular trees
— We consider the decentralized binary hypothesis testing problem on trees of bounded degree and increasing depth. For a regular tree of depth t and branching factor k ≥ 2, we ...
Yashodhan Kanoria, Andrea Montanari
ICDM
2003
IEEE
158views Data Mining» more  ICDM 2003»
14 years 3 months ago
Identifying Markov Blankets with Decision Tree Induction
The Markov Blanket of a target variable is the minimum conditioning set of variables that makes the target independent of all other variables. Markov Blankets inform feature selec...
Lewis Frey, Douglas H. Fisher, Ioannis Tsamardinos...
ICML
2007
IEEE
14 years 10 months ago
Hierarchical Gaussian process latent variable models
The Gaussian process latent variable model (GP-LVM) is a powerful approach for probabilistic modelling of high dimensional data through dimensional reduction. In this paper we ext...
Neil D. Lawrence, Andrew J. Moore
AMTA
1998
Springer
14 years 2 months ago
Making Semantic Interpretation Parser-Independent
Abstract. We present an approach to semantic interpretation of syntactically parsed Japanese sentences that works largely parser-independent. The approach relies on a standardized ...
Ulrich Germann