首页 | 本学科首页   官方微博 | 高级检索  
     


Probabilistic Belief Contraction
Authors:Raghav Ramachandran  Arthur Ramer  Abhaya C Nayak
Affiliation:1. Department of Computing, Macquarie University, Sydney, NSW, 2109, Australia
2. School of Computer Science and Engineering, University of New South Wales, Sydney, NSW, 2052, Australia
Abstract:Probabilistic belief contraction has been a much neglected topic in the field of probabilistic reasoning. This is due to the difficulty in establishing a reasonable reversal of the effect of Bayesian conditionalization on a probabilistic distribution. We show that indifferent contraction, a solution proposed by Ramer to this problem through a judicious use of the principle of maximum entropy, is a probabilistic version of a full meet contraction. We then propose variations of indifferent contraction, using both the Shannon entropy measure as well as the Hartley entropy measure, with an aim to avoid excessive loss of beliefs that full meet contraction entails.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号