کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
10351616 | 864497 | 2011 | 8 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A sub-space greedy search method for efficient Bayesian Network inference
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نرم افزارهای علوم کامپیوتر
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: A sub-space greedy search method for efficient Bayesian Network inference A sub-space greedy search method for efficient Bayesian Network inference](/preview/png/10351616.png)
چکیده انگلیسی
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 â¼50% of the computational time. We believe that sub-space search method can be widely used for efficient BN inference in systems biology.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers in Biology and Medicine - Volume 41, Issue 9, September 2011, Pages 763-770
Journal: Computers in Biology and Medicine - Volume 41, Issue 9, September 2011, Pages 763-770
نویسندگان
Qing Zhang, Yong Cao, Yong Li, Yanming Zhu, Samuel S.M. Sun, Dianjing Guo,