A sub-space greedy search method for efficient Bayesian Network inference
Publication in refereed journal

香港中文大學研究人員

引用次數
替代計量分析
.

其它資訊
摘要Bayesian network (BN) has been successfully used to infer the regulatory relationships of genes from microarray dataset. However, one major limitation of BN approach is the computational cost because the calculation time grows more than exponentially with the dimension of the dataset. In this paper, we propose a sub-space greedy search method for efficient Bayesian Network inference. Particularly, this method limits the greedy search space by only selecting gene pairs with higher partial correlation coefficients. Using both synthetic and real data, we demonstrate that the proposed method achieved comparable results with standard greedy search method yet saved similar to 50% of the computational time. We believe that sub-space search method can be widely used for efficient BN inference in systems biology. (C) 2011 Elsevier Ltd. All rights reserved.
著者Zhang Q, Cao Y, Li Y, Zhu YM, Sun SSM, Guo DJ
期刊名稱Computers in Biology and Medicine
出版年份2011
月份9
日期1
卷號41
期次9
出版社PERGAMON-ELSEVIER SCIENCE LTD
頁次763 - 770
國際標準期刊號0010-4825
電子國際標準期刊號1879-0534
語言英式英語
關鍵詞Bayesian network(BN); Greedy search; Microarray; Partial correlation coefficient; Regulation network
Web of Science 學科類別Biology; BIOLOGY; Computer Science; Computer Science, Interdisciplinary Applications; COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS; Engineering; Engineering, Biomedical; ENGINEERING, BIOMEDICAL; Life Sciences & Biomedicine - Other Topics; Mathematical & Computational Biology; MATHEMATICAL & COMPUTATIONAL BIOLOGY

上次更新時間 2020-21-10 於 00:34