ACM Home Page
Please provide us with feedback. Feedback
Dynamic itemset counting and implication rules for market basket data
Full text PdfPdf (1.19 MB)
Source International Conference on Management of Data archive
Proceedings of the 1997 ACM SIGMOD international conference on Management of data table of contents
Tucson, Arizona, United States
Pages: 255 - 264  
Year of Publication: 1997
ISBN:0-89791-911-4
Also published in ...
Authors
Sergey Brin  Department of Computer Science, Stanford University and R&D Division, Hitachi America Ltd.
Rajeev Motwani  Department of Computer Science, Stanford University
Jeffrey D. Ullman  Department of Computer Science, Stanford University
Shalom Tsur  R&D Division, Hitachi America Ltd.
Sponsor
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 35,   Downloads (12 Months): 247,   Citation Count: 208
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/253260.253325
What is a DOI?

ABSTRACT

We consider the problem of analyzing market-basket data and present several important contributions. First, we present a new algorithm for finding large itemsets which uses fewer passes over the data than classic algorithms, and yet uses fewer candidate itemsets than methods based on sampling. We investigate the idea of item reordering, which can improve the low-level efficiency of the algorithm. Second, we present a new way of generating “implication rules,” which are normalized based on both the antecedent and the consequent and are truly implications (not simply a measure of co-occurrence), and we show how they produce more intuitive results than other methods. Finally, we show how different characteristics of real data, as opposed by synthetic data, can dramatically affect the performance of the system and the form of the results.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
AIS93a
AIS93b
 
ALSS95
 
AS94
 
AS95
 
MAR96
M. Mehta, R. Agrawal, and J. Rissanen. Sliq: A fast scalable classifier for data mining. March 1996.
 
SA95
R. Srikant and R. Agrawal. Mining generalized association rules. 1995.
 
Toi96

CITED BY  208

Collaborative Colleagues:
Sergey Brin: colleagues
Rajeev Motwani: colleagues
Jeffrey D. Ullman: colleagues
Shalom Tsur: colleagues