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

DOI10.1007/978-3-642-22152-1_17zbMATH Open1341.68148OpenAlexW39130988MaRDI QIDQ3011945FDOQ3011945

Authors: Juan I. Alonso-Barba, Luis delaOssa, José A. Gámez, José M. Puerta 

Publication date: 29 June 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22152-1_17

Recommendations

• Scaling up the greedy equivalence search algorithm by constraining the search space of equivalence classes
• 10.1162/153244303321897717
• High-dimensional consistency in score-based and hybrid structure learning
• 10.1162/153244302760200696
• Efficient structure learning of Bayesian networks using constraints

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Bayesian problems; characterization of Bayes procedures (62C10)

Cites Work

• Learning Bayesian networks: The combination of knowledge and statistical data
• Title not available (Why is that?)
• 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
• 10.1162/153244303321897717

Cited In (3)

• 10.1162/153244303321897717
• High-dimensional consistency in score-based and hybrid structure learning
• Scaling up the greedy equivalence search algorithm by constraining the search space of equivalence classes

Uses Software

• Hailfinder

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 Q3011945)