Structural learning for Bayesian networks by testing complete separators in prime blocks
Abstract
In this paper, we consider how to recover the structure of a Bayesian network from a moral graph. We present a more accurate characterization of moral edges, based on which a complete subset (i.e., a separator) contained in the neighbor set of one vertex of the putative moral edge in some prime block of the moral graph can be chosen. This results in a set of separators needing to be searched generally smaller than the sets required by some existing algorithms. A so-called structure-finder algorithm is proposed for structural learning. The complexity analysis of the proposed algorithm is discussed and compared with those for several existing algorithms. We also demonstrate how to construct the moral graph locally from, separately, the Markov blanket, domain knowledge and d-separation trees. Simulation studies are used to evaluate the performances of various strategies for structural learning. We also analyze a gene expression data set by using the structure-finder algorithm.Download Info
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Bibliographic Info
Article provided by Elsevier in its journal Computational Statistics & Data Analysis.
Volume (Year): 55 (2011)
Issue (Month): 12 (December)
Pages: 3135-3147
Contact details of provider:
Web page: http://www.elsevier.com/locate/csda
Related research
Keywords: Bayesian network Complete separator Conditional independence Moral edge Prime block Structural learning;References
References listed on IDEASPlease report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Abramson, Bruce & Brown, John & Edwards, Ward & Murphy, Allan & Winkler, Robert L., 1996. "Hailfinder: A Bayesian system for forecasting severe weather," International Journal of Forecasting, Elsevier, vol. 12(1), pages 57-71, March.
- Geng, Zhi & Wang, Chi & Zhao, Qiang, 2005. "Decomposition of search for v-structures in DAGs," Journal of Multivariate Analysis, Elsevier, vol. 96(2), pages 282-294, October.
Citations
Lists
This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.Statistics
Access and download statisticsCorrections
When requesting a correction, please mention this item's handle: RePEc:eee:csdana:v:55:y:2011:i:12:p:3135-3147For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Wendy Shamier).
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.