Generation of dynamic Bayesian networks

DW David Wilkins
XT Xinzhao Tong
ML Marcus H. Y. Leung
CM Christopher E. Mason
PL Patrick K. H. Lee
request Request a Protocol
ask Ask a question
Favorite

Dynamic Bayesian networks (DBNs) were constructed to analyse the major routes of dispersal between the different types of sites in this study. Following the method of Lax et al. [13], species relative abundances within each sample were aggregated at the family level and log2-transformed. A total of 472 DBNs were generated, with each network representing one combination of location and taxonomic family. Each candidate network had six nodes, representing the six sites sampled in this study. Bayesian network inference with Java Objects (‘Banjo,’ https://users.cs.duke.edu/~amink/software/banjo/) was used to generate the networks with the following settings: no restrictions on network structure (i.e. no forbidden or mandatory edges); i5 discretisation policy; ‘Greedy’ searcher; ‘AllLocalMoves’ proposer; default evaluator and decider; minimum, maximum and mandatory Markov lags of 1 (i.e. all edges representing a single time-point increment); maximum parent count of 5 (the practical maximum in a network with 6 nodes); default stopping and simulated annealing criteria for a dynamic network.

Do you have any questions about this protocol?

Post your question to gather feedback from the community. We will also invite the authors of this article to respond.

0/150

tip Tips for asking effective questions

+ Description

Write a detailed description. Include all information that will help others answer your question including experimental processes, conditions, and relevant images.

post Post a Question
0 Q&A