arrow
Return

PSL: An Algorithm for Partial Bayesian Network Structure Learning

delete2022-03-09
delete6
PRE
AI
Z
Zhaolong Ling
K
Kui Yu *
刘琳 (Lin Liu)
J
Jiuyong Li
张议文 (Yiwen Zhang)
X
Xindong Wu
DOI:10.1145/3508071delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Learning partial Bayesian network (BN) structure is an interesting and challenging problem. In this challenge, it is computationally expensive to use global BN structure learning algorithms, while only one part of a BN structure is interesting, local BN structure learning algorithms are not a favourable solution either due to the issue of false edge orientation. To address the problem, this article first presents a detailed analysis of the false edge orientation issue with local BN structure learning algorithms and then proposes PSL, an efficient and accurate Partial BN Structure Learning (PSL) algorithm. Specifically, PSL divides V-structures in a Markov blanket (MB) into two types: Type-C V-structures and Type-NC V-structures, then it starts from the given node of interest and recursively finds both types of V-structures in the MB of the current node until all edges in the partial BN structure are oriented. To further improve the efficiency of PSL, the PSL-FS algorithm is designed by incorporating Feature Selection (FS) into PSL. Extensive experiments with six benchmark BNs validate the efficiency and accuracy of the proposed algorithms.
Keywords:
Bayesian network
local structure learning
global structure learning
markov blanket
feature selection

Journal

ACM Transactions on Knowledge Discovery from Data cover
ACM Transactions on Knowledge Discovery from Data
IF:
4.8
Papers:
1.3K
Citations:
4.4K

Organization

H
hefei university of technology
Scholars:
2.5W
Papers: 1.7W
Citations: 35
U
University of South Australia
Scholars:
9.0K
Papers: 1.1W
Citations: 1.6W
A
anhui university
Scholars:
1.9W
Papers: 1.2W
Citations: 24
researcher View more organizations