Large-sample learning of Bayesian networks is NP-hard
From MaRDI portal
(Redirected from Publication:3093225)
Recommendations
- Learning Bayesian Networks Does Not Have to Be NP-Hard
- Learning Bayesian networks from big data with greedy search: computational complexity and efficient implementation
- Parameterized complexity results for exact Bayesian network structure learning
- Exact Bayesian structure discovery in Bayesian networks
- Learning Bayesian networks: The combination of knowledge and statistical data
Cited in
(70)- Minimal separators in dependency structures: properties and identification
- Mind change optimal learning of Bayes net structure from dependency and independency data
- The sample complexity of learning fixed-structure Bayesian networks
- Scalability of the Bayesian optimization algorithm.
- Approximate structure learning for large Bayesian networks
- Predicting pediatric clinic no-shows: a decision analytic framework using elastic net and Bayesian belief network
- Entropy-based pruning for learning Bayesian networks using BIC
- An efficient Bayesian network structure learning strategy
- Hybrid learning of Bayesian multinets for binary classification
- Labeled directed acyclic graphs: a generalization of context-specific independence in directed graphical models
- Causal inference in biomolecular pathways using a Bayesian network approach and an implicit method
- The difficulty of being moral
- BNC-PSO: structure learning of Bayesian networks by particle swarm optimization
- Network modeling in biology: statistical methods for gene and brain networks
- Counterfactual inference with latent variable and its application in mental health care
- Partitioned hybrid learning of Bayesian network structures
- Streaming feature-based causal structure learning algorithm with symmetrical uncertainty
- Who learns better Bayesian network structures: accuracy and speed of structure learning algorithms
- Sum-product graphical models
- Improving Bayesian network local structure learning via data-driven symmetry correction methods
- Learning Bayesian networks from big data with greedy search: computational complexity and efficient implementation
- Structure learning of Bayesian networks using global optimization with applications in data classification
- A review on evolutionary algorithms in Bayesian network learning and inference tasks
- On the incompatibility of faithfulness and monotone DAG faithfulness
- Fast learning of relational dependency networks
- Graphical modeling of stochastic processes driven by correlated noise
- PercolationDF: a percolation-based medical diagnosis framework
- Estimating Bayesian networks for high-dimensional data with complex mean structure and random effects
- Efficient approximation of the conditional relative entropy with applications to discriminative learning of Bayesian network classifiers
- Learning a flexible \(K\)-dependence Bayesian classifier from the chain rule of joint probability distribution
- Exact Bayesian structure discovery in Bayesian networks
- Learning factor graphs in polynomial time and sample complexity
- Linkage Learning Accuracy in the Bayesian Optimization Algorithm
- The Complexity of Distinguishing Markov Random Fields
- scientific article; zbMATH DE number 1753154 (Why is no real title available?)
- Learning continuous time Bayesian network classifiers
- 10.1162/jmlr.2003.3.4-5.709
- Parameterized complexity results for exact Bayesian network structure learning
- scientific article; zbMATH DE number 7626781 (Why is no real title available?)
- Learning Bayesian Networks Under Sparsity Constraints: A Parameterized Complexity Analysis
- Learning big Gaussian Bayesian networks: partition, estimation and fusion
- Discrete Bayesian network classifiers: a survey
- Data based identification and prediction of nonlinear and complex dynamical systems
- Parent Assignment Is Hard for the MDL, AIC, and NML Costs
- Learning the naive Bayes classifier with optimization models
- Mind Change Optimal Learning of Bayes Net Structure
- Learning Bayesian Networks Does Not Have to Be NP-Hard
- Bayesian network models for incomplete and dynamic data
- Complexity analysis of Bayesian learning of high-dimensional DAG models and their equivalence classes
- The dual PC algorithm and the role of Gaussianity for structure learning of Bayesian networks
- Spectral Bayesian network theory
- Structural learning of mixed noisy-or Bayesian networks
- Learning the structure of Bayesian networks with ancestral and/or heuristic partition
- Fault trees from data: efficient learning with an evolutionary algorithm
- Combinatorial and algebraic perspectives on the marginal independence structure of Bayesian networks
- A ring-based distributed algorithm for learning high-dimensional Bayesian networks
- Testing Directed Acyclic Graph via Structural, Supervised and Generative Adversarial Learning
- A Bayesian approach for learning Bayesian network structures
- FedGES: a federated learning approach for Bayesian network structure learning
- Learning causal graphs using variable grouping according to ancestral relationship
- Bayesian network structure learning based on topological order and penalty likelihood
- Recursive causal discovery
- Gradient-based causal discovery with latent variables
- Learning bounded-degree polytrees with known skeleton
- Distributed fusion-based algorithms for learning high-dimensional Bayesian networks: testing ring and star topologies
- A sparse conditional Gaussian graphical model for analysis of genetical genomics data
- The max-min hill-climbing Bayesian network structure learning algorithm
- Inference of structures of models of probabilistic dependences from statistical data
- Learning failure-free PRISM programs
- Incremental causal network construction over event streams
This page was built for publication: Large-sample learning of Bayesian networks is NP-hard
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3093225)
