The IBMAP approach for Markov networks structure learning

01/16/2013
by   Federico Schlüter, et al.
0

In this work we consider the problem of learning the structure of Markov networks from data. We present an approach for tackling this problem called IBMAP, together with an efficient instantiation of the approach: the IBMAP-HC algorithm, designed for avoiding important limitations of existing independence-based algorithms. These algorithms proceed by performing statistical independence tests on data, trusting completely the outcome of each test. In practice tests may be incorrect, resulting in potential cascading errors and the consequent reduction in the quality of the structures learned. IBMAP contemplates this uncertainty in the outcome of the tests through a probabilistic maximum-a-posteriori approach. The approach is instantiated in the IBMAP-HC algorithm, a structure selection strategy that performs a polynomial heuristic local search in the space of possible structures. We present an extensive empirical evaluation on synthetic and real data, showing that our algorithm outperforms significantly the current independence-based algorithms, in terms of data efficiency and quality of learned structures, with equivalent computational complexities. We also show the performance of IBMAP-HC in a real-world application of knowledge discovery: EDAs, which are evolutionary algorithms that use structure learning on each generation for modeling the distribution of populations. The experiments show that when IBMAP-HC is used to learn the structure, EDAs improve the convergence to the optimum.

READ FULL TEXT

page 11

page 25

research
01/15/2014

Efficient Markov Network Structure Discovery Using Independence Tests

We present two algorithms for learning the structure of a Markov network...
research
01/18/2011

Efficient Independence-Based MAP Approach for Robust Markov Networks Structure Discovery

This work introduces the IB-score, a family of independence-based score ...
research
05/30/2018

Who Learns Better Bayesian Network Structures: Constraint-Based, Score-based or Hybrid Algorithms?

The literature groups algorithms to learn the structure of Bayesian netw...
research
08/10/2011

A survey on independence-based Markov networks learning

This work reports the most relevant technical aspects in the problem of ...
research
11/12/2022

Improving the Efficiency of the PC Algorithm by Using Model-Based Conditional Independence Tests

Learning causal structure is useful in many areas of artificial intellig...
research
07/15/2013

Learning Markov networks with context-specific independences

Learning the Markov network structure from data is a problem that has re...
research
10/22/2021

Recursive Causal Structure Learning in the Presence of Latent Variables and Selection Bias

We consider the problem of learning the causal MAG of a system from obse...

Please sign up or login with your details

Forgot password? Click here to reset