New probabilistic interest measures for association rules

03/06/2008
by   Michael Hahsler, et al.
0

Mining association rules is an important technique for discovering meaningful patterns in transaction databases. Many different measures of interestingness have been proposed for association rules. However, these measures fail to take the probabilistic properties of the mined data into account. In this paper, we start with presenting a simple probabilistic framework for transaction data which can be used to simulate transaction data when no associations are present. We use such data and a real-world database from a grocery outlet to explore the behavior of confidence and lift, two popular interest measures used for rule mining. The results show that confidence is systematically influenced by the frequency of the items in the left hand side of rules and that lift performs poorly to filter random noise in transaction data. Based on the probabilistic framework we develop two new interest measures, hyper-lift and hyper-confidence, which can be used to filter or order mined association rules. The new measures show significantly better performance than lift for applications where spurious rules are problematic.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/24/2023

ARULESPY: Exploring Association Rules and Frequent Itemsets in Python

The R arules package implements a comprehensive infrastructure for repre...
research
08/16/2013

Standardizing Interestingness Measures for Association Rules

Interestingness measures provide information that can be used to prune o...
research
08/06/2018

The Bases of Association Rules of High Confidence

We develop a new approach for distributed computing of the association r...
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
03/20/2019

Preference rules for label ranking: Mining patterns in multi-target relations

In this paper we investigate two variants of association rules for prefe...
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