ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
Mining the most interesting rules
Full text PdfPdf (1.29 MB)
Source International Conference on Knowledge Discovery and Data Mining archive
Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining table of contents
San Diego, California, United States
Pages: 145 - 154  
Year of Publication: 1999
ISBN:1-58113-143-7
Authors
Roberto J. Bayardo, Jr.  IBM Almaden Research Center
Rakesh Agrawal  IBM Almaden Research Center
Sponsors
SIGKDD: ACM Special Interest Group on Knowledge Discovery in Data
AAAI : Am Assoc for Artifical Intelligence
SIGART: ACM Special Interest Group on Artificial Intelligence
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 13,   Downloads (12 Months): 114,   Citation Count: 95
Additional Information:

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/312129.312219
What is a DOI?

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.

1
 
2
 
3
Ali, K.; Manganaris, S.; and Srikant, R. 1997. Partial Classification using Association Rules. In Proc. of the 3rd lnt'l Conf. on Knowledge Discovery in Databases and Data Mining, 115-118.
 
4
Bayardo, R. J. 1997. Brute-Force Mining of High-Confidence Classification Rules. In Proc. of the Third Int'l Conf. on Knowledge Discovery and Data Mining, 123-126.
5
 
6
 
7
Bayardo, R. J. and Agrawal, R. 1999. Mining the Most Interesting Rules. IBM Research Report. Available from: http; //www. almaden, ibm. com/cs / quest
8
 
9
 
10
 
11
Eggleston, H. G. 1963. Convexity. Cambridge Tracts in Mathematics and Mathematical Physics, no. 47. Smithies, F. and Todd, J. A. (eds.). Cambridge University Press.
12
 
13
Goethals, B. and Van den Bussche, J. 1999. A Priori Versus A Posteriori Filtering of Association Rules. In Proc. of the 1999 ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, paper 3.
 
14
International Business Machines, ! 996. IBM Intelligent Miner User's Guide, Version 1, Release 1.
 
15
 
16
 
17
 
18
Nakaya, A. and Morishita, S. 1999. Fast Parallel Search for Correlated Association Rules. Unpublished manuscript.
 
19
Piatetsky-Shapiro, G. 1991. Discovery, Analysis, and Presentation of Strong Rules. Chapter 13 of Knowledge Discovery in Databases, AAAI/MIT Press, 199 I.
 
20
 
21
Rymon, R. 1992. Search through Systematic Set Enumeration. In Proc. of Third lnt'l Conf. on Principles of Knowledge Representation and Reasoning, 539-550.
 
22
Srikant, R.; Vu, Q.; and Agrawal, R. 1997. Mining Association Rules with Item Constraints. In Proc. of the Third Int'l Conf. on Knowledge Discovery in Databases and Data Mining, 67-73.
 
23
Webb, G. I. 1996. Inclusive Pruning: A New Class of Pruning Axiom for Unordered Search and its Application to Classification Learning. In Proc. of the 1996 Australian Computer Science Conference, I - 10.
 
24
Webb, G. I. 1995. OPUS: An Efficient Admissible Algorithm for Unordered Search. Journal of Artificial Intelligence Research, 3:431-465.

CITED BY  95

Collaborative Colleagues:
Roberto J. Bayardo, Jr.: colleagues
Rakesh Agrawal: colleagues