Search Results for author:
Found 6 papers, 0 papers with code
Selective Greedy Equivalence Search: Finding Optimal Bayesian Networks Using a Polynomial Number of Score Evaluations
We introduce Selective Greedy Equivalence Search (SGES), a restricted version of Greedy Equivalence Search (GES).
Learning Bayesian Networks: The Combination of Knowledge and Statistical Data
Second, we describe local search and annealing algorithms to be used in conjunction with scoring metrics.
Efficient Approximations for the Marginal Likelihood of Incomplete Data Given a Bayesian Network
We consider the Laplace approximation and the less accurate but more efficient BIC/MDL approximation.
A Bayesian Approach to Learning Bayesian Networks with Local Structure
The majority of this work has concentrated on using decision-tree representations for the CPDs.
Learning Mixtures of DAG Models
We describe computationally efficient methods for learning mixtures in which each component is a directed acyclic graphical model (mixtures of DAGs or MDAGs).
Fast Learning from Sparse Data
We describe two techniques that significantly improve the running time of several standard machine-learning algorithms when data is sparse.
