The IBMAP approach for Markov network structure learning

DOI10.1007/S10472-014-9419-5zbMATH Open1319.68189arXiv1301.3720OpenAlexW2073050283MaRDI QIDQ2254625FDOQ2254625

Authors: Federico Schlüter, Facundo Bromberg, Alejandro Edera 

Publication date: 5 February 2015

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Abstract: 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.

Full work available at URL: https://arxiv.org/abs/1301.3720

Recommendations

• Efficient Markov Network Structure Discovery Using Independence Tests
• Improving Markov network structure learning using decision trees
• Learning Bayesian networks in the space of structures by estimation of distribution algorithms
• Learning Bayesian networks: The combination of knowledge and statistical data
• Probabilistic graphical models and Markov networks

zbMATH Keywords

structure learningknowledge discoveryEDAsMarkov networkindependence tests

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• Causation, prediction, and search
• Graphical models, exponential families, and variational inference
• Title not available (Why is that?)
• Title not available (Why is that?)
• Markov Random Field Modeling in Image Analysis
• Title not available (Why is that?)
• Title not available (Why is that?)
• High-dimensional Ising model selection using \(\ell _{1}\)-regularized logistic regression
• Probabilistic graphical models.
• Title not available (Why is that?)
• MARLEDA: effective distribution estimation through Markov random fields
• Local causal and Markov blanket induction for causal discovery and feature selection for classification. Part I: Algorithms and empirical evaluation
• Title not available (Why is that?)
• Efficient Markov Network Structure Discovery Using Independence Tests
• Improving the reliability of causal discovery from small data sets using argumentation
• Local causal and Markov blanket induction for causal discovery and feature selection for classification. Part II: Analysis and extensions

Cited In (1)

• Blankets joint posterior score for learning Markov network structures

Uses Software

• UCI-ml
• TETRAD

This page was built for publication: The IBMAP approach for Markov network structure learning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2254625)