A global approach for learning sparse Ising models

DOI10.1016/J.MATCOM.2020.02.012OpenAlexW2955752281MaRDI QIDQ1998053FDOQ1998053

Authors: Daniela De Canditiis 

Publication date: 6 March 2021

Published in: Mathematics and Computers in Simulation (Search for Journal in Brave)

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

Recommendations

• High-dimensional Ising model selection using \(\ell _{1}\)-regularized logistic regression
• Sparse estimation in Ising model via penalized Monte Carlo methods
• Model selection through sparse maximum likelihood estimation for multivariate Gaussian or binary data
• Efficiently learning Ising models on arbitrary graphs (extended abstract)
• Nonconcave penalized composite conditional likelihood estimation of sparse Ising models

zbMATH Keywords

logistic regressionIsing models\( l_1\) penaltypairwise Markov graphs

Mathematics Subject Classification ID

Multivariate analysis (62Hxx) Graph theory (05Cxx)

Cites Work

• Estimation of sparse binary pairwise Markov networks using pseudo-likelihoods
• Title not available (Why is that?)
• Approximating discrete probability distributions with dependence trees
• High-dimensional Ising model selection using \(\ell _{1}\)-regularized logistic regression
• Probabilistic graphical models.
• High-dimensional structure estimation in Ising models: local separation criterion
• Reconstruction of Markov Random Fields from Samples: Some Observations and Algorithms
• Efficiently learning Ising models on arbitrary graphs (extended abstract)

Cited In (3)

• Applied scientific computing. XV: Innovative modeling and simulation in sciences
• Learning binary undirected graph in low dimensional regime
• Nonconcave penalized composite conditional likelihood estimation of sparse Ising models

Uses Software

• glasso

This page was built for publication: A global approach for learning sparse Ising models

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