Skip to main content
Log in

Selecting dynamic graphical models with hidden variables from data

  • Published:
Computational Statistics Aims and scope Submit manuscript

Summary

Selecting graphical models for a set of variables from data consists of finding the graphical structure and its associated probability distribution which best fit the data. In this paper we propose a new method for selecting Markovian dynamic graphical models from data and, in particular, we develop a new Bayesian technique for selecting graphical hidden Markov models, depicted by a chain graph, from an incomplete data set where values corresponding to hidden or latent variables are not present in data. The proposed method is illustrated by a case study.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Figure 1
Figure 2
Figure 3
Figure 4
Figure 5
Figure 6
Figure 7

Similar content being viewed by others

References

  • Castillo, E.; Gutiérrez, J.M. & Hadi, A.S. (1997), Expert systems and probabilistic network models. Springer.

  • Dawid, A.P. & Lauritzen, S.L. (1993), ‘Hyper Markov laws in the statistical analysis of decomposable models’, The Annals of Statistics, 21(3), 1272–1317.

    Article  MathSciNet  Google Scholar 

  • Geiger, D. & Heckerman, D. (1994), ‘Learning Gaussian networks’, in ‘Proceedings of the 10th Conference on Uncertainty in Artificial Intelligence (UAI-94)’, Standford University, 29–31th July, 235–243.

  • Heckerman, D. (1995), A tutorial on learning with Bayesian networks. Technical Report MSR-TR-95-06. ftp://ftp.research.microsoft.com/pub/techreports/winter94-95/tr-95-06.ps.

  • Heckerman, D. & Geiger, D. (1995), ‘Learning Bayesian networks: A unification for discrete and Gaussian domains’, in ‘Proceedings of the 11th Conference on Uncertainty in Artificial Intelligence (UAI-95)’, MCGill University, Montreal, Quebec, Canada, 18–20th August, 274–284.

    Google Scholar 

  • Heckerman, D.; Geiger, D. & Chickering, D.M. (1995), ‘Learning Bayesian networks: the combination of knowledge and statistical data’, Machine Learning 20, 197–243.

    MATH  Google Scholar 

  • Kong, A.; Liu, J.S. & Wong, W.H. (1994), ‘Sequential imputations and Bayesian missing data problems’, Journal of the American Statistical Association 89(425), Theory and Methods, 278–288.

    Article  Google Scholar 

  • Lacruz, B. (1998), Procedimientos secuenciales de modelización gráfica, inferencia y aprendizaje de un sistema dinámico parcialmente observado. PhD Thesis, University of Zaragoza, Spain.

    Google Scholar 

  • Lacruz, B.; Lasala, P. & Lekuona, A. (2000), ‘Dynamic graphical models and nonhomogeneous hidden Markov models’, Statistics and Probability Letters (in press).

  • Lauritzen, S.L. (1996), Graphical models. Clarendon Press, Oxford.

    MATH  Google Scholar 

  • Spiegelhalter, D. J. & Lauritzen, S. L. (1990), ‘Sequential updating of conditional probabilities on directed graphical structures’, Networks, 20, 579–605.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Lacruz, B., Lasala, P. & Lekuona, A. Selecting dynamic graphical models with hidden variables from data. Computational Statistics 16, 173–194 (2001). https://doi.org/10.1007/s001800100058

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s001800100058

Keywords

Navigation