Penalized composite likelihood for colored graphical Gaussian models

نویسندگان

چکیده

This article proposes a penalized composite likelihood method for model selection in colored graphical Gaussian models. The provides sparse and symmetry-constrained estimator of the precision matrix thus conducts estimation simultaneously. In particular, uses penalty terms to constrain elements matrix, which enables us transform problem into constrained optimization problem. Further, computer experiments are conducted illustrate performance proposed new methodology. It is shown that performs well both nonzero identification symmetry structures feasibility potential clinical application demonstrated on microarray gene expression dataset.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Penalized Maximum Likelihood Estimation of Multi-layered Gaussian Graphical Models

Analyzing multi-layered graphical models provides insight into understanding the conditional relationships among nodes within layers after adjusting for and quantifying the effects of nodes from other layers. We obtain the penalized maximum likelihood estimator for Gaussian multi-layered graphical models, based on a computational approach involving screening of variables, iterative estimation o...

متن کامل

Penalized maximum likelihood for multivariate Gaussian mixture

In this paper, we first consider the parameter estimation of a multivariate random process distribution using multivariate Gaussian mixture law. The labels of the mixture are allowed to have a general probability law which gives the possibility to modelize a temporal structure of the process under study. We generalize the case of univariate Gaussian mixture in [1] to show that the likelihood is...

متن کامل

Graphical Methods for Efficient Likelihood Inference in Gaussian Covariance Models

In graphical modelling, a bi-directed graph encodes marginal independences among random variables that are identified with the vertices of the graph. We show how to transform a bi-directed graph into a maximal ancestral graph that (i) represents the same independence structure as the original bi-directed graph, and (ii) minimizes the number of arrowheads among all ancestral graphs satisfying (i...

متن کامل

Learning Gaussian Graphical Models With Fractional Marginal Pseudo-likelihood

We propose a Bayesian approximate inference method for learning the dependence structure of a Gaussian graphical model. Using pseudo-likelihood, we derive an analytical expression to approximate the marginal likelihood for an arbitrary graph structure without invoking any assumptions about decomposability. The majority of the existing methods for learning Gaussian graphical models are either re...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Statistical Analysis and Data Mining

سال: 2021

ISSN: ['1932-1864', '1932-1872']

DOI: https://doi.org/10.1002/sam.11530