Block Learning Bayesian Network Structure from Data

Authors:
Yi-feng Zeng;Kim-leng Poh
Affiliations:
National University of Singapore, Kent Ridge;National University of Singapore, Kent Ridge
Venue:
HIS '04 Proceedings of the Fourth International Conference on Hybrid Intelligent Systems
Year:
2004

Citing 0
Cited 3

Fault diagnosis for airplane engines using Bayesian networks and distributed particle swarm optimization

Parallel Computing
A decomposition algorithm for learning Bayesian network structures from data

PAKDD'08 Proceedings of the 12th Pacific-Asia conference on Advances in knowledge discovery and data mining
Dynamic ordering-based search algorithm for markov blanket discovery

PAKDD'11 Proceedings of the 15th Pacific-Asia conference on Advances in knowledge discovery and data mining - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

Existing methods for learning Bayesian network structures run into the computational and statistical problems because of the following two reasons: a large number of variables and a small sample size for enormous variables. Adopting the divide and conquer strategies, we propose a novel algorithm, called block learning algorithm, to learn Bayesian network structures. The method partitions the variables into several blocks that are overlapped with each other. The blocks are learned individually with some constraints obtained from the learned overlap structures. After that, the whole network is recovered by combining the learned blocks. Comparing with some typical learning algorithms on golden Bayesian networks, our proposed methods are efficient and effective. It shows a large potential capability to be scaled up.