Temporary registration page before publication by Linköping University Electronic Press, series Computer and Information Science
The following article is intended to be published shortly by Linköping University Electronic Press. The present page gives access to the article, but does not provide the guarantees of persistence.

Maximising Entropy Efficiently.

Title:Maximising Entropy Efficiently.
Authors: Jon Williamson
Series:Linköping Electronic Articles in Computer and Information Science
ISSN 1401-9841
Issue:Vol. 7(2002): nr 023
URL: http://www.ep.liu.se/ea/cis/2002/023/

Abstract: Determining a prior probability function via the maximum entropy principle can be a computationally intractable task. However one can easily determine - in advance of entropy maximisation - a list of conditional independencies that the maximum entropy function will satisfy. These independencies can be used to reduce the complexity of the entropy maximisation task. In particular, one can use these independencies to construct a direct acyclic graph in a Bayesian network, and then maximise entropy with respect to the numerical parameters of this network. This can result in an efficient representation of a prior probability function, and one that may allow efficient updating and marginalisation. Furthermore this simplification of the entropy maximisation task may be exploited to construct a proof theory for probabilistic logic.

Intended publication
Postscript Checksum
Info from authors  
Third-party information  

[About LiEP] [About Checksum validation] [About compression formats]

Editor-in-chief: editor@ep.liu.se
Webmaster: webmaster@ep.liu.se