ACM Home Page
Please provide us with feedback. Feedback
Mining quantitative association rules in large relational tables
Full text PdfPdf (1.22 MB)
Source International Conference on Management of Data archive
Proceedings of the 1996 ACM SIGMOD international conference on Management of data table of contents
Montreal, Quebec, Canada
Pages: 1 - 12  
Year of Publication: 1996
ISBN:0-89791-794-4
Also published in ...
Authors
Ramakrishnan Srikant  IBM Almaden Research Center, 650 Harry Road, San Jose, CA and Department of Computer Science, University of Wisconsin, Madison
Rakesh Agrawal  IBM Almaden Research Center, 650 Harry Road, San Jose, CA
Sponsors
SIGART: ACM Special Interest Group on Artificial Intelligence
SIGMOD: ACM Special Interest Group on Management of Data
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 24,   Downloads (12 Months): 185,   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/233269.233311
What is a DOI?

ABSTRACT

We introduce the problem of mining association rules in large relational tables containing both quantitative and categorical attributes. An example of such an association might be "10% of married people between age 50 and 60 have at least 2 cars". We deal with quantitative attributes by fine-partitioning the values of the attribute and then combining adjacent partitions as necessary. We introduce measures of partial completeness which quantify the information lost due to partitioning. A direct application of this technique can generate too many similar rules. We tackle this problem by using a "greater-than-expected-value" interest measure to identify the interesting rules in the output. We give an algorithm for mining such quantitative association rules. Finally, we describe the results of using this approach on a real-life dataset.


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.

AIS93
 
AS94
BKSS90
 
HF95
 
HS95
 
JD88
 
MTV94
Heikki Marmila, Harmu Toivonen, and A. Inkeri Verkamo. Efficient algorithms for discovering association rules. In KDD-94: AAAI Workshop on Knowledge Discovery in Databases, pages 181- 192, Seattle, Washington, July 1994.
PCY95
 
PS91
 
SA95
 
SON95
 
ST95
Avi Silberschatz and Alexander Tuzhilin. On Subjective Measures of Interestingness in Knowledge Discovery. In Proc. of the First Int'l Conference on Knowledge Discovery and Data Mining, Montreal, Canada, August 1995.

CITED BY  208

Collaborative Colleagues:
Ramakrishnan Srikant: colleagues
Rakesh Agrawal: colleagues