arrow
Return

Hierarchical Independence Thresholding for learning Bayesian network classifiers

delete2021-01-01
delete16
PRE
AI
Y
Yang Liu
L
Limin Wang *
M
Musa Mammadov
S
Shenglei Chen
G
Gaojie Wang
M
Minghui Sun
DOI:10.1016/j.knosys.2020.106627delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Bayesian networks are powerful tools for knowledge representation and inference under conditions of uncertainty. However, learning an optimal Bayesian network classifier (BNC) is an NP-hard problem since its topology complexity increases exponentially with the number of attributes. Researchers proposed to apply information-theoretic criteria to measure conditional dependence, and independence assumptions are introduced implicitly or explicitly to simplify the network topology of BNC. In this paper, we clarify the mapping relationship between conditional mutual information and local topology, and then illustrate that informational independence does not correspond to probabilistic independence, the criterion of probabilistic independence does not necessarily hold for the independence topology. A novel framework of semi-naive Bayesian operation, called Hierarchical Independence Thresholding (HIT), is presented to efficiently identify informational conditional independence and probabilistic conditional independence by applying an adaptive thresholding method, redundant edges will be filtered out and the learned topology will fit the data better. Extensive experimental evaluation on 58 publicly available datasets reveals that when HIT is applied to BNCs (such as tree augmented Naive Bayes or k-dependence Bayesian classifier), the final BNCs achieve competitive classification performance compared to state-of-the-art learners such as Random Forest and Logistic regression. (C) 2020 Elsevier B.V. All rights reserved.
Keywords:
Bayesian network
Hierarchical independence thresholding
Informational independence
Probabilistic independence
Adaptive thresholding
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

K
Knowledge-Based Systems
IF:
7.6
Papers:
1.2W
Citations:
4.5W

Organization

Nanjing Audit University cover
Nanjing Audit University
Scholars:
1.0K
Papers: 1.3K
Citations: 1.3K
D
Deakin University
Scholars:
2.0W
Papers: 2.1W
Citations: 2.8W
J
Jilin University
Scholars:
8.7W
Papers: 5.5W
Citations: 8.9K
researcher View more organizations