Structure learning of contextual Markov networks using marginal pseudo-likelihood
From MaRDI portal
Publication:5738836
Abstract: Markov networks are popular models for discrete multivariate systems where the dependence structure of the variables is specified by an undirected graph. To allow for more expressive dependence structures, several generalizations of Markov networks have been proposed. Here we consider the class of contextual Markov networks which takes into account possible context-specific independences among pairs of variables. Structure learning of contextual Markov networks is very challenging due to the extremely large number of possible structures. One of the main challenges has been to design a score, by which a structure can be assessed in terms of model fit related to complexity, without assuming chordality. Here we introduce the marginal pseudo-likelihood as an analytically tractable criterion for general contextual Markov networks. Our criterion is shown to yield a consistent structure estimator. Experiments demonstrate the favorable properties of our method in terms of predictive accuracy of the inferred models.
Recommendations
- Marginal pseudo-likelihood learning of discrete Markov network structures
- Learning decomposable Markov networks in pseudo-independent domains with local evaluation
- Learning Gaussian graphical models with fractional marginal pseudo-likelihood
- High-dimensional structure learning of binary pairwise Markov networks: a comparative numerical study
- Estimation of sparse binary pairwise Markov networks using pseudo-likelihoods
Cites work
- scientific article; zbMATH DE number 4211299 (Why is no real title available?)
- scientific article; zbMATH DE number 1946869 (Why is no real title available?)
- A fast procedure for model search in multidimensional contingency tables
- Consistent estimation of the basic neighborhood of Markov random fields
- Context-specific independence in graphical log-linear models
- Dependency networks for inference, collaborative filtering, and data visualization
- Estimating the dimension of a model
- Estimation of sparse binary pairwise Markov networks using pseudo-likelihoods
- Graphical models, exponential families, and variational inference
- High-dimensional Ising model selection using \(\ell _{1}\)-regularized logistic regression
- Hyper Markov laws in the statistical analysis of decomposable graphical models
- Introduction to Graphical Modelling
- Labelled Graphical Models
- Learning discrete decomposable graphical models via constraint optimization
- Marginal pseudo-likelihood learning of discrete Markov network structures
- Markov Random Fields with Higher-order Interactions
- Model Selection and Accounting for Model Uncertainty in Graphical Models Using Occam's Window
- Split models for contingency tables
- Stratified graphical models -- context-specific independence in graphical models
- The role of local partial independence in learning of Bayesian networks
Cited in
(8)- Model selection for Markov random fields on graphs under a mixing condition
- Marginal information for structure learning
- Estimation of sparse binary pairwise Markov networks using pseudo-likelihoods
- Marginal pseudo-likelihood learning of discrete Markov network structures
- Blankets joint posterior score for learning Markov network structures
- Learning decomposable Markov networks in pseudo-independent domains with local evaluation
- Structure recovery for partially observed discrete Markov random fields on graphs under not necessarily positive distributions
- High-dimensional structure learning of binary pairwise Markov networks: a comparative numerical study
This page was built for publication: Structure learning of contextual Markov networks using marginal pseudo-likelihood
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5738836)
