Learning a flexible K-dependence Bayesian classifier from the chain rule of joint probability distribution

DOI10.3390/E17063766zbMATH Open1341.62194OpenAlexW1582247229MaRDI QIDQ296380FDOQ296380

Authors: Haoyu Zhao, Limin Wang 

Publication date: 15 June 2016

Published in: Entropy (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Bayesian inference (62F15) Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Cites Work

• A Mathematical Theory of Communication
• Large-sample learning of Bayesian networks is NP-hard
• Title not available (Why is that?)
• Approximating discrete probability distributions with dependence trees
• Probabilistic graphical models.
• Bayesian network classifiers
• Learning Bayesian networks from data: An information-theory based approach
• Proper Quaternion Gaussian Graphical Models
• Investigation of commuting Hamiltonian in quantum Markov network
• Discrete Bayesian network classifiers: a survey
• Constrained domain maximum likelihood estimation for naive Bayes text classification

This page was built for publication: Learning a flexible \(K\)-dependence Bayesian classifier from the chain rule of joint probability distribution

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q296380)