Affiliation:
1. School of Information Science and Engineering, Yunnan University, Kunming, China
2. Wuhan Documentation and Information Center, Chinese Academy of Sciences, Wuhan, China
Abstract
Bayesian network (BN) is the well-accepted framework for representing and inferring uncertain knowledge. To learn the BN-based uncertain knowledge incrementally in response to the new data is useful for analysis, prediction, decision making, etc. In this paper, we propose an approach for incremental learning of BNs by focusing on the incremental revision of BN’s graphical structures. First, we give the concept of influence degree to describe the influence of new data on the existing BN by measuring the variation of BN’s probability parameters w.r.t. the likelihood of the new data. Then, for the nodes ordered decreasingly by their influence degrees, we give the scoring-based algorithm for revising BN’s subgraphs iteratively by hill-climbing search for reversing, adding or deleting edges. In the incremental revision, we emphasize the preservation of probabilistic conditional independencies implied in the BN based on the concept and properties of Markov equivalence. Experimental results show the correctness, precision and efficiency of our approach.
Funder
National Natural Science Foundation of China
Key Program of Natural Science Foundation of Yunnan Province
Program for Excellent Young Talents of Yunnan University
Publisher
World Scientific Pub Co Pte Lt
Subject
Artificial Intelligence,Information Systems,Control and Systems Engineering,Software
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献