Open AccessType II chain graph models for categorical data: A smooth subclass
Author(s) -
Federica Nicolussi,
Roberto Colombi
Publication year - 2017
Publication title -
bernoulli
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.814
H-Index - 72
eISSN - 1573-9759
pISSN - 1350-7265
DOI - 10.3150/15-bej762
Subject(s) - graphical model , categorical variable , mathematics , joint probability distribution , directed acyclic graph , combinatorics , independence (probability theory) , probabilistic logic , graph , partially ordered set , discrete mathematics , statistics
The Probabilistic Graphical Models use graphs in order to represent the joint distribution of q variables. These models are useful for their ability to capture and represent the system of independence relationships among the variables involved, even when complex. This work concerns categorical variables and the possibility to represent symmetric and asymmetric dependences among categorical variables. For this reason we use the Chain Graphical Models proposed by Andersson, S.A. et al. (2001), also known as Chain Graphical Models of type II (GMs II). The GMs II allow for symmetric relationships typical of log-linear models and, at the same time, asymmetric dependences typical of Graphical Models for Directed Acyclic Graphs. In general, GMs II are not smooth, however this work provides a subclass of smooth GMs II by parameterizing the probability function through marginal log-linear models. Furthermore, the proposed model is applied to a data-set from the European Value Study for the year 2008 EVS (2010)