An Improved Association Rule Mining Technique Using Transposed Database
Keywords:
Association rule, Transposed Database, Trie, TransTrie, Frequent itemsets.Abstract
Discovering the association rules among the large databases is the most important feature of data mining. Many algorithms had been introduced by various researchers for finding association rules. Among these algorithms, the FP-growth method is the most proficient. It mines the frequent item set without candidate set generation. The setbacks of FP growth are, it requires two scans of overall database and it uses large number of conditional FP tree to generate frequent itemsets. To overcome these limitations a new approach has been proposed by the name TransTrie, it will use the reduced sorted transposed database. After this it will scan the database and generate a TRIE, in the same step it will also compute the occurrences of each item. Then, using Depth first traversal it will identify the maximal itemsets, from which all frequent itemsets are derived using apriori property. It also counts the support of frequent itemsets which are used to find the valuable association rules.
References
[2] J. Han and M. Kamber, “Data Mining: Concepts and Techniques”, second ed., Morgan Kaufmann, San Francisco, 2006.
[3] R. Agrawal and R. Srikant, “Fast algorithms for mining association rules”, The International conference on Very Large Databases, pp. 487-499, 1994.
[4] Jiawei Han and Micheline Kamber, “Data Mining Concepts and Techniques”, Harcourt India Private Limited ISBN: 81-7867-023-2, 2001.
[5] J.S. Park, M.S. Chen and P.S. Yu, An Effective Hash based Algorithm for Mining Association Rules”, In Proc., 1995 ACM SIGMOD International Conference on Management of Data, pp. 175-186, 1995.
[6] S. Brin, R. Motwani , J.D. Ullman, and S. Tsur, “Dynamic itemset counting and implication rules for market basket data”, In Proceedings of the ACM SIGMOD International Conference on Management of Data, vol. 26(2): 255–264, 1997.
[7] C. Hidber, “Online association rule mining”, In Proc. Of the ACM SIGMOD International Conference on Management of Data, vol. 28. pp. 145–156, 1999.
[8] Yves Bastide, Rafik Taouil, Nicolas Pasquier, Gerd Stumme and Lotfi Lakhal, “Mining Frequent Patterns with Counting Inference”, In proceeding of ACM SIGKDD, pp. 68-75, 2000.
[9] J. Han, J. Pei, and Y. Yin, “ Mining frequent patterns without candidate generation”, in Proc. ACM-SIGMOD Int. Conf. Management of Data (SIGMOD ’96), pp. 205-216, 2000.
[10] Ding Qin and Sundaraj Gnanasekaran, “Association rule mining from XML data”, Proceedings of the conference on data mining.DMIN’06.
[11] Mohammad El-Hajj and Osmar R. Zao?ane. , “COFItree Mining: A New Approach to Pattern Growth within the context of interactive mining”, in Proc. 2003 International Conf. on Data Mining and Knowledge Discovery (ACM SIGKDD), August 2003.
[12] Mohammad El-Hajj and Osmar R. Zao?ane, Inverted matrix: Efficient discovery of frequent items in large datasets in the context of interactive minin”g, in proce. 2003International Conf. on Data Mining and Knowledge Discovery (ACM SIGKDD), August 2003.
[13] Mohammad El-Hajj and Osmar R. Zao?ane, “COFI Approach for Mining Frequent Itemsets Revisited Mohammad”, DMKD ’04 June 13, 2004, Paris, France, 2004.
[14] A.B.M. Rezbaul Islam and Tae-Sun Chung, “An Improved Frequent Pattern Tree Based Association Rule Mining Technique”, 978-1-4244-9224-4/11, IEEE, 2011.
[15] Zailani Abdulla, Tutut Herawan and A. Norazia, Mustafa Mat Deris, “A Scalable Algorithm for Constructing Frequent Pattern Tree”, International Journal of Intelligent Information Technologies, 10(1), pp. 42-56, January-March 2014.
[16] F.Bodon and L. Ronyal, Trie: An Alternative Data Structure for Data Mining Algorithms, Proceeding in Mathematical and Computer Modeling Vol. 38, pp.739-751, Elsevier Ltd. 2003.
[17] C. Silverstein, S. Brin, and R. Motwani, “Beyond Market Baskets: Generalizing Association Rules to Dependence Rules”, Data Mining and Knowledge Discovery, vol. 2(1), pp. 39–68, 1998.
Downloads
Published
How to Cite
Issue
Section
License
Authors who submit papers with this journal agree to the following terms.
