2006 · 167 citations · 9 references
ComputingComputer ScienceData MiningData StructuresDatabasesDatabase ManagementFrequent Pattern MiningFrequent Itemset MiningHeuristic Algorithms
One of the major problems in frequent item set mining is the explosion of the number of results: it is difficult to find the most interesting frequent item sets. The cause of this explosion is that large sets of frequent item sets describe essentially the same set of transactions. In this paper we approach this problem using the MDL principle: the best set of frequent item sets is that set that compresses the database best. We introduce four heuristic algorithms for this task, and the experiments show that these algorithms give a dramatic reduction in the number of frequent item sets. Moreover, we show how our approach can be used to determine the best value for the min-sup threshold.
9
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
R. K. Agrawal, Ramakrishnan Srikant · 2002 · 5.1K citations
Efficiently mining long patterns from databases
Roberto J. Bayardo · 1998 · 1.3K citations