Maximum Entropy and Variable Strength Defaults
Abstract
A new algorithm for computing the maximum entropy ranking over models is presented. The algorithm handles arbitrary sets of propositional defaults with associated strength assignments and succeeds whenever the set satisfies a robustness condition. Failure of this condition implies the problem may not be sufficiently specified for a unique solution to exist. This work extends the applicability of the maximum entropy approach detailed in [ Goldszmidt et al., 1993 ] , and clarifies the assumptions on which the method is based. 1
Cite
Text
Bourne and Parsons. "Maximum Entropy and Variable Strength Defaults." International Joint Conference on Artificial Intelligence, 1999.Markdown
[Bourne and Parsons. "Maximum Entropy and Variable Strength Defaults." International Joint Conference on Artificial Intelligence, 1999.](https://mlanthology.org/ijcai/1999/bourne1999ijcai-maximum/)BibTeX
@inproceedings{bourne1999ijcai-maximum,
title = {{Maximum Entropy and Variable Strength Defaults}},
author = {Bourne, Rachel A. and Parsons, Simon},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {1999},
pages = {50-55},
url = {https://mlanthology.org/ijcai/1999/bourne1999ijcai-maximum/}
}