The max-min hill-climbing Bayesian network structure learning algorithm
From MaRDI portal
Publication:851867
DOI10.1007/S10994-006-6889-7zbMATH Open1470.68192OpenAlexW2165190832WikidataQ56221781 ScholiaQ56221781MaRDI QIDQ851867FDOQ851867
Authors: Ioannis Tsamardinos, Laura E. Brown, Constantin F. Aliferis 
Publication date: 22 November 2006
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10994-006-6889-7
Recommendations
- A Fast Hill-Climbing Algorithm for Bayesian Networks Structure Learning
- Efficient and effective Bayesian network local structure learning
- Exact Bayesian structure discovery in Bayesian networks
- Learning Bayesian networks: The combination of knowledge and statistical data
- Who learns better Bayesian network structures: accuracy and speed of structure learning algorithms
Learning and adaptive systems in artificial intelligence (68T05) Probabilistic graphical models (62H22) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Cites Work
- Causation, prediction, and search
- A hybrid methodology for learning belief networks: BENEDICT
- Estimating the dimension of a model
- A new look at the statistical model identification
- On Information and Sufficiency
- A Bayesian method for the induction of probabilistic networks from data
- Learning Bayesian networks: The combination of knowledge and statistical data
- Exact Bayesian structure discovery in Bayesian networks
- Large-sample learning of Bayesian networks is NP-hard
- Title not available (Why is that?)
- 10.1162/153244302760200696
- Probabilistic Networks and Expert Systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Modeling by shortest data description
- Adaptive probabilistic networks with hidden variables
- Learning Bayesian networks from data: An information-theory based approach
- 10.1162/153244303321897717
- An introduction to variational methods for graphical models
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (only showing first 100 items - show all)
- On scoring maximal ancestral graphs with the max-min hill climbing algorithm
- Title not available (Why is that?)
- Learning causal Bayesian networks using minimum free energy principle
- Learning high-dimensional Gaussian linear structural equation models with heterogeneous error variances
- Temporal state change Bayesian networks for modeling of evolving multivariate state sequences: model, structure discovery and parameter estimation
- High-dimensional consistency in score-based and hybrid structure learning
- Incremental causal network construction over event streams
- A review on evolutionary algorithms in Bayesian network learning and inference tasks
- Model distances for vine copulas in high dimensions
- Toward a Multisubject Analysis of Neural Connectivity
- Comparing Score-Based Methods for Estimating Bayesian Networks Using the Kullback–Leibler Divergence
- A conditional independence algorithm for learning undirected graphical models
- Structural learning of Bayesian networks using local algorithms based on the space of orderings
- Structure learning of Bayesian networks by continuous particle swarm optimization algorithms
- Towards scalable and data efficient learning of Markov boundaries
- A focused information criterion for graphical models
- Discovering and orienting the edges connected to a target variable in a DAG via a sequential local learning approach
- Causal learning with Occam's razor
- Partitioned hybrid learning of Bayesian network structures
- Learning Bayesian networks with local structure, mixed variables, and exact algorithms
- \(\mathsf{PenPC}\): a two-step approach to estimate the skeletons of high-dimensional directed acyclic graphs
- Counting Markov equivalence classes for DAG models on trees
- High-dimensional joint estimation of multiple directed Gaussian graphical models
- Efficient and effective Bayesian network local structure learning
- Structural learning for Bayesian networks by testing complete separators in prime blocks
- Causal network reconstruction from time series: From theoretical assumptions to practical estimation
- Exact estimation of multiple directed acyclic graphs
- Structure learning in Bayesian networks using regular vines
- Efficient learning of Bayesian networks with bounded tree-width
- Loglinear model selection and human mobility
- Penalized Estimation of Directed Acyclic Graphs From Discrete Data
- Structural learning of Bayesian networks by bacterial foraging optimization
- BNC-PSO: structure learning of Bayesian networks by particle swarm optimization
- Maximum Likelihood Estimation Over Directed Acyclic Gaussian Graphs
- High-dimensional structure learning of sparse vector autoregressive models using fractional marginal pseudo-likelihood
- Mind change optimal learning of Bayes net structure from dependency and independency data
- Causal structure learning: a combinatorial perspective
- Score-based methods for learning Markov boundaries by searching in constrained spaces
- Identifiability of Gaussian linear structural equation models with homogeneous and heterogeneous error variances
- Swamping and masking in Markov boundary discovery
- Towards fast and efficient algorithm for learning Bayesian network
- A decomposition algorithm for learning Bayesian networks based on scoring function
- A Fast Hill-Climbing Algorithm for Bayesian Networks Structure Learning
- Scaling up the greedy equivalence search algorithm by constraining the search space of equivalence classes
- Scaling up the greedy equivalence search algorithm by constraining the search space of equivalence classes
- Learning Bayesian networks from incomplete data with the node-average likelihood
- Discovering causes and effects of a given node in Bayesian networks
- Efficient identification of independence networks using mutual information
- Causal gene identification using combinatorial V-structure search
- Structural Intervention Distance for Evaluating Causal Graphs
- A hybrid Bayesian network learning method for constructing gene networks
- Learning Bayesian networks by hill climbing: efficient methods based on progressive restriction of the neighborhood
- Inferring large graphs using \(\ell_1\)-penalized likelihood
- Gaussian Bayesian network comparisons with graph ordering unknown
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Learning Gaussian graphical models with fractional marginal pseudo-likelihood
- On the use of meta-heuristic algorithms for automated test suite generation in software testing
- The difficulty of being moral
- The role of local partial independence in learning of Bayesian networks
- Upper-lower bounds candidate sets searching algorithm for Bayesian network structure learning
- Learning Block Structured Graphs in Gaussian Graphical Models
- The dual PC algorithm and the role of Gaussianity for structure learning of Bayesian networks
- Greedy structure learning from data that contain systematic missing values
- A survey on causal discovery: theory and practice
- Effective and efficient structure learning with pruning and model averaging strategies
- Reconstruction of a directed acyclic graph with intervention
- Improving Bayesian network local structure learning via data-driven symmetry correction methods
- Learning causal structure from mixed data with missing values using Gaussian copula models
- Evaluating Product-Based Possibilistic Networks Learning Algorithms
- Nonlinear Causal Discovery with Confounders
- Objective Bayesian Nets for Integrating Consistent Datasets
- Learning directed acyclic graphs by determination of candidate causes for discrete variables
- Risk spillover network structure learning for correlated financial assets: a directed acyclic graph approach
- Quantum approximate optimization algorithm for Bayesian network structure learning
- Title not available (Why is that?)
- Toric ideals of characteristic imsets via quasi-independence gluing
- Nonlinear directed acyclic graph estimation based on the kernel partial correlation coefficient
- Multivariate statistical matching using graphical modeling
- Copula Grow-Shrink Algorithm for Structural Learning
- Causal Structural Learning on MPHIA Individual Dataset
- A ring-based distributed algorithm for learning high-dimensional Bayesian networks
- Causal Structural Learning via Local Graphs
- Analysing organic food buyers' perceptions with Bayesian networks: a case study in Turkey
- Mutual-information-inspired heuristics for constraint-based causal structure learning
- Ensemble framework for causality learning with heterogeneous directed acyclic graphs through the lens of optimization
- Semiparametric Bayesian networks
- Towards Gaussian Bayesian Network Fusion
- Causal deep learning: encouraging impact on real-world problems through causality
- Democraticop: a democratic way of aggregating Bayesian network parameters
- Learning Bayesian network structures using weakest mutual-information-first strategy
- Bayesian networks for sex-related homicides: structure learning and prediction
- Efficient score-based Markov blanket discovery
- Greedy Causal Discovery Is Geometric
- Belief graphical models for uncertainty representation and reasoning
- Inferring gene regulatory networks by an order independent algorithm using incomplete data sets
- Order-Independent Structure Learning of Multivariate Regression Chain Graphs
- Multi-task transfer learning for Bayesian network structures
- A PC algorithm variation for ordinal variables
Uses Software
This page was built for publication: The max-min hill-climbing Bayesian network structure learning algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q851867)
