Scaling up the greedy equivalence search algorithm by constraining the search space of equivalence classes
From MaRDI portal
Publication:1951294
Recommendations
- Scaling up the greedy equivalence search algorithm by constraining the search space of equivalence classes
- scientific article; zbMATH DE number 1339958
- scientific article; zbMATH DE number 915318
- A class of greedy algorithms and its relation to greedoids
- Greedy algorithm compatibility and heavy-set structures
- Exact and Approximation Algorithms for the Expanding Search Problem
- An efficient algorithm for a class of equality-constrained optimization problems
- Faster scaling algorithms for general graph matching problems
Cites work
- scientific article; zbMATH DE number 1946873 (Why is no real title available?)
- 10.1162/153244303321897717
- A geometric view on learning Bayesian network structures
- A scoring function for learning Bayesian networks based on mutual information and conditional independence tests
- Adaptive probabilistic networks with hidden variables
- Ant colony optimization for learning Bayesian networks.
- Bayesian Networks and Decision Graphs
- Causation, prediction, and search
- Characteristic imsets for learning Bayesian network structure
- Estimating the dimension of a model
- Learning Bayesian networks by hill climbing: efficient methods based on progressive restriction of the neighborhood
- Learning Bayesian networks in the space of structures by estimation of distribution algorithms
- Learning Bayesian networks: The combination of knowledge and statistical data
- On open questions in the geometric approach to structural learning Bayesian nets
- Scaling up the greedy equivalence search algorithm by constraining the search space of equivalence classes
- The max-min hill-climbing Bayesian network structure learning algorithm
Cited in
(9)- A survey on causal discovery: theory and practice
- 10.1162/153244303321897717
- High-dimensional consistency in score-based and hybrid structure learning
- A ring-based distributed algorithm for learning high-dimensional Bayesian networks
- Distributed fusion-based algorithms for learning high-dimensional Bayesian networks: testing ring and star topologies
- FedGES: a federated learning approach for Bayesian network structure learning
- Causal structure learning: a combinatorial perspective
- SELF-Tree: an interpretable model for multivariate causal direction heterogeneity analysis
- Scaling up the greedy equivalence search algorithm by constraining the search space of equivalence classes
This page was built for publication: Scaling up the greedy equivalence search algorithm by constraining the search space of equivalence classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1951294)
