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

Author： Tsamardinos Ioannis  

Publisher： Springer Publishing Company

ISSN： 0885-6125

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

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

A simple and effective algorithm for the MaxMin diversity problem

By Porumbel Daniel   Hao Jin-Kao   Glover Fred  

Annals of Operations Research, Vol. 186, Iss. 1, 2011-06 ,pp. : 275-293

Springer Publishing Company

Access to resources Recommend Favorite

Max-min ant system algorithm for dartboard design

By Vlachos Aristidis   Trichas Ioannis  

International Journal of Computational Intelligence Studies, Vol. 2, Iss. 3-4, 2013-11 ,pp. : 367-378

Inderscience Publishers

Access to resources Recommend Favorite

Empirical Evaluation of Hill Climbing Algorithm

By  

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

IGI Global_journal

Access to resources Recommend Favorite

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

By Gámez José  

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

Springer Publishing Company

Access to resources Recommend Favorite

INVESTIGATION OF THE K2 ALGORITHM IN LEARNING BAYESIAN NETWORK CLASSIFIERS

By Lerner Boaz   Malka* Roy  

Applied Artificial Intelligence, Vol. 25, Iss. 1, 2011-01 ,pp. : 74-96

Taylor & Francis Ltd

Access to resources Recommend Favorite