Abstract
In this paper we have proposed an improved ap-proach to extract rare association rules. Rare association rulesare the association rules containing rare items. Rare items are lessfrequent items. For extracting rare itemsets, the single minimumsupport (minsup) based approaches like Apriori approach sufferfrom “rare item problem” dilemma. At high minsup value, rareitemsets are missed, and at low minsup value, the number offrequent itemsets explodes. To extract rare itemsets, an effort hasbeen made in the literature in which minsup of each item is fixedequal to the percentage of its support. Even though this approachimproves the performance over single minsup based approaches,it still suffers from “rare item problem” dilemma. If minsup forthe item is fixed by setting the percentage value high, the rareitemsets are missed as the minsup for the rare items becomes closeto their support, and if minsup for the item is fixed by setting thepercentage value low, the number of frequent itemsets explodes.In this paper, we propose an improved approach in which minsupis fixed for each item based on the notion of “support difference”.The proposed approach assigns appropriate minsup values forfrequent as well as rare items based on their item supportsand reduces both “rule missing” and “rule explosion” problems.Experimental results on both synthetic and real world datasetsshow that the proposed approach improves performance overexisting approaches by minimizing the explosion of number offrequent itemsets involving frequent items and without missingthe frequent itemsets involving rare items.