Scaling up the greedy equivalence search algorithm by constraining the search space of equivalence classes
DOI10.1016/J.IJAR.2012.09.004zbMATH Open1264.68123OpenAlexW2028133264MaRDI QIDQ1951294FDOQ1951294
Authors: Juan I. Alonso-Barba, Luis delaOssa, José A. Gámez, José M. Puerta 
Publication date: 4 June 2013
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ijar.2012.09.004
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
Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Cites Work
- Causation, prediction, and search
- Estimating the dimension of a model
- Learning Bayesian networks: The combination of knowledge and statistical data
- The max-min hill-climbing Bayesian network structure learning algorithm
- Learning Bayesian networks by hill climbing: efficient methods based on progressive restriction of the neighborhood
- Bayesian Networks and Decision Graphs
- Title not available (Why is that?)
- Adaptive probabilistic networks with hidden variables
- 10.1162/153244303321897717
- A scoring function for learning Bayesian networks based on mutual information and conditional independence tests
- On open questions in the geometric approach to structural learning Bayesian nets
- Ant colony optimization for learning Bayesian networks.
- Learning Bayesian networks in the space of structures by estimation of distribution algorithms
- A geometric view on learning Bayesian network structures
- Characteristic imsets for learning Bayesian network structure
- Scaling up the greedy equivalence search algorithm by constraining the search space of equivalence classes
Cited In (6)
- 10.1162/153244303321897717
- A survey on causal discovery: theory and practice
- High-dimensional consistency in score-based and hybrid structure learning
- A ring-based distributed algorithm for learning high-dimensional Bayesian networks
- Causal structure learning: a combinatorial perspective
- Scaling up the greedy equivalence search algorithm by constraining the search space of equivalence classes
Uses Software
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)
