Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic reasoning in intelligent systems: networks of plausible inference
Sparse graphical models for exploring gene expression data
Journal of Multivariate Analysis
Probabilistic Conditional Independence Structures: With 42 Illustrations (Information Science and Statistics)
A Robust Procedure For Gaussian Graphical Model Search From Microarray Data With p Larger Than n
The Journal of Machine Learning Research
Estimating High-Dimensional Directed Acyclic Graphs with the PC-Algorithm
The Journal of Machine Learning Research
Towards scalable and data efficient learning of Markov boundaries
International Journal of Approximate Reasoning
Graphical Models in Applied Multivariate Statistics
Graphical Models in Applied Multivariate Statistics
Strong completeness and faithfulness in Bayesian networks
UAI'95 Proceedings of the Eleventh conference on Uncertainty in artificial intelligence
Bounding the false discovery rate in local Bayesian network learning
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
Efficient Markov network structure discovery using independence tests
Journal of Artificial Intelligence Research
An efficient and scalable algorithm for local Bayesian network structure discovery
ECML PKDD'10 Proceedings of the 2010 European conference on Machine learning and knowledge discovery in databases: Part III
Analysis of nasopharyngeal carcinoma risk factors with Bayesian networks
Artificial Intelligence in Medicine
An experimental comparison of hybrid algorithms for bayesian network structure learning
ECML PKDD'12 Proceedings of the 2012 European conference on Machine Learning and Knowledge Discovery in Databases - Volume Part I
Learning the local Bayesian network structure around the ZNF217 oncogene in breast tumours
Computers in Biology and Medicine
Hi-index | 0.00 |
In many cases what matters is not whether a false discovery is made or not but the expected proportion of false discoveries among all the discoveries made, i.e. the so-called false discovery rate (FDR). We present an algorithm aiming at controlling the FDR of edges when learning Gaussian graphical models (GGMs). The algorithm is particularly suitable when dealing with more nodes than samples, e.g. when learning GGMs of gene networks from gene expression data.We illustrate this on the Rosetta compendium [8].