Uncertainty in Artificial Intelligence
First Name   Last Name   Password   Forgot Password   Log in!
    Proceedings   Proceeding details   Article details         Authors         Search    
MESA: Maximum Entropy by Simulated Annealing
Gerhard PaaĆ?
Abstract:
Probabilistic reasoning systems combine different probabilistic rules and probabilistic facts to arrive at the desired probability values of consequences. In this paper we describe the MESA-algorithm (Maximum Entropy by Simulated Annealing) that derives a joint distribution of variables or propositions. It takes into account the reliability of probability values and can resolve conflicts between contradictory statements. The joint distribution is represented in terms of marginal distributions and therefore allows to process large inference networks and to determine desired probability values with high precision. The procedure derives a maximum entropy distribution subject to the given constraints. It can be applied to inference networks of arbitrary topology and may be extended into a number of directions.
Keywords:
Pages: 230-237
PS Link:
PDF Link: /papers/92/p230-paass.pdf
BibTex:
@INPROCEEDINGS{PaaĆ?92,
AUTHOR = "Gerhard PaaĆ? ",
TITLE = "MESA: Maximum Entropy by Simulated Annealing",
BOOKTITLE = "Proceedings of the Eighth Conference Annual Conference on Uncertainty in Artificial Intelligence (UAI-92)",
PUBLISHER = "Morgan Kaufmann",
ADDRESS = "San Mateo, CA",
YEAR = "1992",
PAGES = "230--237"
}


hosted by DSL   •   site info   •   help