ACM Home Page
Please provide us with feedback. Feedback
Mining fuzzy association rules in databases
Full text PdfPdf (309 KB)
Source ACM SIGMOD Record archive
Volume 27 ,  Issue 1  (March 1998) table of contents
Pages: 41 - 46  
Year of Publication: 1998
ISSN:0163-5808
Authors
Chan Man Kuok  Department of Computer Science and Engineering, The Chinese University of Hong Kong, Shatin, New Territories, Hong Kong
Ada Fu  Department of Computer Science and Engineering, The Chinese University of Hong Kong, Shatin, New Territories, Hong Kong
Man Hon Wong  Department of Computer Science and Engineering, The Chinese University of Hong Kong, Shatin, New Territories, Hong Kong
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 26,   Downloads (12 Months): 132,   Citation Count: 22
Additional Information:

abstract   cited by   index terms   collaborative colleagues  

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

ABSTRACT

Data mining is the discovery of previously unknown, potentially useful and hidden knowledge in databases. In this paper, we concentrate on the discovery of association rules. Many algorithms have been proposed to find association rules in databases with binary attributes. We introduce the fuzzy association rules of the form, 'If X is A then Y is B', to deal with quantitative attributes. X, Y are set of attributes and A, B are fuzzy sets which describe X and Y respectively. Using the fuzzy set concept, the discovered rules are more understandable to human. Moreover, fuzzy sets handle numerical values better than existing methods because fuzzy sets soften the effect of sharp boundaries.


CITED BY  23

Collaborative Colleagues:
Chan Man Kuok: colleagues
Ada Fu: colleagues
Man Hon Wong: colleagues