English

Penalized EM algorithm and copula skeptic graphical models for inferring networks for mixed variables

Methodology 2014-01-22 v1

Abstract

In this article, we consider the problem of reconstructing networks for continuous, binary, count and discrete ordinal variables by estimating sparse precision matrix in Gaussian copula graphical models. We propose two approaches: 1\ell_1 penalized extended rank likelihood with Monte Carlo Expectation-Maximization algorithm (copula EM glasso) and copula skeptic with pair-wise copula estimation for copula Gaussian graphical models. The proposed approaches help to infer networks arising from nonnormal and mixed variables. We demonstrate the performance of our methods through simulation studies and analysis of breast cancer genomic and clinical data and maize genetics data.

Keywords

Cite

@article{arxiv.1401.5264,
  title  = {Penalized EM algorithm and copula skeptic graphical models for inferring networks for mixed variables},
  author = {Fentaw Abegaz and Ernst Wit},
  journal= {arXiv preprint arXiv:1401.5264},
  year   = {2014}
}
R2 v1 2026-06-22T02:50:59.550Z