MAFIA: a maximal frequent itemset algorithm

By Douglas Burdick, Manuel Calimlim, Jason Flannick, Johannes Gehrke, Tomi Yiu. IEEE Transactions on Knowledge and Data Engineering, 2005

303 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Information Systems, Signal Processing

View Paper: https://www.semanticscholar.org/paper/35aa519a94130bf8d3778af96a37836c45a9e1b7

Citations in the corpus

• Constraint programming for itemset mining (2008, unknown): “Maximal frequent itemsets are another condensed representation for the set of frequent itemsets [6].”
• Rules for contrast sets (2010, unknown): “This pruning is obtained by embedding the Parent Equivalence Pruning technique (PEP) [5] into our contrast sets mining algorithm.”