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...

Full description

Bibliographic Details
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