arules: Mining Association Rules and Frequent Itemsets
Published 15 April 2005Open access
Michael Hahsler, Christian Buchta, Bettina Gruen, Kurt Hornik
Citations71
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
Abstract
Provides the infrastructure for representing, manipulating and analyzing transaction data and patterns (frequent itemsets and association rules). Also provides C implementations of the association mining algorithms Apriori and Eclat. Hahsler, Gruen and Hornik (2005) <doi:10.18637/jss.v014.i15>.
Keywords
Computer Science
Mining association rules between sets of items in large databases
14,720 Citations1993Rakesh Agrawal, Tomasz Imieliński +1 more
An efficient algorithm is presented that generates all significant association rules between items in the database of customer transactions and incorporates buffer management and novel estimation and pruning techniques.
BiometrikaTHE USE OF CONFIDENCE OR FIDUCIAL LIMITS ILLUSTRATED IN THE CASE OF THE BINOMIAL
4,753 Citations1934C. J. Clopper, E. S. Pearson
Journal of the American Statistical AssociationProbable Inference, the Law of Succession, and Statistical Inference
3,502 Citations1927Edwin B. Wilson
Journal of Statistical Software<b>arules</b>- A Computational Environment for Mining Association Rules and Frequent Item Sets
545 Citations2005Michael Hahsler, Bettina Grün +1 more
Lecture notes in computer scienceMining Minimal Non-redundant Association Rules Using Frequent Closed Itemsets
326 Citations2000Yves Bastide, Nicolas Pasquier +3 more
Two new bases for association rules are defined which union is a generating set for all valid association rules with support and confidence and consist of the nonredundant exact and approximate association rules having minimal antecedents and maximal consequents.
Wiley Interdisciplinary Reviews Data Mining and Knowledge DiscoveryFrequent item set mining
287 Citations2012Christian Borgelt
This paper provides an overview of the foundations of frequent item set mining, starting from a definition of the basic notions and the core task, and discusses how the search space is structured to avoid redundant search, how the output is reduced by confining it to closed or maximal item sets or generators.
The arules R-Package Ecosystem: Analyzing Interesting Patterns from Large Transaction Data Sets
134 Citations2011Michael Hahsler, Sudheer Chelluboina +2 more
Intelligent Data AnalysisNew probabilistic interest measures for association rules
65 Citations2007Michael Hahsler, Kurt Hornik
Two new interest measures, hyper-lift and hyper-confidence, are developed which can be used to filter or order mined association rules and show significantly better performance than lift for applications where spurious rules are problematic.
Knowledge and Information SystemsA new concise representation of frequent itemsets using generators and a positive border
40 Citations2007Guimei Liu, Jinyan Li +1 more
This paper proposes to use a positive border together with frequent generators to form a lossless representation, and develops an efficient algorithm, called GrGrowth, to mine generators and positive borders as well as their generalizations.
Knowledge-Based SystemsDiscovering statistically non-redundant subgroups
25 Citations2014Jiuyong Li, Jixue Liu +4 more
It is shown that the proposed method is faster than most existing methods and discovers complete statistically non-redundant subgroups by the error bounds of odds ratios.
Negative Association Rules
12 Citations2014Luiza Antonie, Jundong Li +1 more
This work reviews current approaches for mining negative association rules, discusses limitations and future research directions, and discovered rules that associate items purchased together.