By Topic

An algorithm for reconstruction of Markov blankets in Bayesian networks of gene expression datasets

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Barbacioru, C. ; Dept. of Biomed. Informatics, Ohio State Univ., Columbus, OH, USA ; Cowden, D.J. ; Saltz, J.

This work presents an efficient algorithm, of polynomial complexity for learning Bayesian belief networks over a dataset of gene expression levels. Given a dataset that is large enough, the algorithm generates a belief network close to the underlying model by recovering the Markov blanket of every node. The time complexity is dependent on the connectivity of the generating graph and not on the size of it, and therefore yields to exponential savings in computational time relative to some previously known algorithms. We use bootstrap and permutation techniques in order to measure confidence in our finding. To evaluate this algorithm, we present experimental results on S.cerevisiae cell-cycle measurements of Spettman et al. (1998).

Published in:

Computational Systems Bioinformatics Conference, 2004. CSB 2004. Proceedings. 2004 IEEE

Date of Conference:

16-19 Aug. 2004