Let I = {i1, · · · , im} be a set of items. Let S be a stream of transactions in a sequential order, where each transaction is a subset of I. For an itemset X, which is a subset of I, a transaction T in S is said to contain the itemset X if X ⊆ T . The support of X is defined as the fraction of transactions in S that contain X. For a given support threshold s, X is frequent if the support of X ...

Effective methods for model structure selection are very important for data-driven modelling. A new approach based on association rule mining is developed where a correlation factor is be used to determine the most interesting model structures. The general applicability and efficiently of the developed tool are showed by two application examples.

In this paper problem of mining data with weights and finding association rules is presented. Some applications are discussed, especially focused on financial data. Solutions of the problem are analyzed. A few approaches are proposed and compared. Pruning based on measures of rules interestingness is described and some measures proposed in literature are shown. Influence of data weights on thes...

......................................................................................................................... iii Acknowledgements ....................................................................................................... iv Dedication....................................................................................................................... v List of Tables ...

This paper describes an approach to product recommendation that combines in a novel way contentand collaborative-based filtering techniques. The system helps the user to specify a query that filters out unwanted products in electronic catalogues (content-based). Moreover, if the query produces too many or no results, the system suggests useful query changes that save the gist of the original re...

With an eye towards the development of systems for common everyday tasks — that operate in a manner that is cognitively-compatible with the argumentative nature of human reasoning — we present mechanisms for reasoning with and learning cognitive programs: common sense, symbolically represented in the form of prioritized association rules. The FLASH mechanism supports a fast argumentation-flavor...

In this paper we introduce distribution rules, a kind of association rules with a distribution on the consequent. Distribution rules are related to quantitative association rules but can be seen as a more fundamental concept, useful for learning distributions. We formalize the main concepts and indicate applications to tasks such as frequent pattern discovery, sub group discovery and forecastin...