Searching for authors named "Dan Geiger" – sorted by Relevance.
-
A Characterization of the Dirichlet Distribution with Application to Learning Bayesian Networks
- this technical claim is that in order to find all positive integrable functions that satisfy Eq. 9, it is permissible to take any derivative at any point in the domain because it exists. By setting z ij = 1=k, for all i and j, in Equation 9 we get that f 0 (y 1 ; : : : ; y n\Gamma1 ) is proportional
- Cited by 16 (1 self) – Add To MetaCart
-
Graphical Models and Exponential Families
- Graphical Models and Exponential Families Dan Geiger Microsoft Research Redmond, WA 98052 dgeiger
- Cited by 14 (1 self) – Add To MetaCart
-
Asymptotic Model Selection for Naive Bayesian Networks
- Asymptotic Model Selection for Naive Bayesian Networks Dmitry Rusakov and Dan Geiger Computer
- Cited by 12 (1 self) – Add To MetaCart
-
Likelihoods and Parameter Priors for Bayesian Networks
- Likelihoods and Parameter Priors for Bayesian Networks David Heckerman heckerma@(email omitted); Dan
- Cited by 17 (0 self) – Add To MetaCart
-
On Parameter Priors for Discrete DAG Models
- On Parameter Priors for Discrete DAG Models Dmitry Rusakov and Dan Geiger frusakov
- Cited by 3 (0 self) – Add To MetaCart
-
A Characterization of the Bivariate Normal-Wishart Distribution
- A Characterization of the Bivariate Normal-Wishart Distribution Dan Geiger dang
- Cited by 1 (1 self) – Add To MetaCart
-
Optimization of Pearl's Method of Conditioning and Greedy-Like Approximation Algorithms for the Vertex Feedback Set Problem
- for the Vertex Feedback Set Problem Ann Becker and Dan Geiger Computer Science Department Technion Haifa 32000
- Cited by 16 (3 self) – Add To MetaCart
-
Parameter Priors for Directed Acyclic Graphical Models and the Characterization of Several Probability Distributions
- Probability Distributions Dan Geiger and David Heckerman Microsoft Research, Bldg 31 Redmond 98052-6399, WA
- Cited by 18 (1 self) – Add To MetaCart
-
Maximum likelihood haplotyping for general pedigrees. Human Heredity
- Haplotyping for General Pedigrees Ma’ayan Fishelson, Nickolay Dovgolevsky, and Dan Geiger Computer Science
- Cited by 14 (1 self) – Add To MetaCart
-
A Sufficiently Fast Algorithm for Finding Close to Optimal Junction Trees
- A sufficiently fast algorithm for finding close to optimal junction trees Ann Becker and Dan
- Cited by 63 (1 self) – Add To MetaCart

