Learning Gaussian NetworksDan Geiger, David HeckermanAbstract:
We describe algorithms for learning Bayesian networks from a combination of user knowledge and statistical data. The algorithms have two components: a scoring metric and a search procedure. The scoring metric takes a network structure, statistical data, and a user's prior knowledge, and returns a score proportional to the posterior probability of the network structure given the data. The search procedure generates networks for evaluation by the scoring metric. Previous work has concentrated on metrics for domains containing only discrete variables, under the assumption that data represents a multinomial sample. In this paper, we extend this work, developing scoring metrics for domains containing all continuous variables or a mixture of discrete and continuous variables, under the assumption that continuous data is sampled from a multivariate normal distribution. Our work extends traditional statistical approaches for identifying vanishing regression coefficients in that we identify two important assumptions, called event equivalence and parameter modularity, that when combined allow the construction of prior distributions for multivariate normal parameters from a single prior Bayesian network specified by a user.
Keywords: Gaussian networks, Belief networks, causal networks, network construction, learning,
Pages: 235-243
PS Link:ftp://research.microsoft.com/pub/Tech-Reports/Spring94/TR-94-10.PS.ZPDF Link:/papers/94/p235-geiger.pdfBibTex:
@INPROCEEDINGS{Geiger94,
AUTHOR = "Dan Geiger
and David Heckerman",
TITLE = "Learning Gaussian Networks",
BOOKTITLE = "Proceedings of the Tenth Conference Annual Conference on Uncertainty in Artificial Intelligence (UAI-94)",
PUBLISHER = "Morgan Kaufmann",
ADDRESS = "San Francisco, CA",
YEAR = "1994",
PAGES = "235--243"
}