General and Local: Averaged k-Dependence Bayesian Classifiers
The inference of a general Bayesian network has been shown to be an NP-hard problem, even for approximate solutions. Although k-dependence Bayesian (KDB) classifier can construct at arbitrary points (values of k) along the attribute dependence spectrum, it cannot identify the changes of interdepende...
Main Authors: | Limin Wang, Haoyu Zhao, Minghui Sun, Yue Ning |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2015-06-01
|
Series: | Entropy |
Subjects: | |
Online Access: | http://www.mdpi.com/1099-4300/17/6/4134 |
Similar Items
-
Learning a Flexible K-Dependence Bayesian Classifier from the Chain Rule of Joint Probability Distribution
by: Limin Wang, et al.
Published: (2015-06-01) -
Efficient Heuristics for Structure Learning of <i>k</i>-Dependence Bayesian Classifier
by: Yang Liu, et al.
Published: (2018-11-01) -
Application of a naive Bayesians classifiers in assessing the supplier
by: Mijailović Snežana, et al.
Published: (2017-01-01) -
K-Dependence Bayesian Classifier Ensemble
by: Zhiyi Duan, et al.
Published: (2017-11-01) -
Discriminative Structure Learning of Bayesian Network Classifiers from Training Dataset and Testing Instance
by: LiMin Wang, et al.
Published: (2019-05-01)