DocumentCode
3060954
Title
Improvement of Bayesian Network Inference Using a Relaxed Gene Ordering
Author
Zhu, Dongxiao ; Li, Hua
Author_Institution
Stowers Inst. for Med. Res., Kansas City
fYear
2007
fDate
13-15 Dec. 2007
Firstpage
600
Lastpage
605
Abstract
Bayesian network structural learning from high throughput data has become a powerful tool in reconstructing signaling pathways. Recent bioinformatics research advocates the notion that signaling networks in the living cell are likely to be hierarchically organized. Genes resident in hierarchical layers constitute biological constraint, which can be readily used by many network structural learning algorithms to reduce the computational complexity. Based on the hierarchical constraint constructed by using breadth-first-search(BFS) on a manually assembled transcriptional regulation network in Saccharomyces cerevisiae, we propose a new constrained Bayesian network structural learning algorithm that solves the NP-hard computational problem in a heuristic manner. We demonstrate the utility of our algorithm in constructing two important signaling pathways.
Keywords
belief networks; biology computing; computational complexity; genetics; inference mechanisms; learning (artificial intelligence); tree searching; Bayesian network inference; NP-hard problem; Saccharomyces cerevisiae; biological constraint; breadth-first-search; computational complexity; constrained Bayesian network structural learning algorithm; relaxed gene ordering; signaling pathway; Bayesian methods; Bioinformatics; Cities and towns; Fungi; Genetics; Genomics; Machine learning; Mutual information; Regulators; Throughput;
fLanguage
English
Publisher
ieee
Conference_Titel
Machine Learning and Applications, 2007. ICMLA 2007. Sixth International Conference on
Conference_Location
Cincinnati, OH
Print_ISBN
978-0-7695-3069-7
Type
conf
DOI
10.1109/ICMLA.2007.68
Filename
4457295
Link To Document