Journal of Computer Science

Mining Rare Itemset with Automated Support Thresholds

Kanimozhi Selvi Chenniangirivalsu Sadhasivam and Tamilarasi Angamuthu

DOI : 10.3844/jcssp.2011.394.399

Journal of Computer Science

Volume 7, Issue 3

Pages 394-399


Problem statement: Frequent itemset mining is an important task in data mining to discover the hidden, interesting associations between items in the database based on the user-specified support and confidence thresholds. Approach: In order to find important associations, an appropriate support threshold has to be specified. The support threshold plays a key role in deciding the interesting itemsets. The rare itemsets may not found if a high threshold is set. Some uninteresting itemsets may appear if a low threshold is set. Results: This study proposes an approach to obtain the frequent itemsets involving rare items by setting the support thresholds automatically. Experimental results show that this approach produces rare and frequent itemsets in sparse and dense datasets. According to T20I6D100K, 97.76% of the FIs are generators wherein Mushrooms 1.38% of the FIs are the generators. Conclusion: The proposed algorithm produces both frequent and rare itemsets in an effective way. In future, computational efforts can still be reduced by implementing the algorithm as parallel algorithm.


© 2011 Kanimozhi Selvi Chenniangirivalsu Sadhasivam and Tamilarasi Angamuthu. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.