Refinement of Bayesian network structures upon new data
by Yifeng Zeng, Yanping Xiang, Saulius Pacekajus
International Journal of Granular Computing, Rough Sets and Intelligent Systems (IJGCRSIS), Vol. 1, No. 2, 2009

Abstract: Refinement of Bayesian network (BN) structures using new data becomes more and more relevant. Some work has been done there; however, one problem has not been considered yet – what to do when new data have fewer or more attributes than the existing model. In both cases, data contain important knowledge and every effort must be made in order to extract it. In this paper, we propose a general merging algorithm to deal with situations when new data have different set of attributes. The merging algorithm updates sufficient statistics when new data are received. It expands the flexibility of BN structure refinement methods. The new algorithm is evaluated in extensive experiments and its applications are discussed at length.

Online publication date: Thu, 27-Aug-2009

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Granular Computing, Rough Sets and Intelligent Systems (IJGCRSIS):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com