Finding the N largest itemsets

Li Shen, Hong Shen, Paul Pritchard, Rodney Topor

Research output: Contribution to conferencePaper

9 Scopus citations

Abstract

The largest itemset in a given collection of transactions D is the itemset that occurs most frequently in D. This paper studies the problem of finding the N largest itemsets, whose solution can be used to generate an appropriate number of interesting itemsets for mining association rules. We present an efficient algorithm for finding the N largest itemsets. The algorithm is implemented and compared with the naive solution using the Apriori approach. We present experimental results as well as theoretical analysis showing that our algorithm has a much better performance than the naive solution. We also analyze the cost of our algorithm and observe that it has a polynomial time complexity in most cases of practical applications.

Original languageEnglish (US)
Pages211-222
Number of pages12
StatePublished - Dec 1 1998
Externally publishedYes
EventProceedings of the 1988 International Conference on Data Mining - Rio de Janeiro, Brazil
Duration: Sep 2 1998Sep 4 1998

Other

OtherProceedings of the 1988 International Conference on Data Mining
CityRio de Janeiro, Brazil
Period9/2/989/4/98

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'Finding the N largest itemsets'. Together they form a unique fingerprint.

  • Cite this

    Shen, L., Shen, H., Pritchard, P., & Topor, R. (1998). Finding the N largest itemsets. 211-222. Paper presented at Proceedings of the 1988 International Conference on Data Mining, Rio de Janeiro, Brazil, .