Skip to main content
Article thumbnail
Location of Repository

Computing posterior probabilities of structural features in Bayesian networks

By Jin Tian and Ru He

Abstract

We study the problem of learning Bayesian network structures from data. Koivisto and Sood (2004) and Koivisto (2006) presented algorithms that can compute the exact marginal posterior probability of a subnetwork, e.g., a single edge, in O(n2 n) time and the posterior probabilities for all n(nāˆ’1) potential edges in O(n2 n) total time, assuming that the number of parents per node or the indegree is bounded by a constant. One main drawback of their algorithms is the requirement of a special structure prior that is non uniform and does not respect Markov equivalence. In this paper, we develop an algorithm that can compute the exact posterior probability of a subnetwork in O(3 n) time and the posterior probabilities for all n(n āˆ’ 1) potential edges in O(n3 n) total time. Our algorithm also assumes a bounded indegree but allows general structure priors. We demonstrate the applicability of the algorithm on several data sets with up to 20 variables.

Year: 2009
OAI identifier: oai:CiteSeerX.psu:10.1.1.297.9401
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cs.mcgill.ca/~uai20... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.