A “Microscopic” Study of Minimum Entropy Search in Learning Decomposable Markov Networks

ISSN： 0885-6125

Source： Machine Learning, Vol.26, Iss.1, 1997-01, pp. : 65-92

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

Learning decomposable markov networks in pseudo-independent domains with local evaluation

By Xiang Y. Lee J.

Machine Learning, Vol. 65, Iss. 1, 2006-10 ,pp. : 199-227

Springer Publishing Company

Access to resources Recommend Favorite

Search and learning strategies for improving hidden Markov models

By de Mori R. Galler M. Brugnara F.

Computer Speech & Language, Vol. 9, Iss. 2, 1995-04 ,pp. : 107-121

Academic Press

Access to resources Recommend Favorite

Learning compact Markov logic networks with decision trees

By Khosravi Hassan Schulte Oliver Hu Jianfeng Gao Tianxiang

Machine Learning, Vol. 89, Iss. 3, 2012-12 ,pp. : 257-277

Springer Publishing Company

Access to resources Recommend Favorite

A microscopic study of power management in IEEE 802.11 wireless networks

By Hu Chunyu Zheng Rong Hou Jennifer C. Sha Lui

International Journal of Wireless and Mobile Computing, Vol. 1, Iss. 3-4, 2007-02 ,pp. : 165-178

Inderscience Publishers

Access to resources Recommend Favorite

An efficient top-down search algorithm for learning Boolean networks of gene expression

By Nam Dougu

Machine Learning, Vol. 65, Iss. 1, 2006-10 ,pp. : 229-245

Springer Publishing Company

Access to resources Recommend Favorite