The IBMAP approach for Markov network structure learning
From MaRDI portal
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.
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
Cites work
- scientific article; zbMATH DE number 1817585 (Why is no real title available?)
- scientific article; zbMATH DE number 48812 (Why is no real title available?)
- scientific article; zbMATH DE number 107482 (Why is no real title available?)
- scientific article; zbMATH DE number 1134987 (Why is no real title available?)
- scientific article; zbMATH DE number 1131224 (Why is no real title available?)
- scientific article; zbMATH DE number 1754723 (Why is no real title available?)
- Causation, prediction, and search
- Efficient Markov Network Structure Discovery Using Independence Tests
- Graphical models, exponential families, and variational inference
- High-dimensional Ising model selection using \(\ell _{1}\)-regularized logistic regression
- 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 I: Algorithms and empirical evaluation
- Local causal and Markov blanket induction for causal discovery and feature selection for classification. Part II: Analysis and extensions
- MARLEDA: effective distribution estimation through Markov random fields
- Markov Random Field Modeling in Image Analysis
- Probabilistic graphical models.
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)
