Scaling up the greedy equivalence search algorithm by constraining the search space of equivalence classes

DOI10.1016/j.ijar.2012.09.004zbMath1264.68123MaRDI QIDQ1951294

Luis delaOssa, José A. Gámez, Juan I. Alonso-Barba, 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

zbMATH Keywords

Bayesian networks; constrained search; greedy equivalence search

Mathematics Subject Classification ID

68T05: Learning and adaptive systems in artificial intelligence

68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)

Related Items

Causal structure learning: a combinatorial perspective, High-dimensional consistency in score-based and hybrid structure learning, A survey on causal discovery: theory and practice

Uses Software

• TETRAD
• Hailfinder

Cites Work

• Unnamed Item
• Unnamed Item
• Learning Bayesian networks by hill climbing: efficient methods based on progressive restriction of the neighborhood
• On open questions in the geometric approach to structural learning Bayesian nets
• The max-min hill-climbing Bayesian network structure learning algorithm
• A geometric view on learning Bayesian network structures
• Causation, prediction, and search
• Estimating the dimension of a model
• Adaptive probabilistic networks with hidden variables
• Ant colony optimization for learning Bayesian networks.
• Learning Bayesian networks: The combination of knowledge and statistical data
• Characteristic imsets for learning Bayesian network structure
• Scaling Up the Greedy Equivalence Search Algorithm by Constraining the Search Space of Equivalence Classes
• Bayesian Networks and Decision Graphs
• Learning Bayesian networks in the space of structures by estimation of distribution algorithms
• 10.1162/153244303321897717