Effective dimensions of partially observed polytrees

Model complexity is an important factor to consider when selecting among Bayesian network models. When all variables are observed, the complexity of a model can be measured by its standard dimension, i.e., the number of linearly independent network parameters. When latent variables are present, however, standard dimension is no longer appropriate and effective dimension should be used instead [Proc. 12th Conf. Uncertainty Artificial Intell. (1996) 283]. Effective dimensions of Bayesian networks are difficult to compute in general. Work has begun to develop efficient methods for calculating the effective dimensions of special networks. One such method has been developed for partially observed trees [J. Artificial Intell. Res. 21 (2004) 1]. In this paper, we develop a similar method for partially observed polytrees.

[1]  Michael I. Jordan.  Graphical Models , 2003 .

[2]  Jim Q. Smith,et al.  Geometry, moments and Bayesian networks with hidden variables , 1999, AISTATS.

[3]  D. Geiger,et al.  Stratified exponential families: Graphical models and model selection , 2001 .

[4]  H. Akaike.  A new look at the statistical model identification , 1974 .

[5]  David Heckerman,et al.  Asymptotic Model Selection for Directed Networks with Hidden Variables , 1996, UAI.

[6]  G. Schwarz.  Estimating the Dimension of a Model , 1978 .

[7]  Nevin Lianwen Zhang,et al.  Hierarchical latent class models for cluster analysis , 2002, J. Mach. Learn. Res..

[8]  Tomas Kocka,et al.  Dimension Correction for Hierarchical Latent Class Models , 2002, UAI.

[9]  Dan Geiger,et al.  Automated Analytic Asymptotic Evaluation of the Marginal Likelihood for Latent Models , 2002, UAI.

[10]  Peter C. Cheeseman,et al.  Bayesian Classification (AutoClass): Theory and Results , 1996, Advances in Knowledge Discovery and Data Mining.

[11]  Weixiong Zhang,et al.  Configuration landscape analysis and backbone guided local search: Part I: Satisfiability and maximum satisfiability , 2004, Artif. Intell..

[12]  Jim Q. Smith,et al.  On the Geometry of Bayesian Graphical Models with Hidden Variables , 1998, UAI.

[13]  D. Haughton.  On the Choice of a Model to Fit Data from an Exponential Family , 1988 .

[14]  Dan Geiger,et al.  Asymptotic Model Selection for Naive Bayesian Networks , 2002, J. Mach. Learn. Res..

[15]  Tomas Kocka,et al.  Effective Dimensions of Hierarchical Latent Class Models , 2011, J. Artif. Intell. Res..

[16]  Byron J. T. Morgan,et al.  Deficiency of parameter‐redundant models , 2001 .

[17]  Gregory F. Cooper,et al.  A Bayesian method for the induction of probabilistic networks from data , 1992, Machine Learning.