Bayesian structure learning in graphical models

نویسندگان
چکیده

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

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

منابع مشابه

Bayesian structure learning in graphical models

We consider the problem of estimating a sparse precision matrix of a multivariate Gaussian distribution, including the case where the dimension p exceeds the sample size n. Gaussian graphical models provide an important tool in describing conditional independence through presence or absence of the edges in the underlying graph. A popular non-Bayesian method of estimating a graphical structure i...

متن کامل

Graphical Models: Structure Learning

INTRODUCTION The article GRAPHICAL MODELS: PARAMETER LEARNING discussed the learning of parameters for a xed graphical model. In this article, we discuss the simultaneous learning of parameters and structure. Real-world applications of such learning abound and can be found in (e.g.) the Proceedings of the Conference on Uncertainty in Arti cial Intelligence (1991 and after). An index to software...

متن کامل

Learning Bayesian Probability Graphical Models and Abduction

In this chapter I review Bayesian statistics as used for induction and relate it to logic based abduction Much reasoning under un certainty including induction is based on Bayes rule Bayes rule is interesting precisely because it provides a mechanism for abduc tion I review work of Buntine that argues that much of the work on Bayesian learning can be best viewed in terms of graphical models suc...

متن کامل

Bayesian Learning of Sparse Gaussian Graphical Models

Sparse inverse covariance matrix modeling is an important tool for learning relationships among different variables in a Gaussian graph. Most existing algorithms are based on `1 regularization, with the regularization parameters tuned via cross-validation. In this paper, a Bayesian formulation of the problem is proposed, where the regularization parameters are inferred adaptively and cross-vali...

متن کامل

Local Structure Learning in Graphical Models

A topic in probabilistic network learning is to exploit local network structure, i.e., to capture regularities in the conditional probability distributions, and to learn networks with such local structure from data. In this paper we present a modification of the learning algorithm for Bayesian networks with a local decision graph representation suggested in Chickering et al. (1997), which is of...

متن کامل

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


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

ژورنال

عنوان ژورنال: Journal of Multivariate Analysis

سال: 2015

ISSN: 0047-259X

DOI: 10.1016/j.jmva.2015.01.015