Home
This Title All WIREs
WIREs RSS Feed
How to cite this WIREs title:
WIREs Data Mining Knowl Discov
Impact Factor: 2.111

A survey of erasable itemset mining algorithms

Full article on Wiley Online Library:   HTML PDF

Can't access this content? Tell your librarian.

Pattern mining, one of the most important problems in data mining, involves finding existing patterns in data. This article provides a survey of the available literature on a variant of pattern mining, namely erasable itemset (EI) mining. EI mining was first presented in 2009 and META is the first algorithm to solve this problem. Since then, a number of algorithms, such as VME, MERIT, and dMERIT+, have been proposed for mining EI. MEI, proposed in 2014, is currently the best algorithm for mining EIs. In this study, the META, VME, MERIT, dMERIT+, and MEI algorithms are described and compared in terms of mining time and memory usage. WIREs Data Mining Knowl Discov 2014, 4:356–379. doi: 10.1002/widm.1137

META algorithm.
[ Normal View | Magnified View ]
Memory usage for T10I4D100K dataset.
[ Normal View | Magnified View ]
Memory usage for Pumsb dataset.
[ Normal View | Magnified View ]
Memory usage for Mushroom dataset.
[ Normal View | Magnified View ]
Memory usage for Connect dataset.
[ Normal View | Magnified View ]
Memory usage for Chess dataset.
[ Normal View | Magnified View ]
Memory usage for Accidents dataset.
[ Normal View | Magnified View ]
Mining time for T10I4D100K dataset.
[ Normal View | Magnified View ]
Mining time for Pumsb dataset.
[ Normal View | Magnified View ]
Mining time for Mushroom dataset.
[ Normal View | Magnified View ]
Mining time for Connect dataset.
[ Normal View | Magnified View ]
Mining time for Chess dataset.
[ Normal View | Magnified View ]
Mining time for Accidents dataset.
[ Normal View | Magnified View ]
Tree of EIs obtained using dPidset without sorting erasable 1‐itemsets for DBe with ξ = 16%.
[ Normal View | Magnified View ]
Tree of EIs obtained using pidset for DBe with ξ = 16%.
[ Normal View | Magnified View ]
Tree of all EIs obtained by MEI for DBe with ξ = 16%.
[ Normal View | Magnified View ]
All EIs of node {e} for DBe with ξ = 16%.
[ Normal View | Magnified View ]
Erasable 3‐itemsets of node {ed} for DBe with ξ = 16%.
[ Normal View | Magnified View ]
Erasable 2‐itemsets of node {e} for DBe with ξ = 16%.
[ Normal View | Magnified View ]
MEI algorithm.
[ Normal View | Magnified View ]
Efficient algorithm for subtracting two dPidsets.
[ Normal View | Magnified View ]
Complete set of erasable itemsets identified by dMERIT+ for DBe with ξ = 16%.
[ Normal View | Magnified View ]
EIs of node {e} for DBe with ξ = 16%.
[ Normal View | Magnified View ]
Efficient method for subtracting two dNC'_Sets.
[ Normal View | Magnified View ]
Erasable 2‐itemsets of node {e} for DBe with ξ = 16%.
[ Normal View | Magnified View ]
Erasable 1‐itemsets and their NC′_Set for DBe with ξ = 16%.
[ Normal View | Magnified View ]
dMERIT+ algorithm.
[ Normal View | Magnified View ]
Result of MERIT+ for DBe with ξ = 16%.
[ Normal View | Magnified View ]
Erasable 1‐itemsets, E1, and its NC_Sets for DBe with ξ = 16%.
[ Normal View | Magnified View ]
MERIT algorithm.
[ Normal View | Magnified View ]
Efficient method for combining two NC_Sets.
[ Normal View | Magnified View ]
WPPC‐tree for DBe with ξ = 16%.
[ Normal View | Magnified View ]
Illustration of WPPC‐tree construction process for DBe.
[ Normal View | Magnified View ]
WPPC‐tree construction algorithm.
[ Normal View | Magnified View ]
VME algorithm.
[ Normal View | Magnified View ]

Browse by Topic

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