Asymptotic model selection and identifiability of directed tree models with hidden variables

University of Warwick. Centre for Research in Statistical Methodology 2010

Zwiernik, Piotr

The standard Bayesian Information Criterion (BIC) is derived under some regularity conditions which are not always satisfied by the graphical models with hidden variables. In this paper we derive the BIC score for Bayesian networks in the case when the data is binary and the underlying graph is a rooted tree and all the inner nodes represent hidden variables. This provides a direct generalization of a similar formula given by Rusakov and Geiger in [10]. Geometric results obtained in this paper are complementary to the results in the previous paper [18] extending our understanding of this class of models. The main tool used in this paper is the connection between asymptotic approximation of Laplace integrals and the real log-canonical threshold.

QA Mathematics; Working or Discussion Paper; NonPeerReviewed

application/pdf

U3W oai:wrap.warwick.ac.uk:35068
https://wrap.warwick.ac.uk/35068/1/WRAP_Zwiernik_10-06w.pdf
Zwiernik, Piotr (2010) Asymptotic model selection and identifiability of directed tree models with hidden variables. Working Paper. Coventry: University of Warwick. Centre for Research in Statistical Methodology. Working papers, Vol.2010 (No.6).
733943398

UNIV OF WARWICK
From OAIster®, provided by the OCLC Cooperative.

edsoai.ocn733943398