Effective Dimensions of Hierarchical Latent Class Models

Computer Science – Artificial Intelligence

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

10.1613/jair.1311

Hierarchical latent class (HLC) models are tree-structured Bayesian networks where leaf nodes are observed while internal nodes are latent. There are no theoretically well justified model selection criteria for HLC models in particular and Bayesian networks with latent nodes in general. Nonetheless, empirical studies suggest that the BIC score is a reasonable criterion to use in practice for learning HLC models. Empirical studies also suggest that sometimes model selection can be improved if standard model dimension is replaced with effective model dimension in the penalty term of the BIC score. Effective dimensions are difficult to compute. In this paper, we prove a theorem that relates the effective dimension of an HLC model to the effective dimensions of a number of latent class models. The theorem makes it computationally feasible to compute the effective dimensions of large HLC models. The theorem can also be used to compute the effective dimensions of general tree models.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Effective Dimensions of Hierarchical Latent Class Models does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Effective Dimensions of Hierarchical Latent Class Models, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Effective Dimensions of Hierarchical Latent Class Models will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-479947

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.