Skip to main content

Iterative Conditional Fitting for Discrete Chain Graph Models

  • Conference paper
COMPSTAT 2008

Abstract

‘Iterative conditional fitting’ is a recently proposed algorithm that can be used for maximization of the likelihood function in marginal independence models for categorical data. This paper describes a modification of this algorithm, which allows one to compute maximum likelihood estimates in a class of chain graph models for categorical data. The considered discrete chain graph models are defined using conditional independence relations arising in recursive multivariate regressions with correlated errors. This Markov interpretation of the chain graph is consistent with treating the graph as a path diagram and differs from other interpretations known as the LWF and AMP Markov properties.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • ALI, R.A., RICHARDSON, T.S., SPIRTES, P. and ZHANG, J. (2005): Towards characterizing Markov equivalence classes for directed acyclic graphs with latent variables. In: F. Bacchus, T. Jaakkola (Eds.): Proc. 21st Conference on Uncertainty in Artificial Intelligence. AUAI Press, Corvallis, Oregon, 10-17.

    Google Scholar 

  • ANDERSSON, S.A., MADIGAN, D. and PERLMAN, M.D. (2001): Alternative Markov properties for chain graphs. Scand. J. Statist. 28, 33-85.

    Article  MATH  MathSciNet  Google Scholar 

  • CHAUDHURI, S., DRTON, M. and RICHARDSON, T.S. (2007): Estimation of a covariance matrix with zeros. Biometrika 94, 199-216.

    Article  MATH  MathSciNet  Google Scholar 

  • DRTON, M. (2008): Discrete chain graph models. Manuscript.

    Google Scholar 

  • DRTON, M. and RICHARDSON, T.S. (2008a): Binary models for marginal independence. J. R. Stat. Soc. Ser. B. 70, 287-309. (Software and data available at http://www.blackwellpublishing.com/rss/Volumes/Bv70p2.htm)

    Article  Google Scholar 

  • DRTON, M. and RICHARDSON, T.S. (2008b): Graphical methods for efficient likelihood inference in Gaussian covariance models. Preprint available at arXiv:0708.1321.

  • KOSTER, J.T.A. (1999): On the validity of the Markov interpretation of path di- agrams of Gaussian structural equation systems with correlated errors. Scand. J. Statist. 26, 413-431.

    Article  MATH  MathSciNet  Google Scholar 

  • LAURITZEN, S.L. (1996): Graphical Models. Oxford University Press, Oxford, 1996.

    Google Scholar 

  • LUPPARELLI, M., MARCHETTI, G.M. and BERGSMA, W.P. (2008): Parameterizations and fitting of bi-directed graph models to categorical data. Preprint available at arXiv:0801.1440.

  • RICHARDSON, T.S. and SPIRTES, P. (2002): Ancestral graph Markov models. Ann. Statist. 30, 962-1030.

    Article  MATH  MathSciNet  Google Scholar 

  • WERMUTH, N. and COX, D.R. (2004): Joint response graphs and separation induced by triangular systems. J. R. Stat. Soc. Ser. B 66, 687-717.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Mathias Drton .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Physica-Verlag Heidelberg

About this paper

Cite this paper

Drton, M. (2008). Iterative Conditional Fitting for Discrete Chain Graph Models. In: Brito, P. (eds) COMPSTAT 2008. Physica-Verlag HD. https://doi.org/10.1007/978-3-7908-2084-3_8

Download citation

Publish with us

Policies and ethics