Query fuzzy association rules in relational database

An important issue to extend database management systems functionality is to allow the expression of imprecise queries to make these systems able to satisfy user needs more closely. In the last few years, some authors have dealt with the problem of relaxing the relational model in order to admit some imprecision. Two significant data mining problems have been addressed recently, namely, mining fuzzy association. rules, and set-oriented mining for association rules in relational database (SETM algorithms). At present, the problem of how to express the mining fuzzy association rules algorithm as SQL queries has not been proposed. In this paper, we attempt to develop a fuzzy version of SETM algorithms that can be expressed as SQL queries in relational databases and discuss optimization of the algorithm