A Divide-and-Conquer Genetic-Fuzzy Mining Approach for Items with Multiple Minimum Supports

摘要

Since items may have their own characteristics, different minimum support values and membership functions may be specified for different items. In this paper, an enhanced approach is proposed, which processes the items in a divide-and-conquer strategy. The approach is designed for finding minimum support values, membership functions, and fuzzy association rules. Possible solutions are evaluated by their requirement satisfaction divided by their suitability of derived membership functions. The proposed GA framework maintains multiple populations, each for one item's minimum support value and membership functions. The final best minimum support values and membership functions in all the populations are then gathered together to be used for mining fuzzy association rules. Experimental results also show the effectiveness of the proposed approach.