Utilizing Data and Knowledge Mining for Probabilistic Knowledge Bases

Problems can arise whenever inferencing is attempted on a knowledge base that is incomplete. Our work shows that data mining techniques can be applied to fill in incomplete areas in Bayesian Knowledge Bases (BKBs), as well as in other knowledge-based systems utilizing probabilistic representations. The problem of inconsistency in BKBs has been addressed in previous work, where reinforcement learning techniques from neural networks were applied. However, the issue of automatically solving incompleteness in BKBs has yet to be addressed. Presently, incompleteness in BKBs is repaired through the application of traditional knowledge acquisition techniques. We show how association rules can be extracted from databases in order to replace excluded information and express missing relationships. A methodology for incorporating those results while maintaining a consistent knowledge base is also included

Bayesian robot Programming

We propose a new method to program robots based on Bayesian inference and learning. The capacities of this programming method are demonstrated through a succession of increasingly complex experiments. Starting from the learning of simple reactive behaviors, we present instances of behavior combinations, sensor fusion, hierarchical behavior composition, situation recognition and temporal sequencing. This series of experiments comprises the steps in the incremental development of a complex robot program. The advantages and drawbacks of this approach are discussed along with these different experiments and summed up as a conclusion. These different robotics programs may be seen as an illustration of probabilistic programming applicable whenever one must deal with problems based on uncertain or incomplete knowledge. The scope of possible applications is obviously much broader than robotics

Bayesian Theory of Games: A Statistical Decision Theoretic Based Analysis of Strategic Interactions

Bayesian rational prior equilibrium requires agent to make rational statistical predictions and decisions, starting with first order non informative prior and keeps updating with statistical decision theoretic and game theoretic reasoning until a convergence of conjectures is achieved. The main difference between the Bayesian theory of games and the current games theory are: I. It analyzes a larger set of games, including noisy games, games with unstable equilibrium and games with double or multiple sided incomplete information games which are not analyzed or hardly analyzed under the current games theory. II. For the set of games analyzed by the current games theory, it generates far fewer equilibria and normally generates only a unique equilibrium and therefore functions as an equilibrium selection and deletion criterion and, selects the most common sensible and statistically sound equilibrium among equilibria and eliminates insensible and statistically unsound equilibria. III. It differentiates between simultaneous move and imperfect information. The Bayesian theory of games treats sequential move with imperfect information as a special case of sequential move with observational noise term. When the variance of the noise term approaches its maximum such that the observation contains no informational value, there is imperfect information (with sequential move). IV. It treats games with complete and perfect information as special cases of games with incomplete information and noisy observation whereby the variance of the prior distribution function on type and the variance of the observation noise term tend to zero. Consequently, there is the issue of indeterminacy in statistical inference and decision making in these games as the equilibrium solution depends on which variances tends to zero first. It therefore identifies equilibriums in these games that have so far eluded the classical theory of games.Games Theory, Bayesian Statistical Decision Theory, Prior Distribution Function, Conjectures, Subjective Probabilities

Quantifying Uncertainty in High Dimensional Inverse Problems by Convex Optimisation

Inverse problems play a key role in modern image/signal processing methods. However, since they are generally ill-conditioned or ill-posed due to lack of observations, their solutions may have significant intrinsic uncertainty. Analysing and quantifying this uncertainty is very challenging, particularly in high-dimensional problems and problems with non-smooth objective functionals (e.g. sparsity-promoting priors). In this article, a series of strategies to visualise this uncertainty are presented, e.g. highest posterior density credible regions, and local credible intervals (cf. error bars) for individual pixels and superpixels. Our methods support non-smooth priors for inverse problems and can be scaled to high-dimensional settings. Moreover, we present strategies to automatically set regularisation parameters so that the proposed uncertainty quantification (UQ) strategies become much easier to use. Also, different kinds of dictionaries (complete and over-complete) are used to represent the image/signal and their performance in the proposed UQ methodology is investigated.Comment: 5 pages, 5 figure

A Case-Based Reasoning Method for Locating Evidence During Digital Forensic Device Triage

The role of triage in digital forensics is disputed, with some practitioners questioning its reliability for identifying evidential data. Although successfully implemented in the field of medicine, triage has not established itself to the same degree in digital forensics. This article presents a novel approach to triage for digital forensics. Case-Based Reasoning Forensic Triager (CBR-FT) is a method for collecting and reusing past digital forensic investigation information in order to highlight likely evidential areas on a suspect operating system, thereby helping an investigator to decide where to search for evidence. The CBR-FT framework is discussed and the results of twenty test triage examinations are presented. CBR-FT has been shown to be a more effective method of triage when compared to a practitioner using a leading commercial application