Partitioned hybrid learning of Bayesian network structures
From MaRDI portal
Publication:2163218
DOI10.1007/s10994-022-06145-4OpenAlexW3139128274MaRDI QIDQ2163218
Publication date: 10 August 2022
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2103.12188
Bayesian networksdirected acyclic graphsstructure learningdivide-and-conquergreedy searchPC algorithm
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Penalized Estimation of Directed Acyclic Graphs From Discrete Data
- Learning Bayesian networks by hill climbing: efficient methods based on progressive restriction of the neighborhood
- The max-min hill-climbing Bayesian network structure learning algorithm
- Modeling by shortest data description
- Causation, prediction, and search
- Estimating the dimension of a model
- Learning Bayesian networks: The combination of knowledge and statistical data
- High-dimensional consistency in score-based and hybrid structure learning
- Pearson's X 2 and the Loglikelihood Ratio Statistic G 2 : A Comparative Review
- Consistency of Single Linkage for High-Density Clusters
- Mathematical Statistics
- 10.1162/153244302760200696
- 10.1162/153244303321897717
- Learning Sparse Causal Gaussian Networks With Experimental Intervention: Regularization and Coordinate Descent
- A new look at the statistical model identification
This page was built for publication: Partitioned hybrid learning of Bayesian network structures
