The max-min hill-climbing Bayesian network structure learning algorithm
From MaRDI portal
Publication:851867
DOI10.1007/s10994-006-6889-7zbMath1470.68192OpenAlexW2165190832WikidataQ56221781 ScholiaQ56221781MaRDI QIDQ851867
Constantin F. Aliferis, Laura E. Brown, Ioannis Tsamardinos
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
Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Probabilistic graphical models (62H22)
Related Items (only showing first 100 items - show all)
Learning causal Bayesian networks using minimum free energy principle ⋮ Mutual-information-inspired heuristics for constraint-based causal structure learning ⋮ Discovering and orienting the edges connected to a target variable in a DAG via a sequential local learning approach ⋮ Learning high-dimensional Gaussian linear structural equation models with heterogeneous error variances ⋮ Gaussian Bayesian network comparisons with graph ordering unknown ⋮ Temporal state change Bayesian networks for modeling of evolving multivariate state sequences: model, structure discovery and parameter estimation ⋮ Identifiability of Gaussian linear structural equation models with homogeneous and heterogeneous error variances ⋮ Bayesian Network Structure Learning with Permutation Tests ⋮ Exact estimation of multiple directed acyclic graphs ⋮ Efficient score-based Markov blanket discovery ⋮ Efficient learning of Bayesian networks with bounded tree-width ⋮ Evaluating Product-Based Possibilistic Networks Learning Algorithms ⋮ Towards Gaussian Bayesian Network Fusion ⋮ Efficient Learning of Quadratic Variance Function Directed Acyclic Graphs via Topological Layers ⋮ Multi-task transfer learning for Bayesian network structures ⋮ Towards fast and efficient algorithm for learning Bayesian network ⋮ Gaussian graphical modeling for spectrometric data analysis ⋮ Hybrid semiparametric Bayesian networks ⋮ Comments on: ``Hybrid semiparametric Bayesian networks ⋮ Structure learning in Bayesian networks using regular vines ⋮ Partitioned hybrid learning of Bayesian network structures ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Estimation of joint directed acyclic graphs with lasso family for gene networks ⋮ Discovering causes and effects of a given node in Bayesian networks ⋮ Objective Bayesian Nets for Integrating Consistent Datasets ⋮ Swamping and masking in Markov boundary discovery ⋮ Learning Bayesian networks by hill climbing: efficient methods based on progressive restriction of the neighborhood ⋮ High-dimensional joint estimation of multiple directed Gaussian graphical models ⋮ Learning directed acyclic graphs by determination of candidate causes for discrete variables ⋮ Structural learning of Bayesian networks using local algorithms based on the space of orderings ⋮ Revising the structure of Bayesian network classifiers in the presence of missing data ⋮ The role of local partial independence in learning of Bayesian networks ⋮ Structural learning of Bayesian networks by bacterial foraging optimization ⋮ Structural learning for Bayesian networks by testing complete separators in prime blocks ⋮ Incremental causal network construction over event streams ⋮ Score-based methods for learning Markov boundaries by searching in constrained spaces ⋮ Streaming feature-based causal structure learning algorithm with symmetrical uncertainty ⋮ Model distances for vine copulas in high dimensions ⋮ Inferring large graphs using \(\ell_1\)-penalized likelihood ⋮ A decomposition algorithm for learning Bayesian networks based on scoring function ⋮ Scaling up the greedy equivalence search algorithm by constraining the search space of equivalence classes ⋮ A Fast Hill-Climbing Algorithm for Bayesian Networks Structure Learning ⋮ Bayesian networks for sex-related homicides: structure learning and prediction ⋮ AMP Chain Graphs: Minimal Separators and Structure Learning Algorithms ⋮ Analysing organic food buyers' perceptions with Bayesian networks: a case study in Turkey ⋮ Reconstruction of a directed acyclic graph with intervention ⋮ Upper-lower bounds candidate sets searching algorithm for Bayesian network structure learning ⋮ A review on evolutionary algorithms in Bayesian network learning and inference tasks ⋮ On scoring maximal ancestral graphs with the max-min hill climbing algorithm ⋮ Inferring gene regulatory networks by an order independent algorithm using incomplete data sets ⋮ Copula Grow-Shrink Algorithm for Structural Learning ⋮ Order-Independent Structure Learning of Multivariate Regression Chain Graphs ⋮ A hybrid Bayesian network learning method for constructing gene networks ⋮ On the use of meta-heuristic algorithms for automated test suite generation in software testing ⋮ The difficulty of being moral ⋮ Multivariate statistical matching using graphical modeling ⋮ A decomposition-based algorithm for learning the structure of multivariate regression chain graphs ⋮ Scaling Up the Greedy Equivalence Search Algorithm by Constraining the Search Space of Equivalence Classes ⋮ Mixture of Markov Trees for Bayesian Network Structure Learning with Small Datasets in High Dimensional Space ⋮ Finding P–Maps and I–Maps to Represent Conditional Independencies ⋮ Unnamed Item ⋮ High-dimensional consistency in score-based and hybrid structure learning ⋮ BNC-PSO: structure learning of Bayesian networks by particle swarm optimization ⋮ Efficient Sampling and Structure Learning of Bayesian Networks ⋮ Learning Gaussian graphical models with fractional marginal pseudo-likelihood ⋮ Counting Markov equivalence classes for DAG models on trees ⋮ Efficient identification of independence networks using mutual information ⋮ Loglinear model selection and human mobility ⋮ A PC algorithm variation for ordinal variables ⋮ Causal learning with Occam's razor ⋮ Evaluation of the diagnostic power of thermography in breast cancer using Bayesian network classifiers ⋮ Unnamed Item ⋮ Causal network reconstruction from time series: From theoretical assumptions to practical estimation ⋮ Towards scalable and data efficient learning of Markov boundaries ⋮ Causal gene identification using combinatorial V-structure search ⋮ Efficient and effective Bayesian network local structure learning ⋮ Penalized Estimation of Directed Acyclic Graphs From Discrete Data ⋮ PenPC : A two-step approach to estimate the skeletons of high-dimensional directed acyclic graphs ⋮ Structure learning of Bayesian networks by continuous particle swarm optimization algorithms ⋮ Maximum Likelihood Estimation Over Directed Acyclic Gaussian Graphs ⋮ Marginal information for structure learning ⋮ Learning Bayesian network structures using weakest mutual-information-first strategy ⋮ Learning Bayesian networks with local structure, mixed variables, and exact algorithms ⋮ Who learns better Bayesian network structures: accuracy and speed of structure learning algorithms ⋮ High-dimensional structure learning of sparse vector autoregressive models using fractional marginal pseudo-likelihood ⋮ Learning Bayesian networks from incomplete data with the node-average likelihood ⋮ A Bayesian hierarchical score for structure learning from related data sets ⋮ Bayesian network structural learning from complex survey data: a resampling based approach ⋮ Unnamed Item ⋮ 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 ⋮ Learning Bayesian networks from big data with greedy search: computational complexity and efficient implementation ⋮ A conditional independence algorithm for learning undirected graphical models ⋮ Mind change optimal learning of Bayes net structure from dependency and independency data ⋮ 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 ⋮ Quantum approximate optimization algorithm for Bayesian network structure learning ⋮ Democraticop: a democratic way of aggregating Bayesian network parameters
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Modeling by shortest data description
- Causation, prediction, and search
- A Bayesian method for the induction of probabilistic networks from data
- Estimating the dimension of a model
- Adaptive probabilistic networks with hidden variables
- Learning Bayesian networks from data: An information-theory based approach
- Learning Bayesian networks: The combination of knowledge and statistical data
- An introduction to variational methods for graphical models
- Probabilistic Networks and Expert Systems
- 10.1162/153244302760200696
- 10.1162/153244303321897717
- On Information and Sufficiency
- A hybrid methodology for learning belief networks: BENEDICT
- A new look at the statistical model identification
This page was built for publication: The max-min hill-climbing Bayesian network structure learning algorithm