Discriminative Structure Learning of Bayesian Network Classifiers from Training Dataset and Testing Instance
Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education, Jilin University, Changchun 130012, China
College of Computer Science and Technology, Jilin University, Changchun 130012, China
Faculty of Science, Engineering & Built Environment, Deakin University, Burwood, VIC 3125, Australia
Author to whom correspondence should be addressed.
Received: 12 February 2019 / Revised: 29 April 2019 / Accepted: 6 May 2019 / Published: 13 May 2019
PDF [665 KB, uploaded 21 May 2019]
Over recent decades, the rapid growth in data makes ever more urgent the quest for highly scalable Bayesian networks that have better classification performance and expressivity (that is, capacity to respectively describe dependence relationships between attributes in different situations). To reduce the search space of possible attribute orders, k
-dependence Bayesian classifier (KDB) simply applies mutual information to sort attributes. This sorting strategy is very efficient but it neglects the conditional dependencies between attributes and is sub-optimal. In this paper, we propose a novel sorting strategy and extend KDB from a single restricted network to unrestricted ensemble networks, i.e., unrestricted Bayesian classifier (UKDB), in terms of Markov blanket analysis and target learning. Target learning is a framework that takes each unlabeled testing instance
as a target and builds a specific Bayesian model Bayesian network classifiers (BNC)
to complement BNC
learned from training data
. UKDB respectively introduced UKDB
to flexibly describe the change in dependence relationships for different testing instances and the robust dependence relationships implicated in training data. They both use UKDB as the base classifier by applying the same learning strategy while modeling different parts of the data space, thus they are complementary in nature. The extensive experimental results on the Wisconsin breast cancer database for case study and other 10 datasets by involving classifiers with different structure complexities, such as Naive Bayes (0-dependence), Tree augmented Naive Bayes (1-dependence) and KDB (arbitrary k
-dependence), prove the effectiveness and robustness of the proposed approach.
This is an open access article distributed under the Creative Commons Attribution License
which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
Share & Cite This Article
MDPI and ACS Style
Wang, L.; Liu, Y.; Mammadov, M.; Sun, M.; Qi, S. Discriminative Structure Learning of Bayesian Network Classifiers from Training Dataset and Testing Instance. Entropy 2019, 21, 489.
Wang L, Liu Y, Mammadov M, Sun M, Qi S. Discriminative Structure Learning of Bayesian Network Classifiers from Training Dataset and Testing Instance. Entropy. 2019; 21(5):489.
Wang, Limin; Liu, Yang; Mammadov, Musa; Sun, Minghui; Qi, Sikai. 2019. "Discriminative Structure Learning of Bayesian Network Classifiers from Training Dataset and Testing Instance." Entropy 21, no. 5: 489.
Show more citation formats
Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.
[Return to top]
For more information on the journal statistics, click here
Multiple requests from the same IP address are counted as one view.