Adamcik, Martin (2014) Collective Reasoning under Uncertainty and Inconsistency. Doctoral thesis, Manchester Institute for Mathematical Sciences, The University of Manchester.
![[thumbnail of thesis.pdf]](https://eprints.maths.manchester.ac.uk/style/images/fileicons/application_pdf.png) |
PDF
thesis.pdf Download (1MB) |
Abstract
In this thesis we investigate some global desiderata for probabilistic knowledge merging given several possibly jointly inconsistent, but individually consistent knowledge bases. We show that the most naive methods of merging, which combine applications of a single expert inference process with the application of a pooling operator, fail to satisfy certain basic consistency principles. We therefore adopt a different approach. Following recent developments in machine learning where Bregman divergences appear to be powerful, we define several probabilistic merging operators which minimise the joint divergence between merged knowledge and given knowledge bases. In particular we prove that in many cases the result of applying such operators coincides with the sets of fixed points of averaging projective procedures - procedures which combine knowledge updating with pooling operators of decision theory. We develop relevant results concerning the geometry of Bregman divergences and prove new theorems in this field. We show that this geometry connects nicely with some desirable principles which have arisen in the epistemology of merging. In particular, we prove that the merging operators which we define by means of convex Bregman divergences satisfy analogues of the principles of merging due to Konieczny and Pino-Perez. Additionally, we investigate how such merging operators behave with respect to principles concerning irrelevant information, independence and relativisation which have previously been intensively studied in case of single-expert probabilistic inference. Finally, we argue that two particular probabilistic merging operators which are based on Kullback-Leibler divergence, a special type of Bregman divergence, have overall the most appealing properties amongst merging operators hitherto considered. By investigating some iterative procedures we propose algorithms to practically compute them.
| Item Type: | Thesis (Doctoral) |
|---|---|
| Uncontrolled Keywords: | probabilistic reasoning, probability function, probabilistic merging, Bregman divergence, Kullback-Leibler divergence, principles for merging |
| Subjects: | MSC 2010, the AMS's Mathematics Subject Classification > 03 Mathematical logic and foundations MSC 2010, the AMS's Mathematics Subject Classification > 52 Convex and discrete geometry MSC 2010, the AMS's Mathematics Subject Classification > 91 Game theory, economics, social and behavioral sciences |
| Depositing User: | Mr Martin Adamcik |
| Date Deposited: | 05 Mar 2014 |
| Last Modified: | 20 Oct 2017 14:13 |
| URI: | https://eprints.maths.manchester.ac.uk/id/eprint/2110 |
Actions (login required)
 |
View Item |