The week's pick
Random Articles
Reseach Article
Discovering Maximal Frequent Itemset using Association Array and Depth First Search Procedure with Effective Pruning Mechanisms
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 76 - Number 13 |
| Year of Publication: 2013 |
| Authors: K. Sumathi, S. Kannan, K. Nagarajan |
10.5120/13306-0799
|
K. Sumathi, S. Kannan, K. Nagarajan . Discovering Maximal Frequent Itemset using Association Array and Depth First Search Procedure with Effective Pruning Mechanisms. International Journal of Computer Applications. 76, 13 ( August 2013), 14-18. DOI=10.5120/13306-0799
Abstract
The first step of association rule mining is finding out all frequent itemsets. Generation of reliable association rules are based on all frequent itemsets found in the first step. Obtaining all frequent itemsets in a large database leads the overall performance in the association rule mining. In this paper, an efficient method for discovering the maximal frequent itemsets is proposed. This method employs Association array technique and depth first search technique to mine Maximal Frequent Itemset. The proposed algorithm GenMFI takes vertical tidset representation of the database and removes all the non-maximal frequent item-sets to get exact set of MFI directly. Pruning is done for both search space reduction and minimizing the number of frequency computations and number of maximal frequent candidate sets. The algorithm gives better results for the sparse dataset even though number of the Maximal Frequent Itemset is huge. The proposed approach has been compared with Pincer search algorithm for T10I4D100K dataset and the results shows that the proposed algorithm performs better and generates maximal frequent patterns faster. In order to understand the algorithm easily, an example is provided in detail.
References
- D. Lin and Z. M. Kedem, "Pincer-Search: A New Algorithm for Discovering the Maximum Frequent Set", In Proceedings of VI Intl. Conference on Extending Database Technology, 1998.
- Don-Lin Yang, Ching-Ting Pan and Yeh-Ching Chung An Efficient Hash-Based Method for Discovering the Maximal Frequent Set
- K. Gouda and M. J. Zaki, "Efficiently Mining Maximal Frequent Itemsets", in Proc. of the IEEE
- Roberto Bayardo, "Efficiently mining long patterns from databases", in ACM SIGMOD Conference 1998.
- Agrawal, R. , Aggarwal, C. , and Prasad, V. 2000. Depth first generation of long patterns. In 7th Int'l Conference on Knowledge Discovery and Data Mining, pp. 108–118.
- Burdick, D. , M. Calimlim and J. Gehrke, "MAFIA: A maximal frequent itemset algorithm for transactional databases", In International Conference on Data Engineering, pp: 443 – 452, April 2001, doi = 10. 1. 1. 100. 6805
- R. Agrawal, T. Imielienski and A. Swami, "Mining association rules between sets of items in largedatabases. In P. Bunemann and S. Jajodia, editors, Proceedings of the 1993 ACM SIGMOD Conference on Management of Data, Pages 207-216, Newyork, 1993, ACM Press.
- R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A. I. Verkamo, "Fast discovery of association rules", Advances in Knowledge Discovery and Data Mining, pages 307-328, MIT Press, 1996.
Index Terms
Keywords