This Title All WIREs
How to cite this WIREs title:
WIREs Data Mining Knowl Discov
Impact Factor: 7.250

A survey of itemset mining

Full article on Wiley Online Library:   HTML PDF

Can't access this content? Tell your librarian.

Itemset mining is an important subfield of data mining, which consists of discovering interesting and useful patterns in transaction databases. The traditional task of frequent itemset mining is to discover groups of items (itemsets) that appear frequently together in transactions made by customers. Although itemset mining was designed for market basket analysis, it can be viewed more generally as the task of discovering groups of attribute values frequently cooccurring in databases. Because of its numerous applications in domains such as bioinformatics, text mining, product recommendation, e‐learning, and web click stream analysis, itemset mining has become a popular research area. This study provides an up‐to‐date survey that can serve both as an introduction and as a guide to recent advances and opportunities in the field. The problem of frequent itemset mining and its applications are described. Moreover, main approaches and strategies to solve itemset mining problems are presented, as well as their characteristics are provided. Limitations of traditional frequent itemset mining approaches are also highlighted, and extensions of the task of itemset mining are presented such as high‐utility itemset mining, rare itemset mining, fuzzy itemset mining, and uncertain itemset mining. This study also discusses research opportunities and the relationship to other popular pattern mining problems, such as sequential pattern mining, episode mining, subgraph mining, and association rule mining. Main open‐source libraries of itemset mining implementations are also briefly presented. WIREs Data Mining Knowl Discov 2017, 7:e1207. doi: 10.1002/widm.1207 This article is categorized under: Algorithmic Development > Association Rules Technologies > Association Rules
The search space for I = {a, b, c, d, e}.
[ Normal View | Magnified View ]
The lattice of formal concepts for the database of Table .
[ Normal View | Magnified View ]
The pseudo‐projected database of {a,c}.
[ Normal View | Magnified View ]

Related Articles

Mining uncertain data
A survey of erasable itemset mining algorithms
Incremental association rule mining: a survey
Top Ten WIDM Articles

Browse by Topic

Technologies > Association Rules
Algorithmic Development > Association Rules

Access to this WIREs title is by subscription only.

Recommend to Your
Librarian Now!

The latest WIREs articles in your inbox

Sign Up for Article Alerts