pith. sign in

arxiv: 1202.3765 · v1 · pith:ZVBYRMT3new · submitted 2012-02-14 · 📊 stat.ME · cs.LG· stat.ML

Learning mixed graphical models from data with p larger than n

classification 📊 stat.ME cs.LGstat.ML
keywords learninggraphicalmodelsdatalargermixedproblemsetting
0
0 comments X
read the original abstract

Structure learning of Gaussian graphical models is an extensively studied problem in the classical multivariate setting where the sample size n is larger than the number of random variables p, as well as in the more challenging setting when p>>n. However, analogous approaches for learning the structure of graphical models with mixed discrete and continuous variables when p>>n remain largely unexplored. Here we describe a statistical learning procedure for this problem based on limited-order correlations and assess its performance with synthetic and real data.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.