Learning Bayesian networks by hill climbing: efficient methods based on progressive restriction of the neighborhood

ISSN： 1384-5810

Source： Data Mining and Knowledge Discovery, Vol.22, Iss.1-2, 2011-01, pp. : 106-148

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

The max-min hill-climbing Bayesian network structure learning algorithm

By Tsamardinos Ioannis

Machine Learning, Vol. 65, Iss. 1, 2006-10 ,pp. : 31-78

Springer Publishing Company

Access to resources Recommend Favorite

Inductive transfer for learning Bayesian networks

By Luis Roger Sucar L. Morales Eduardo

Machine Learning, Vol. 79, Iss. 1-2, 2010-05 ,pp. : 227-255

Springer Publishing Company

Access to resources Recommend Favorite

Interactive structural learning of Bayesian networks

By Pyun J.C. Beutel H. Meyer J.-U. Ruf H.H. Sucar L.E. Martnez-Arroyo M.

Expert Systems with Applications, Vol. 15, Iss. 3, 1998-10 ,pp. : 325-332

Elsevier

Access to resources Recommend Favorite

Empirical Evaluation of Hill Climbing Algorithm

International Journal of Applied Metaheuristic Computing (IJAMC), Vol. 8, Iss. 4, 2017-10 ,pp. : 27-40

IGI Global_journal

Access to resources Recommend Favorite

The Sample Complexity of Learning Fixed-Structure Bayesian Networks

By Dasgupta S.

Machine Learning, Vol. 29, Iss. 2-3, 1997-11 ,pp. : 165-180

Springer Publishing Company

Access to resources Recommend Favorite