Efficient Markov Network Structure Discovery Using Independence Tests

DOI10.1613/jair.2773zbMath1192.68817arXiv1401.3478OpenAlexW2097903822MaRDI QIDQ3651469

Vasant Honavar, Facundo Bromberg, Dimitris Margaritis

Publication date: 10 December 2009

Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)

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

zbMATH Keywords

triangle theoremGrow-Shrink algorithm

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (7)

Objective Bayesian Nets for Integrating Consistent Datasets ⋮ Blankets joint posterior score for learning Markov network structures ⋮ Unnamed Item ⋮ AMP Chain Graphs: Minimal Separators and Structure Learning Algorithms ⋮ Sparse model selection in the highly under-sampled regime ⋮ Probabilistic Graphical Models and Markov Networks ⋮ The IBMAP approach for Markov network structure learning

This page was built for publication: Efficient Markov Network Structure Discovery Using Independence Tests