Optimized Algorithm for Mining Maximum Frequent Itemsets on Association Rule

Abstract:

Aiming at the weakness of traditional Apriori algorithm, this paper presents MFI algorithm for mining maximum frequent itemsets on association rules. MFI algorithm scans database only once, the algorithm need not produce candidate itemsets, MFI algorithm does not use the method of iteration for each layer, MFI algorithm adopts binary bit and logic operation.The efficiency is distinctly improved in mining maximum frequent itemset.

• Periodical: Applied Mechanics and Materials (Volumes 347-350)
• Pages: 3227-3231
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.347-350.3227
• Online since: August 2013
• Authors: Nai Li Liu, Lei Ma
• Keywords: Association Rule, Data Mining (DM), Matrix, Maximum Frequent Item Set

References

[1] Agrawa lR, Imielinski T, Swami A. Mining association rules between sets of items in large databases (C). In: Buneman P, Jajodia S, eds. Proc. of the ACM SIGMOD Conf. on Management of Data (SIGMOD'93). New York: ACM Press, 1993. 207-216.

DOI: 10.1145/170036.170072

[2] Agrawa lR, Srikant R. Fast algorithms for mining association rules in large databases. In: Bocca JB, Jarke M, Zaniolo C, eds. Proc. of the 20th Int'l Conf. on Very Large Data Bases. Santiago: Morgan Kaufmann, 1994. 478-499.

[3] Aly HH, Taha Y, Amr AA. Fast mining of association rules in large-scale problems. In: Abdel-Wahab H, Jeffay K, eds. Proc. of the 6th IEEE Symp. on Computers and Communications (ISCC 2001). New York: IEEE Computer Society Press, 2001. 107-113.

DOI: 10.1109/iscc.2001.935362

[4] Tsai CF, Lin YC, Chen CP. A new fast algorithms for mining association rules in large databases. In: Kamel AE, Mellouli K, Borne P, eds. Proc. of the 2002 IEEE Int'l Conf. on Systems, Man and Cybernetics (SMC 2002). IEEE Computer Society Press, 2002. 251-256.

DOI: 10.1109/icsmc.2002.1175703

[5] Park J S，Chen M S，Yu P S．An effective hash-based algorithm for mining association rules[C]. Proceedings of the ACM SIGMOD．San Jose．1995：175-186.

DOI: 10.1145/568271.223813

[6] Savasere A，Omiecinski E，Navathe S．An eficient algorithm for mining association rules in large databases[C]. Proceedings of the2 1 st International Conference on Very Large Databases, 1995: 432-444.

DOI: 10.1007/bfb0053471

[7] Han J，Pei J，Yin Y. Mining frequent patterns without candidate generation[C]. Proceedings of the ACM SIGMOD, 2000: 1-12.

DOI: 10.1145/335191.335372

[8] Gouda K，Zaki M J. Eficiently mining maximal frequent itemsets[C]. Proceedings of the 1 st IEEE International Conference on Data Mining(ICDM), San Jose, (2001).

DOI: 10.1109/icdm.2001.989514

[9] Huang Longjun, Duan Longzhen. Algorithm of Frequent Itemset Mining Based on Upper Triangular Itemsets Matrix[J]. Application Research of Computers, 2006, l1(25): 25-40.

[10] WANG Feng, LI Yonghua, WU Guoqing. Improved Apriori algorithm based on matrix[J]. Computer Engineering and Design. 2009, 30(10): 2435-2438.

[11] ZHANG Yueqin. Research of frequent itemsets mining algorithm based on 0-1 matrix[J]. Computer Engineering and Design. 2009, 30(20): 4662-4667.

[12] TIAN Wangjun, JIANG Junhui, CHEN Shihui. Frequent Item Sets M ining Algorithm Based 0n M atrix Technology [J]. Computer Engineering, 2011, 37(16): 80-81.

[13] SCHLIMMER J. Mushroom data set. http: /archive. ics. uci. edu/ml/machine-learning-databases/mushroom/agaricus-lepiota. data.