Mind change optimal learning of Bayes net structure from dependency and independency data
From MaRDI portal
Publication:1049405
DOI10.1016/j.ic.2009.03.009zbMath1185.68570OpenAlexW2016471967WikidataQ62681671 ScholiaQ62681671MaRDI QIDQ1049405
Oliver Schulte, Russell Greiner, Wei Luo
Publication date: 12 January 2010
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2009.03.009
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Inductive inference of monotonic formal systems from positive data
- The max-min hill-climbing Bayesian network structure learning algorithm
- NP is as easy as detecting unique solutions
- Causation, prediction, and search
- Mind change complexity of learning logic programs
- Learning Bayesian networks from data: An information-theory based approach
- Complexity theory and cryptology. An introduction to cryptocomplexity.
- Mind change efficient learning
- Inductive inference of formal languages from positive data
- 10.1162/153244303321897717
- Learning Theory
- Trial and error predicates and the solution to a problem of Mostowski
- Language identification in the limit
This page was built for publication: Mind change optimal learning of Bayes net structure from dependency and independency data