Parameterization and fitting of a class of discrete graphical models

4Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Graphical Markov models are multivariate statistical models in which the joint distribution satisfies independence statements that are captured by a graph. We consider models for discrete variables, that are analogous to multivariate regressions in the linear case, when the variables can be arranged in sequences of joint response, intermediate and purely explanatory variables. In the case of one single group of variables, these models specify marginal independencies of pairs of variables. We show that the models admit a proper marginal log-linear parameterization that can accommodate all the marginal and conditional independence constraints involved, and can be fitted, using maximum likelihood under a multinomial assumption, by a general iterative gradient-based algorithm. We discuss a technique for determining fast approximate estimates, that can also be used for initializing the general algorithm and we present an illustration based on data from the U.S. General Social Survey.

Cite

CITATION STYLE

APA

Marchetti, G. M., & Lupparelli, M. (2008). Parameterization and fitting of a class of discrete graphical models. In COMPSTAT 2008 - Proceedings in Computational Statistics, 18th Symposium (pp. 117–128). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-7908-2084-3_10

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free