This tutorial summarises the use of Bayesian analysis and Bayes factors for nding signi cant properties of discrete (categorical and ordinal) data. It overviews methods for nding dependencies and graphical models, latent variables, robust decision trees and association rules.

The graphical password patterns are in the rising trend in world with the abundance of the touch screen devices. A variety of touch screen devices are present for the users such as mobile phones, tables, touch-enabled laptops, touchenabled notebooks, etc. The graphical password has evolved with the invention of the touch-screen devices. The popular graphical schemes known as Pass-Go Pattern, Pa...

Maintaining contents of Web sites is an open and urgent problem on the current World Wide Web as well as on company intra-nets. Although many current tools deal with problems such as broken links and missing images, very few solutions exist for maintaining the contents of Web sites and intra-nets. We present a knowledge-based approach to the verification of Web-page contents. The user exploits ...

The ZX-calculus is a graphical language for quantum processes with built-in rewrite rules. The rewrite rules allow equalities to be derived entirely graphically, leading to the question of completeness: can any equality that is derivable using matrices also be derived graphically? The ZX-calculus is known to be complete for scalar-free pure qubit stabilizer quantum mechanics, meaning any equali...

Objects linking with many other objects in an information network may imply various semantic relationships. Uncovering such knowledge is essential for role discovery, data cleaning, and better organization of information networks, especially when the semantically meaningful relationships are hidden or mingled with noisy links and attributes. In this paper we study a generic form of relationship...

Algebraic graph transformation has been promoted by several authors as a means to specify model transformations. This paper explores how we can specify graph transformation-based rules for a classical problem of transforming from sequence diagrams to state machines. The specification of the transformation rules is based on the concrete syntax of sequence diagrams and state machines. We introduc...