Mining fuzzy association rules in databases

Chan Man Kuok, Ada W. C. Fu, Man Hon Wong

ACM SIGMOD Record · 1998 · 528 citations · 8 references

DOIFull text

Open access

Concepts

TL;DR

Data mining seeks hidden knowledge in databases, and many algorithms exist for finding association rules in binary‑attribute databases. This study focuses on discovering fuzzy association rules for quantitative attributes. The authors define fuzzy association rules of the form “If X is A then Y is B”, where X and Y are attribute sets and A and B are fuzzy sets describing them. The fuzzy rules are more interpretable and better handle numerical values than existing methods, as fuzzy sets soften sharp boundaries.

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.

References

8