ACM Home Page
Please provide us with feedback. Feedback
Finding interesting rules from large sets of discovered association rules
Full text PdfPdf (712 KB)
Source Conference on Information and Knowledge Management archive
Proceedings of the third international conference on Information and knowledge management table of contents
Gaithersburg, Maryland, United States
Pages: 401 - 407  
Year of Publication: 1994
ISBN:0-89791-674-3
Authors
Mika Klemettinen  Department of Computer Science, University of Helsinki, P.O. Box 26, FIN-00014 University of Helsinki, Finland
Heikki Mannila  Department of Computer Science, University of Helsinki, P.O. Box 26, FIN-00014 University of Helsinki, Finland
Pirjo Ronkainen  Department of Computer Science, University of Helsinki, P.O. Box 26, FIN-00014 University of Helsinki, Finland
Hannu Toivonen  Department of Computer Science, University of Helsinki, P.O. Box 26, FIN-00014 University of Helsinki, Finland and Nokia Research Center
A. Inkeri Verkamo  Department of Computer Science, University of Helsinki, P.O. Box 26, FIN-00014 University of Helsinki, Finland
Sponsors
SIGIR: ACM Special Interest Group on Information Retrieval
NIST : National Institue of Standards & Technology
UMBC : U of MD Baltimore County
SIGART: ACM Special Interest Group on Artificial Intelligence
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 13,   Downloads (12 Months): 148,   Citation Count: 123
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/191246.191314
What is a DOI?

ABSTRACT

Association rules, introduced by Agrawal, Imielinski, and Swami, are rules of the form “for 90% of the rows of the relation, if the row has value 1 in the columns in set W, then it has 1 also in column B”. Efficient methods exist for discovering association rules from large collections of data. The number of discovered rules can, however, be so large that browsing the rule set and finding interesting rules from it can be quite difficult for the user. We show how a simple formalism of rule templates makes it possible to easily describe the structure of interesting rules. We also give examples of visualization of rules, and show how a visualization tool interfaces with rule templates.


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
 
4
 
5
 
6
Peter H oschka and Willi K15sgen. A support system for interpreting statistical data. In Gregory Piatetsky- Shapiro and William J. Frawley, editors, Knowledge Dzscovery in Databases, pages 325 - 345. AAAI Press / The MIT Press, Menlo Park, CA, 1991.
7
8
 
9
Heikki Mannila, Hannu Toivonen, and A. Inkeri Verkamo. Efficient algorithms for discovering association rules. In Usama M. Fayyad and Ramasamy Uthurusamy, editors, AAA1 Workshop on Knowledge Discovery in Databases, pages 181 - 192, Seattle, Washington, July 1994.
 
10
 
11
 
12
Gregory Piatetsky-Shapiro. Discovery, analysis, and presentation of strong rules. In Gregory Piatetsky- Shapiro and William 3. Frawley, editors, Knowledge Dzscovery ,n Databases, pages 229- 248. AAAI Press / The MIT Press, Menlo Park, CA. 1991.
 
13
 
14
Gregory Piatetsky-Shapiro and Christopher J. Matheus. The interestingness of deviations. In Usarea M. Fayyad and Ramasamy Uthurusamy. editors, AAAI Workshop on Knowledge Discovery #n Databases. pages 25- 36, Seattle, Washington, July 1994.
 
15
 
16

CITED BY  123
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Collaborative Colleagues:
Mika Klemettinen: colleagues
Heikki Mannila: colleagues
Pirjo Ronkainen: colleagues
Hannu Toivonen: colleagues
A. Inkeri Verkamo: colleagues

Peer to Peer - Readers of this Article have also read: