Abstract
Bayesian Networks (BNs) are versatile probabilistic models applicable to many different biological phenomena. In biological applications the structure of the network is usually unknown and needs to be inferred from experimental data. BNFinder is a fast software implementation of an exact algorithm for finding the optimal structure of the network given a number of experimental observations. Its second version, presented in this article, represents a major improvement over the previous version. The improvements include (i) a parallelized learning algorithm leading to an order of magnitude speed-ups in BN structure learning time; (ii) inclusion of an additional scoring function based on mutual information criteria; (iii) possibility of choosing the resulting network specificity based on statistical criteria and (iv) a new module for classification by BNs, including cross-validation scheme and classifier quality measurements with receiver operator characteristic scores.Availability and implementation: BNFinder2 is implemented in python and freely available under the GNU general public license at the project Web site https://launchpad.net/ bnfinder, together with a user's manual, introductory tutorial and supplementary methods.Contact: or bartek@mimuw.edu.plSupplementary information: Supplementary data are available at Bioinformatics online. © 2013 The Author 2013. Published by Oxford University Press.
Cite
CITATION STYLE
Dojer, N., Bednarz, P., Podsiadło, A., & Wilczyński, B. (2013). BNFinder2: Faster Bayesian network learning and Bayesian classification. Bioinformatics, 29(16), 2068–2070. https://doi.org/10.1093/bioinformatics/btt323
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.