Inferring gene regulatory networks by an order independent algorithm using incomplete data sets
From MaRDI portal
Publication:5138048
DOI10.1080/02664763.2015.1079307OpenAlexW2224647981WikidataQ106137863 ScholiaQ106137863MaRDI QIDQ5138048
P. Niloofar, Rosa Aghdam, Changiz Eslahchi, Mojtaba Ganjali
Publication date: 3 December 2020
Published in: Journal of Applied Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02664763.2015.1079307
Bayesian networksPC algorithmmissing value imputationMIT scoreinferring the structure of gene regulatory networksmutual information test
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Learning high-dimensional directed acyclic graphs with latent and selection variables
- The max-min hill-climbing Bayesian network structure learning algorithm
- Causal inference in statistics: an overview
- Estimating high-dimensional intervention effects from observational data
- Causation, prediction, and search
- A Bayesian method for the induction of probabilistic networks from data
- Estimating the dimension of a model
- A characterization of Markov equivalence classes for acyclic digraphs
- Learning Bayesian networks: The combination of knowledge and statistical data
- On the completeness of orientation rules for causal discovery in the presence of latent confounders and selection bias
- Learning parameters of Bayesian networks from incomplete data via importance sampling
- A mutual information-basedk-sample test for discrete distributions
- Statistical Distributions
- Bayesian model averaging and model selection for markov equivalence classes of acyclic digraphs
- A Fast Hill-Climbing Algorithm for Bayesian Networks Structure Learning
- Entropy expressions and their estimators for multivariate distributions
- Inference and missing data
- A new multivariate imputation method based on Bayesian networks
- Bayesian Networks for Imputation
- Approximating discrete probability distributions with dependence trees
- A hybrid methodology for learning belief networks: BENEDICT
- Robust learning with missing data
- A new look at the statistical model identification