paper-with-me

Papers

New probabilistic interest measures for association rules

2008-03-06 · Michael Hahsler, Kurt Hornik

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.

📄 PDF Abstract BibTeX arXiv:0803.0966

Code (1)

mhahsler/arules 공식 구현

Similar Papers 제목 키워드 기반

Standardizing Interestingness Measures for Association Rules

2013-08-16 · Mateen Shaikh, Paul D. McNicholas, M. Luiza Antonie, T. Brendan Murphy

Interestingness measures provide information that can be used to prune or select association rules. A given value of an interestingness measure is often interpreted relative to the overall range of the values that the in…

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

2018-04-18 · Ioannis T. Christou, Emmanouil Amolochitis, Zheng-Hua Tan

We present QARMA, an efficient novel parallel algorithm for mining all Quantitative Association Rules in large multidimensional datasets where items are required to have at least a single common attribute to be specified…

AllAttributeMarketing

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

2019-03-20 · Cláudio Rebelo de Sá, Paulo Azevedo, Carlos Soares, Alípio Mário Jorge 외

In this paper we investigate two variants of association rules for preference data, Label Ranking Association Rules and Pairwise Association Rules. Label Ranking Association Rules (LRAR) are the equivalent of Class Assoc…

Descriptive

On interestingness measures of formal concepts

2016-11-08 · Sergei O. Kuznetsov, Tatiana Makhalova

Formal concepts and closed itemsets proved to be of big importance for knowledge discovery, both as a tool for concise representation of association rules and a tool for clustering and constructing domain taxonomies and …

Clustering

MARC: Mining Association Rules from datasets by using Clustering models

2021-07-14 · Shadi Al Shehabi, Abdullatif Baba

Association rules are useful to discover relationships, which are mostly hidden, between the different items in large datasets. Symbolic models are the principal tools to extract association rules. This basic technique i…

Clustering