Estimation of sparse binary pairwise Markov networks using pseudo-likelihoods
From MaRDI portal
Recommendations
- Marginal pseudo-likelihood learning of discrete Markov network structures
- High-dimensional structure learning of binary pairwise Markov networks: a comparative numerical study
- Equivalence relations and inference for sparse Markov models
- Structured priors for sparse probability vectors with application to model selection in Markov chains
- Statistical estimation of parameters for binary Markov chain models with embeddings
- Sparse Sampling and Maximum Likelihood Estimation for Boolean Models
- Structure learning of contextual Markov networks using marginal pseudo-likelihood
- Concave penalized estimation of sparse Gaussian Bayesian networks
- Efficient approximations for the marginal likelihood of Bayesian networks with hidden variables
Cited in
(40)- Marginal pseudo-likelihood learning of discrete Markov network structures
- Direct Learning of Sparse Changes in Markov Networks by Density Ratio Estimation
- A global approach for learning sparse Ising models
- An Additive Graphical Model for Discrete Data
- Stable graphical model estimation with random forests for discrete, continuous, and mixed variables
- Structure learning of exponential family graphical model with false discovery rate control
- High-dimensional structure learning of binary pairwise Markov networks: a comparative numerical study
- Approximate inverse Ising models close to a Bethe reference point
- Simultaneous inference for pairwise graphical models with generalized score matching
- Empirical comparison study of approximate methods for structure selection in binary graphical models
- High-dimensional Ising model selection with Bayesian information criteria
- Structure learning of undirected graphical models for count data.
- Sparse estimation in Ising model via penalized Monte Carlo methods
- Fitting and testing log-linear subpopulation models with known support
- Estimating finite mixtures of ordinal graphical models
- Change-point computation for large graphical models: a scalable algorithm for Gaussian graphical models with change-points
- Sparse and low-rank matrix regularization for learning time-varying Markov networks
- Estimating heterogeneous graphical models for discrete data with an application to roll call voting
- Estimation of high-dimensional partially-observed discrete Markov random fields
- Structure estimation of binary graphical models on stratified data: application to the description of injury tables for victims of road accidents
- Loglinear model selection and human mobility
- Cycle-based cluster variational method for direct and inverse inference
- Structure recovery for partially observed discrete Markov random fields on graphs under not necessarily positive distributions
- A clustered and sparse Ising regression model for multivariate binary data
- On semiparametric exponential family graphical models
- Sparse model selection in the highly under-sampled regime
- Learning binary undirected graph in low dimensional regime
- Structure learning for continuous time Bayesian networks via penalized likelihood
- A parallel algorithm for ridge-penalized estimation of the multivariate exponential family from data of mixed types
- Model selection for Markov random fields on graphs under a mixing condition
- A sparse Ising model with covariates
- Ising model selection using ℓ 1-regularized linear regression: a statistical mechanics analysis*
- Structure learning of contextual Markov networks using marginal pseudo-likelihood
- Estimation of high-dimensional graphical models using regularized score matching
- Pseudolikelihood estimators for graphical models: existence and uniqueness
- Nonconcave penalized composite conditional likelihood estimation of sparse Ising models
- A constrained \(\ell1\) minimization approach for estimating multiple sparse Gaussian or nonparanormal graphical models
- Generalized Network Structured Models with Mixed Responses Subject to Measurement Error and Misclassification
- ROCKET: robust confidence intervals via Kendall's tau for transelliptical graphical models
- Estimation of graphical models through structured norm minimization
This page was built for publication: Estimation of sparse binary pairwise Markov networks using pseudo-likelihoods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2880910)
