A microscopic study of minimum entropy search in learning decomposable Markov networks

DOI10.1023/A:1007324100110zbMath0866.68088OpenAlexW1558863764MaRDI QIDQ677528

Juan-Miguel Gracia

Publication date: 4 August 1997

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1007324100110

zbMATH Keywords

probabilistic networks

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (6)

Learning decomposable Markov networks in pseudo-independent domains with local evaluation ⋮ Towards using the chordal graph polytope in learning decomposable models ⋮ Discovering a junction tree behind a Markov network by a greedy algorithm ⋮ Complexity measurement of fundamental pseudo-independent models ⋮ The minimum-entropy set cover problem ⋮ Unnamed Item

This page was built for publication: A microscopic study of minimum entropy search in learning decomposable Markov networks