Many studies have shown the limits of support/confidence framework used in Apriori-like algorithms to mine association rules. There are a lot of efficient implementations based on the antimonotony property of the support but candidate set generation is still costly. In addition many rules are uninteresting or redundant and one can miss interesting rules like nuggets. One solution is to get rid ...

Recent studies emerged the need for representations of frequent itemsets that allow to estimate supports. Several methods have been proposed that achieve this goal by generating only a subset of all frequent itemsets. In this paper, we propose another approach, that given a minimum support threshold, stores only a small portion of the original database from which the supports of frequent itemse...

The aim of this paper is to provide a crystal clear insight into the true semantics of the measures of support and confidence that are used to assess rule quality in fuzzy association rule mining. To achieve this, we rely on two important pillars: the identification of transactions in a database as positive or negative examples of a given association between attributes, and the correspondence b...

We investigate ways to support interactive mining sessions, in the setting of association rule mining. In such sessions, users specify conditions (queries) on the associations to be generated. Our approach is a combination of the integration of querying conditions inside the mining phase, and the incremental querying of already generated associations. We present several concrete algorithms and ...

We analyze algorithms that, under the right circumstances, permit efficient mining for frequent itemsets in data with tall peaks (large frequent itemsets). We develop a family of level-by-level peak-jumping algorithms, and study them using a simple probability model. The analysis clarifies why the jumping idea sometimes works well, and which properties the data needs to have for this to be the ...

_____________________________________________________________ iii Dedication ____________________________________________________________ iv Acknowledgments _______________________________________________________ v Table of

This work extends fuzzy inference-grams (fingrams) to fuzzy association rules (FAR), yielding FARFingrams. Their analysis pays attention to interpretability issues. An important open problem in association rule mining is the huge number of frequent itemsets and interesting rules to uncover and communicate to the user. FAR-Fingrams address such problem through visual analysis. They ease the sele...

We study a new method for improving the classification accuracy of a model composed of classification association rules (CAR). The method consists in reordering the original set of rules according to the error rates obtained on a set of training examples. This is done iteratively, starting from the original set of rules. After obtaining N models these are used as an ensemble for classifying new...