Iterative Conditional Fitting for Discrete Chain Graph Models

Mathias Drton ()
Additional contact information
Mathias Drton: University of Chicago, Department of Statistics

A chapter in COMPSTAT 2008, 2008, pp 93-104 from Springer

Abstract: 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.

Keywords: categorical data; chain graph; conditional independence; graphical model (search for similar items in EconPapers)
Date: 2008
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-7908-2084-3_8

Ordering information: This item can be ordered from
http://www.springer.com/9783790820843

DOI: 10.1007/978-3-7908-2084-3_8

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().