K-Dependence Bayesian Classifier Ensemble
To maximize the benefit that can be derived from the information implicit in big data, ensemble methods generate multiple models with sufficient diversity through randomization or perturbation. A k-dependence Bayesian classifier (KDB) is a highly scalable learning algorithm with excellent time and s...
Main Authors: | Zhiyi Duan, Limin Wang |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2017-11-01
|
Series: | Entropy |
Subjects: | |
Online Access: | https://www.mdpi.com/1099-4300/19/12/651 |
Similar Items
-
General and Local: Averaged k-Dependence Bayesian Classifiers
by: Limin Wang, et al.
Published: (2015-06-01) -
Robust Structure Learning of Bayesian Network by Identifying Significant Dependencies
by: Yuguang Long, et al.
Published: (2019-01-01) -
Efficient Heuristics for Structure Learning of <i>k</i>-Dependence Bayesian Classifier
by: Yang Liu, et al.
Published: (2018-11-01) -
An Improved Classifier Chain Ensemble for Multi-DimensionalClassification with Conditional Dependence
by: Heydorn, Joseph Ethan
Published: (2015) -
On the Family of Conditional Embedded Implicational Dependencies
by: Victor Felea
Published: (1996-03-01)