Association rule mining and itemset-correlation based variants

07/22/2019
by   Niels Mündler, et al.
0

Association rules express implication formed relations among attributes in databases of itemsets. The apriori algorithm is presented, the basis for most association rule mining algorithms. It works by pruning away rules that need not be evaluated based on the user specified minimum support confidence. Additionally, variations of the algorithm are presented that enable it to handle quantitative attributes and to extract rules about generalizations of items, but preserve the downward closure property that enables pruning. Intertransformation of the extensions is proposed for special cases.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/28/2017

Quantitative CBA: Small and Comprehensible Association Rule Classification Models

Quantitative CBA is a postprocessing algorithm for association rule clas...
research
04/18/2018

A Parallel/Distributed Algorithmic Framework for Mining All Quantitative Association Rules

We present QARMA, an efficient novel parallel algorithm for mining all Q...
research
12/03/2010

Closed-set-based Discovery of Bases of Association Rules

The output of an association rule miner is often huge in practice. This ...
research
12/26/2010

Mining Multi-Level Frequent Itemsets under Constraints

Mining association rules is a task of data mining, which extracts knowle...
research
12/13/2019

A Bayesian Approach to Rule Mining

In this paper, we introduce the increasing belief criterion in associati...
research
04/20/2010

Integrating User's Domain Knowledge with Association Rule Mining

This paper presents a variation of Apriori algorithm that includes the r...
research
03/24/2011

Formal and Computational Properties of the Confidence Boost of Association Rules

Some existing notions of redundancy among association rules allow for a ...

Please sign up or login with your details

Forgot password? Click here to reset