Learning binary undirected graph in low dimensional regime
From MaRDI portal
Publication:6089186
Abstract: Given a random sample extracted from a Multivariate Bernoulli Variable (MBV), we consider the problem of estimating the structure of the undirected graph for which the distribution is pairwise Markov and the parameters' vector of its exponential form. We propose a simple method that provides a closed form estimator of the parameters' vector and through its support also provides an estimate of the undirected graph associated to the MBV distribution. The estimator is proved to be consistent but it is feasible only in low-dimensional regimes. Synthetic examples illustrates its performance compared with another method that represents the state of the art in literature. Finally, the proposed procedure is used for the analysis of a real data set in the pediatric allergology area showing its practical efficiency.
Recommendations
Cites work
- A global approach for learning sparse Ising models
- Estimation of sparse binary pairwise Markov networks using pseudo-likelihoods
- Graphical models for categorical data
- High-dimensional Ising model selection using \(\ell _{1}\)-regularized logistic regression
- scientific article; zbMATH DE number 6388313 (Why is no real title available?)
- scientific article; zbMATH DE number 3513115 (Why is no real title available?)
- scientific article; zbMATH DE number 1134987 (Why is no real title available?)
- Markov random fields for vision and image processing
- Multivariate Bernoulli distribution
- On Simpson's Paradox and the Sure-Thing Principle
- Structure estimation for discrete graphical models: generalized covariance matrices and their inverses
- Testing conditional independence of discrete distributions
This page was built for publication: Learning binary undirected graph in low dimensional regime
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6089186)