2003
DOI: 10.1177/003754903040942
|View full text |Cite
|
Sign up to set email alerts
|

Studying the Conditions for Learning Dynamic Bayesian Networks to Discover Genetic Regulatory Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
9
0

Year Published

2005
2005
2009
2009

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 8 publications
(9 citation statements)
references
References 0 publications
0
9
0
Order By: Relevance
“…The continuous Bayesian network using ARIA will be compared with a discrete BN in its capability of recovering the original structure based solely on the data generated by the true network. The structure learning search heuristic used here (which will be the same for both BNs models) is the greedy hill climbing strategy, since it is reported in [25] to have the best performance when compared to other algorithms. In order to discretize the variables, we employed the method proposed in [12], which uses k-means clustering to detect three discrete expression levels.…”
Section: Methodsmentioning
confidence: 99%
See 2 more Smart Citations
“…The continuous Bayesian network using ARIA will be compared with a discrete BN in its capability of recovering the original structure based solely on the data generated by the true network. The structure learning search heuristic used here (which will be the same for both BNs models) is the greedy hill climbing strategy, since it is reported in [25] to have the best performance when compared to other algorithms. In order to discretize the variables, we employed the method proposed in [12], which uses k-means clustering to detect three discrete expression levels.…”
Section: Methodsmentioning
confidence: 99%
“…In order to discretize the variables, we employed the method proposed in [12], which uses k-means clustering to detect three discrete expression levels. This is a very sophisticated discretization method and has also been used elsewhere [25].…”
Section: Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…The network interactions are drawn from the genes expressed at an earlier time-point to those at the later time. By using the time-series data, DBN might be able to identify the feedback loops (Kim, 2007;Perrin et al, 2003;van Berlo, 2003;Zou and Conzen, 2005).…”
Section: Biological Assumptions and Limitations Of Bayesian Networkmentioning
confidence: 99%
“…Various linear and nonlinear models for continuous and discrete gene expression levels have been studied for gene regulation. Among the models that consider discrete gene expression levels, the discrete Bayesian networks (Gat-Viks et al 2005;Pe'er et al 2001;Perrin et al 2003;van Berlo et al 2003), the Probabilistic Boolean networks (Dougherty et al 2005;Shmulevich et al 2002) and the Gaussian Graphical models (Schafer and Strimmer 2005;Wu et al 2003) deserve attention. Their main advantage is low computational complexity and an ability to capture non-linearity in regulatory functions.…”
Section: Introductionmentioning
confidence: 99%