Please use this identifier to cite or link to this item: http://scholarbank.nus.edu.sg/handle/10635/38988
Title: Biomedical knowledge discovery with topological constraints modeling in Bayesian networks: a preliminary report.
Authors: Li, G. 
Leong, T.Y. 
Issue Date: 2007
Source: Li, G.,Leong, T.Y. (2007). Biomedical knowledge discovery with topological constraints modeling in Bayesian networks: a preliminary report.. Medinfo. MEDINFO 12 (Pt 1) : 560-565. ScholarBank@NUS Repository.
Abstract: Serving as exploratory data analysis tools, Bayesian networks (BNs) can be automatically learned from data to compactly model direct dependency relationships among the variables in a domain. A major challenge in BN learning is to effectively represent and incorporate domain knowledge in the learning process to improve its efficiency and accuracy. In this paper, we examine two types of domain knowledge representation in BNs: matrix and rule. We develop a set of consistency checking mechanisms for the representations and describe their applications in BN learning. Empirical results from the canonical Asia network example show that topological constraints, especially those imposed on the undirected links in the corresponding completed partially directed acyclic graph (CPDAG) of the learned BN, are particularly useful. Preliminary experiments on a real-life coronary artery disease dataset show that both efficiency and accuracy can be improved with the proposed methodology. The bootstrap approach adopted in the BN learning process with topological constraints also highlights the set of the learned links with high significance, which can in turn prompt further exploration of the actual relationships involved.
Source Title: Medinfo. MEDINFO
URI: http://scholarbank.nus.edu.sg/handle/10635/38988
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

43
checked on Dec 15, 2017

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.