Consistent model selection of discrete Bayesian networks from incomplete data

From MaRDI portal
Publication:1951147

DOI10.1214/13-EJS802zbMATH Open1336.62087arXiv1105.4507MaRDI QIDQ1951147FDOQ1951147


Authors: Nikolay Balov Edit this on Wikidata


Publication date: 29 May 2013

Published in: Electronic Journal of Statistics (Search for Journal in Brave)

Abstract: A maximum likelihood based model selection of discrete Bayesian networks is considered. The model selection is performed through scoring function S, which, for a given network G and n-sample Dn, is defined to be the maximum log-likelihood l minus a penalization term lambdanh proportional to network complexity h(G), S(G|D_n) = l(G|D_n) - lambda_n h(G). The data is allowed to have missing values at random that has prompted, to improve the efficiency of estimation, a replacement of the standard log-likelihood with the sum of sample average node log-likelihoods. The latter avoids the exclusion of most partially missing data records and allows the comparison of models fitted to different samples. Provided that a discrete Bayesian network is identifiable for a given missing data distribution, we show that if the sequence lambdan converges to zero at a slower rate than n1/2 then the estimation is consistent. Moreover, we establish that BIC model selection (lambdan=0.5log(n)/n) applied to the node-average log-likelihood is in general not consistent. This is in contrast to the complete data case where BIC is known to be consistent. The conclusions are confirmed by numerical examples.


Full work available at URL: https://arxiv.org/abs/1105.4507




Recommendations




Cites Work


Cited In (8)

Uses Software





This page was built for publication: Consistent model selection of discrete Bayesian networks from incomplete data

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1951147)