Robust Structure Learning of Bayesian Network by Identifying Significant Dependencies

Yuguang Long, Limin Wang, Zhiyi Duan, Minghui SunIEEE Access 2019 · OpenReview

Abstract

Bayesian networks have long been a popular medium for graphically representing the probabilistic dependencies which exist in a domain. State-of-the-art tree-augmented naive Bayes (TAN) builds maximum weighted spanning tree to represent 1-dependence relationships between attributes. In this paper, we propose to optimize the structure of TAN applying heuristic search to sort attribute and filtering technique to remove weak conditional dependencies. Extensive experimental results on 35 data sets from University of California at Irvine (UCI) machine learning repository reveal that the proposed algorithm achieves competitive generalization performance and even outperforms higher-dependence BNCs like <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula> -dependence Bayesian network while retaining excellent strucutre complexity.
BibTeX
@inproceedings{long2019robust,
  author = {Yuguang Long and Limin Wang and Zhiyi Duan and Minghui Sun},
  title = {{Robust Structure Learning of Bayesian Network by Identifying Significant Dependencies}},
  booktitle = {IEEE Access},
  year = {2019},
  url = {https://openreview.net/forum?id=0puDD1DL-v},
}

Loading related content...

Figure