It is no pure coincidence that an organic chemist rather than a computer specialist is writing this foreword.

Finite chase, or alternatively chase termination, is an important condition to ensure the decidability of existential rule languages. In the past few years, a number of rule languages with finite chase have been studied. In this work, we propose a novel approach for classifying the rule languages with finite chase. Using this approach, a family of decidable rule languages, which extend the existing languages with the finite chase property, are naturally defined. We then study the complexity of these languages. Although all of them are tractable for data complexity, we show that their combined complexity can be arbitrarily high. Furthermore, we prove that all the rule languages with finite chase that extend the weakly acyclic language are of the same expressiveness as the weakly acyclic one, while rule languages with higher combined complexity are in general more succinct than those with lower combined complexity.

The need for health providers to share information is a pressing need in our ever more connected world. A patient's health information should seamlessly flow from labs to hospitals to primary care offices. To address this need, in this paper we present the Health E-Match, which focuses on the matching health terms in support of semantic interoperability. Health E-Match determines the semantic similarity between data items, realizing, for instance, that "BHGC (UR)" and "BETA-HCG (QUAL)" both refer to the same pregnancy test, known as "Beta human chorionic gonadotropin, urine qualitative." Our approach is grounded in probabilistic machine learning, and leverages several sophisticated methods for comparing the similarity between medical data items beyond simple edit distance. We present two large scale, real-world experiments to verify that our approach is both accurate and has the ability to eventually be "universal" in that models trained on one set of data translate to strong performance on data from a completely different provider.

Tree ensembles such as random forests and boosted trees are accurate but difficult to understand, debug and deploy. In this work, we provide the inTrees (interpretable trees) framework that extracts, measures, prunes and selects rules from a tree ensemble, and calculates frequent variable interactions. An rule-based learner, referred to as the simplified tree ensemble learner (STEL), can also be formed and used for future prediction. The inTrees framework can applied to both classification and regression problems, and is applicable to many types of tree ensembles, e.g., random forests, regularized random forests, and boosted trees. We implemented the inTrees algorithms in the "inTrees" R package.

We explore the structure of non-redundant and minimal sets consisting of graded if-then rules. The rules serve as graded attribute implications in object-attribute incidence data and as similarity-based functional dependencies in a similarity-based generalization of the relational model of data. Based on our observations, we derive a polynomial-time algorithm which transforms a given finite set of rules into an equivalent one which has the least size in terms of the number of rules.

Today, people benefit from utilizing data mining technologies, such as association rule mining methods, to find valuable knowledge residing in a large amount of data. However, they also face the risk of exposing sensitive or confidential information, when data is shared among different organizations. Thus, a question arise: how can we prevent that sensitive knowledge is discovered, while ensuring that ordinary non-sensitive knowledge can be mined to the maximum extent possible. In this paper, we address the problem of privacy preserving in association rule mining from the perspective of multi-objective optimization. A new hiding method based evolutionary multi-objective optimization (EMO) is proposed and the side effects generated by the hiding process are formulated as optimization goals. EMO is used to find candidate transactions to modify so that side effects are minimized. Comparative experiments with exact methods on real datasets demonstrated that the proposed method can hide sensitive rules with fewer side effects.

This paper presents a planning technique in which a flawed set of reactive rules is used to guide a stochastic forward-chaining search. A planner based on this technique is shown to perform well on Blocks World problems. But the attraction of the technique is not only its high performance as a straight planner, but also its anytime capability. Using a more dynamic domain, the performance of a resource-bounded version of the planner is shown to degrade gracefully as computational resources are reduced.

Cause-effect relations are an important part of human knowledge. In real life, humans often reason about complex causes linked to complex effects. By comparison, existing formalisms for representing knowledge about causal relations are quite limited in the kind of specifications of causes and effects they allow. In this paper, we present the new language C-Log, which offers a significantly more expressive representation of effects, including such features as the creation of new objects. We show how C-Log integrates with first-order logic, resulting in the language FO(C). We also compare FO(C) with several related languages and paradigms, including inductive definitions, disjunctive logic programming, business rules and extensions of Datalog.

The increasing demand of world wide web raises the need of predicting the user's web page request.The most widely used approach to predict the web pages is the pattern discovery process of Web usage mining. This process involves inevitability of many techniques like Markov model, association rules and clustering. Fuzzy theory with different techniques has been introduced for the better results. Our focus is on Markov models. This paper is introducing the vague Rules with Markov models for more accuracy using the vague set theory.

Learning rules is a common way of extracting usefulinformation from knowledge or data bases. Many ofsuch data sets contain numerical attributes. However,approaches like ILP or association rule mining are optimizedfor data with categorical values, and consideringnumerical attributes is expensive. In this paper,we present an extension to the top-down ILP algorithm,which enables an efficient discovery of datalogrules from data with both numerical and categorical attributes.Our approach comprises a preprocessing phasefor computing the correlations between numerical andcategorical attributes, as well as an extension to the ILPrefinement step, which enables us to detect interestingcandidate rules and to suggest refinements with relevantattribute combinations. We report on experiments withU.S. Census data, Freebase and DBpedia, and show thatour approach helps to efficiently discover rules with numericalintervals.