DeepAI AI Chat
Log In Sign Up

Learning binary undirected graph in low dimensional regime

by   Daniela De Canditiis, et al.

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.


page 1

page 2

page 3

page 4


Learning Markov Network Structure using Brownian Distance Covariance

In this paper, we present a simple non-parametric method for learning th...

Learning High-Dimensional Gaussian Graphical Models under Total Positivity without Tuning Parameters

We consider the problem of estimating an undirected Gaussian graphical m...

Marginalizing in Undirected Graph and Hypergraph Models

Given an undirected graph G or hypergraph X model for a given set of var...

Time Varying Undirected Graphs

Undirected graphs are often used to describe high dimensional distributi...

The undirected repetition threshold

For rational 1<r≤ 2, an undirected r-power is a word of the form xyx', w...

A Parallel PageRank Algorithm For Undirected Graph

PageRank is a fundamental property of graph and there have been plenty o...

Semiparametric Nonlinear Bipartite Graph Representation Learning with Provable Guarantees

Graph representation learning is a ubiquitous task in machine learning w...