The relation of closed itemset mining, complete pruning strategies and item ordering in apriori-based FIM algorithms

Authors:
Ferenc Bodon;Lars Schmidt-Thieme
Affiliations:
Department of Computer Science and Information Theory, Budapest University of Technology and Economics;Computer Based New Media Group (CGNM), Albert-Ludwigs-Universität Freiburg
Venue:
PKDD'05 Proceedings of the 9th European conference on Principles and Practice of Knowledge Discovery in Databases
Year:
2005

Citing 3
Cited 4

Mining frequent patterns without candidate generation

SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Fast Algorithms for Mining Association Rules in Large Databases

VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
File searching using variable length keys

IRE-AIEE-ACM '59 (Western) Papers presented at the the March 3-5, 1959, western joint computer conference

A trie-based APRIORI implementation for mining frequent item sequences

Proceedings of the 1st international workshop on open source data mining: frequent pattern mining implementations
Mining rank-correlated sets of numerical attributes

Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Using a reinforced concept lattice to incrementally mine association rules from closed itemsets

KDID'06 Proceedings of the 5th international conference on Knowledge discovery in inductive databases
Frequent item set mining

Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we investigate the relationship between closed itemset mining, the complete pruning technique and item ordering in the Apriori algorithm. We claim, that when proper item order is used, complete pruning does not necessarily speed up Apriori, and in databases with certain characteristics, pruning increases run time significantly. We also show that if complete pruning is applied, then an intersection-based technique not only results in a faster algorithm, but we get free closed-itemset selection concerning both memory consumption and run-time.