DeepAI AI Chat
Log In Sign Up

Learning Markov Network Structure using Brownian Distance Covariance

by   Ehsan Khoshgnauz, et al.

In this paper, we present a simple non-parametric method for learning the structure of undirected graphs from data that drawn from an underlying unknown distribution. We propose to use Brownian distance covariance to estimate the conditional independences between the random variables and encodes pairwise Markov graph. This framework can be applied in high-dimensional setting, where the number of parameters much be larger than the sample size.


What Intraclass Covariance Structures Can Symmetric Bernoulli Random Variables Have?

The covariance matrix of random variables X_1,…,X_n is said to have an i...

Learning binary undirected graph in low dimensional regime

Given a random sample extracted from a Multivariate Bernoulli Variable (...

A Fast Iterative Algorithm for High-dimensional Differential Network

Differential network is an important tool to capture the changes of cond...

A fast algorithm for computing distance correlation

Classical dependence measures such as Pearson correlation, Spearman's ρ,...

Learning Sparse Structural Changes in High-dimensional Markov Networks: A Review on Methodologies and Theories

Recent years have seen an increasing popularity of learning the sparse c...

Structure Learning of Partitioned Markov Networks

We learn the structure of a Markov Network between two groups of random ...

High-dimensional structure learning of binary pairwise Markov networks: A comparative numerical study

Learning the undirected graph structure of a Markov network from data is...