Complexity measurement of fundamental pseudo-independent models
From MaRDI portal
Publication:2463644
DOI10.1016/j.ijar.2006.09.008zbMath1132.68771OpenAlexW1992662020MaRDI QIDQ2463644
Publication date: 14 December 2007
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ijar.2006.09.008
data miningmachine learningknowledge discoveryprobabilistic reasoningbelief networksmodel complexity
Learning and adaptive systems in artificial intelligence (68T05) Reasoning under uncertainty in the context of artificial intelligence (68T37)
Uses Software
Cites Work
- A microscopic study of minimum entropy search in learning decomposable Markov networks
- A Bayesian method for the induction of probabilistic networks from data
- Learning Bayesian networks: The combination of knowledge and statistical data
- Toward better scoring metrics for pseudo-independent models
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Complexity measurement of fundamental pseudo-independent models