Wiley Interdisciplinary Reviews Data Mining and Knowledge Discovery · 2019 · 242 citations · 64 references
ComputingComputer ScienceData ManagementData MiningMachine LearningFrequent Pattern MiningScalable Data MiningAssociation Rule MiningFrequent Itemset Mining
Frequent itemset mining extracts recurring patterns from data, aiding decision‑making, but its computational complexity grows exponentially with item count, prompting a variety of centralized and parallel algorithms since the early 1990s. This review examines the evolution of highly efficient algorithms for frequent itemset mining, addressing the computational and memory challenges that have driven research over the past decades. The article is categorized under Algorithmic Development > Association Rules Technologies > Association Rules.
Abstract Frequent itemset mining (FIM) is an essential task within data analysis since it is responsible for extracting frequently occurring events, patterns, or items in data. Insights from such pattern analysis offer important benefits in decision‐making processes. However, algorithmic solutions for mining such kind of patterns are not straightforward since the computational complexity exponentially increases with the number of items in data. This issue, together with the significant memory consumption that is present in the mining process, makes it necessary to propose extremely efficient solutions. Since the FIM problem was first described in the early 1990s, multiple solutions have been proposed by considering centralized systems as well as parallel (shared or nonshared memory) architectures. Solutions can also be divided into exhaustive search and nonexhaustive search models. Many of such approaches are extensions of other solutions and it is therefore necessary to analyze how this task has been considered during the last decades. This article is categorized under: Algorithmic Development > Association Rules Technologies > Association Rules
64
Data mining: concepts and techniques
Jiawei Han, Micheline Kamber · Choice Reviews Online · 2012 · 28.9K citations
Sanjay Ghemawat · Communications of the ACM · 2008 · 18.5K citations · Full text
Mining association rules between sets of items in large databases
Rakesh Agrawal, Tomasz Imieliński, Arun Swami · 1993 · 14.8K citations · Full text
Mining frequent patterns without candidate generation
Jiawei Han, Jian Pei, Yiwen Yin · ACM SIGMOD Record · 2000 · 6.4K citations