Efficient approximation of the conditional relative entropy with applications to discriminative learning of Bayesian network classifiers

DOI10.3390/e15072716zbMath1398.94071OpenAlexW2065733810WikidataQ59196638 ScholiaQ59196638MaRDI QIDQ280459

Paulo Mateus, Alexandra M. Carvalho, Pedro Adão

Publication date: 10 May 2016

Published in: Entropy (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/e15072716

zbMATH Keywords

approximationdiscriminative learningBayesian network classifiersconditional relative entropy

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Measures of information, entropy (94A17)

Cites Work

• Approximating probabilistic inference in Bayesian belief networks is NP- hard
• On the optimality of the simple Bayesian classifier under zero-one loss
• Bayesian network classifiers
• Approximating probability distributions to reduce storage requirements
• 10.1162/153244302760200696
• Optimum branchings
• Approximating discrete probability distributions with dependence trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient approximation of the conditional relative entropy with applications to discriminative learning of Bayesian network classifiers