Mind change optimal learning of Bayes net structure from dependency and independency data
From MaRDI portal
(Redirected from Publication:1049405)
Recommendations
Cites work
- scientific article; zbMATH DE number 3888913 (Why is no real title available?)
- scientific article; zbMATH DE number 1493045 (Why is no real title available?)
- scientific article; zbMATH DE number 2150792 (Why is no real title available?)
- scientific article; zbMATH DE number 1439344 (Why is no real title available?)
- 10.1162/153244303321897717
- A scoring function for learning Bayesian networks based on mutual information and conditional independence tests
- Causation, prediction, and search
- Complexity theory and cryptology. An introduction to cryptocomplexity.
- Inductive inference of formal languages from positive data
- Inductive inference of monotonic formal systems from positive data
- Language identification in the limit
- Large-sample learning of Bayesian networks is NP-hard
- Learning Bayesian networks from data: An information-theory based approach
- Learning Theory
- Mind change complexity of learning logic programs
- Mind change efficient learning
- NP is as easy as detecting unique solutions
- The max-min hill-climbing Bayesian network structure learning algorithm
- Trial and error predicates and the solution to a problem of Mostowski
Cited in
(3)
This page was built for publication: Mind change optimal learning of Bayes net structure from dependency and independency data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1049405)