scientific article; zbMATH DE number 1844474

zbMath1001.68565MaRDI QIDQ4784840

José M. Puerta, Luis M. de Campos

Publication date: 12 December 2002

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2143/21430228

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

learningvariable neighborhood searchbelief networksstochastic hill-climbing searchcausal orderings

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Related Items (6)

Learning Bayesian networks by hill climbing: efficient methods based on progressive restriction of the neighborhood ⋮ Ant colony optimization for learning Bayesian networks. ⋮ Structural learning of Bayesian networks using local algorithms based on the space of orderings ⋮ A Fast Hill-Climbing Algorithm for Bayesian Networks Structure Learning ⋮ BNC-PSO: structure learning of Bayesian networks by particle swarm optimization ⋮ Bayesian network learning algorithms using structural restrictions

This page was built for publication: