A Rapid Algorithm For Mining Fuzzy Association Rules

摘要

Fuzzy association rules described by the natural language are well suited for the thinking of human subject and will help to increase the flexibility for supporting user in making decisions or designing the fuzzy systems. However, the efficiency of algorithms needs to be improved to handle real-world large datasets. in this paper, we present An efficient algorithm named fuzzy cluster-based(FCB) along with its parallel version named parallel fuzzy clusterbased (PFCB). The FCB method is to create cluster tables by scanning the database once, and then clustering the transaction records to the i-th cluster table,where the length of a record is i. moreover, the fuzzy large itemsets are generated by contrasts with the partialcluster tables. Similarly, the PFCB method is to create cluster tables by scanning the database once, and then clustering the transaction records to the i-th cluster table,which is on the i-th processor,where the length of a record is i. moreover, the large itemsets are generated by contrasts with the partial cluster tables, then, to calculate the fuzzy support of the candidate itemsets at each level, each processor calculate the support of the candidate itemsets in its own cluster and forwards the result to the coordinator. The final fuzzy support of the candidate itemsets, is then calculated from this results in the coordinator. We have performed extensive experiments and compared the performance of our algorithms with two of the best existing algorithms.