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

全面介紹

書目詳細資料

Principais autores:	Limin Wang, Haoyu Zhao, Minghui Sun, Yue Ning
格式:	Artigo
語言:	Inglês
出版:	MDPI AG 2015-06-01
叢編:	Entropy
主題:	k-dependence Bayesian classifier substitution-elimination resolution functionaldependency rules of probability
在線閱讀:	http://www.mdpi.com/1099-4300/17/6/4134
標簽:	添加標簽 沒有標簽, 成為第一個標記此記錄!