Efficient approximation of the conditional relative entropy with applications to discriminative learning of Bayesian network classifiers
From MaRDI portal
(Redirected from Publication:280459)
Recommendations
- Discriminative learning of Bayesian networks via factorized conditional log-likelihood
- On discriminative Bayesian network classifiers and logistic regression
- Efficient parameter learning of Bayesian network classifiers
- scientific article; zbMATH DE number 1927373
- Structural extension to logistic regression: Discriminative parameter learning of belief net classifiers
Cites work
- scientific article; zbMATH DE number 2134025 (Why is no real title available?)
- scientific article; zbMATH DE number 48812 (Why is no real title available?)
- 10.1162/153244302760200696
- A scoring function for learning Bayesian networks based on mutual information and conditional independence tests
- Approximating discrete probability distributions with dependence trees
- Approximating probabilistic inference in Bayesian belief networks is NP- hard
- Approximating probability distributions to reduce storage requirements
- Bayesian network classifiers
- Discriminative learning of Bayesian networks via factorized conditional log-likelihood
- Large-sample learning of Bayesian networks is NP-hard
- On the optimality of the simple Bayesian classifier under zero-one loss
- Optimum branchings
- Probabilistic graphical models.
Cited in
(2)
This page was built for publication: Efficient approximation of the conditional relative entropy with applications to discriminative learning of Bayesian network classifiers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q280459)
