Finding the N largest itemsets

Li Shen, Hong Shen, Paul Pritchard, Rodney Topor

Research output: Chapter in Book/Report/Conference proceedingConference contribution

9 Citations (Scopus)

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)
Title of host publicationProceedings of the International Conference on Data Mining
EditorsN.F.F. Ebecken
Pages211-222
Number of pages12
StatePublished - 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

Fingerprint

Association rules
Polynomials
Costs

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Shen, L., Shen, H., Pritchard, P., & Topor, R. (1998). Finding the N largest itemsets. In N. F. F. Ebecken (Ed.), Proceedings of the International Conference on Data Mining (pp. 211-222)

Finding the N largest itemsets. / Shen, Li; Shen, Hong; Pritchard, Paul; Topor, Rodney.

Proceedings of the International Conference on Data Mining. ed. / N.F.F. Ebecken. 1998. p. 211-222.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Shen, L, Shen, H, Pritchard, P & Topor, R 1998, Finding the N largest itemsets. in NFF Ebecken (ed.), Proceedings of the International Conference on Data Mining. pp. 211-222, Proceedings of the 1988 International Conference on Data Mining, Rio de Janeiro, Brazil, 9/2/98.
Shen L, Shen H, Pritchard P, Topor R. Finding the N largest itemsets. In Ebecken NFF, editor, Proceedings of the International Conference on Data Mining. 1998. p. 211-222
Shen, Li ; Shen, Hong ; Pritchard, Paul ; Topor, Rodney. / Finding the N largest itemsets. Proceedings of the International Conference on Data Mining. editor / N.F.F. Ebecken. 1998. pp. 211-222
@inproceedings{325262326b3045d78e1e4dfa4ea86fbd,
title = "Finding the N largest itemsets",
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.",
author = "Li Shen and Hong Shen and Paul Pritchard and Rodney Topor",
year = "1998",
language = "English (US)",
pages = "211--222",
editor = "N.F.F. Ebecken",
booktitle = "Proceedings of the International Conference on Data Mining",

}

TY - GEN

T1 - Finding the N largest itemsets

AU - Shen, Li

AU - Shen, Hong

AU - Pritchard, Paul

AU - Topor, Rodney

PY - 1998

Y1 - 1998

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0032278432&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0032278432&partnerID=8YFLogxK

M3 - Conference contribution

SP - 211

EP - 222

BT - Proceedings of the International Conference on Data Mining

A2 - Ebecken, N.F.F.

ER -