Scaling Up the Greedy Equivalence Search Algorithm by Constraining the Search Space of Equivalence Classes
From MaRDI portal
Publication:3011945
DOI10.1007/978-3-642-22152-1_17zbMath1341.68148MaRDI QIDQ3011945
Luis delaOssa, José A. Gámez, Juan I. Alonso-Barba, 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
62C10: Bayesian problems; characterization of Bayes procedures
68T05: Learning and adaptive systems in artificial intelligence
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Related Items
Uses Software
Cites Work
- Unnamed Item
- 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
- Learning Bayesian networks: The combination of knowledge and statistical data
- 10.1162/153244303321897717