{"title":"Improved FP-growth Algorithm with Multiple Minimum Supports Using Maximum Constraints","authors":"Elsayeda M. Elgaml, Dina M. Ibrahim, Elsayed A. Sallam ","volume":101,"journal":"International Journal of Computer and Information Engineering","pagesStart":1122,"pagesEnd":1130,"ISSN":"1307-6892","URL":"https:\/\/publications.waset.org\/pdf\/10001311","abstract":"
Association rule mining is one of the most important fields of data mining and knowledge discovery. In this paper, we propose an efficient multiple support frequent pattern growth algorithm which we called “MSFP-growth” that enhancing the FPgrowth algorithm by making infrequent child node pruning step with multiple minimum support using maximum constrains. The algorithm is implemented, and it is compared with other common algorithms: Apriori-multiple minimum supports using maximum constraints and FP-growth. The experimental results show that the rule mining from the proposed algorithm are interesting and our algorithm achieved better performance than other algorithms without scarifying the accuracy. <\/p>\r\n","references":"[1] S. Brin, R. Motwani, J. Ullman, and S. Tsur, \u201cDynamic itemset counting\r\nand implication rules for market basket data,\u201d in SIGMOD-97, 1997, pp.\r\n255-264.\r\n[2] C. Aggarwal, and P. Yu \u201cOnline generation of association rule,\u201d in\r\nICDE-98, (1998), pp. 402-411.\r\n[3] R. Uday Kiran, P. Krishna Reddy , \u201cAn efficient approach to mine rare\r\nassociation rules using maximum items support constraints data Security\r\nand security data, \u201d Springer, vol. 6121, pp. 84-95,2010.\r\n[4] L. Troiano, G. Scibelli and C. Birtolo, \u201cA fast algorithm for Mining rare\r\nitemsets,\u201d in Conf. 2009 the Ninth IEEE International Conference on\r\nIntelligent Systems Design and Applications, pp. 1149-1155.\r\n[5] K. S. C. Sadhasivam, T. Angamuthu, \u201cMining rare Itemset with\r\nAutomated Support Thresholds,\u201d Computer Science J., vol. 7, pp. 394-\r\n399, 2011.\r\n[6] R. Agrawal, T. Imielinksi and A. Swami, \u201cMining association rules\r\nbetween sets of items in large database,\u201d in 1993The ACM SIGMOD\r\nConf., pp. 207\u2013216.\r\n[7] R. Agrawal and R. Srikant, \u201cFast algorithms for mining association\r\nrules,\u201d in 1994VLDB Conf., Santiago, Chile, Expanded version\r\navailable as IBM Research Report RJ9839.\r\n[8] Y. Lee, T. Hong and W. Lin, \u201cMining association rules with multiple\r\nminimum supports using maximum constraints,\u201d Elsevier Inc., 2005.\r\n[9] B. Liu, W. Hsu and Y. Ma, \u201cMining association rules with multiple\r\nminimum supports,\u201d in 1999The International Conf. on Knowledge\r\nDiscovery and Data Mining, pp. 337\u2013341.\r\n[10] J. Han, J. Pei and Y. Yin, \u201cMining frequent patterns without candidate\r\ngeneration,\u201d in 2000International Conf. on Management of data, vol. 29,\r\npp. 1-12.\r\n[11] Z. Sun, \u201cAnalysis and implementation of the algorithm of fp-growth,\u201d\r\nGuangxi Institute of Technology J., vol. 16, no. 3, pp. 64-67, 2004.\r\n[12] R. U. Kiran, P. K. Reddy, \u201cAn improved multiple minimum support\r\nbased approach to mine rare association rules,\u201d in 2009 IEEE Int. Conf.\r\nCommunications Computational Intelligence and Data Mining, pp. 340-\r\n347.\r\n[13] R. U. Kiran, P. K. Reddy , \u201cAn Improved Frequent Pattern growth\r\nApproach To Discover Rare Association rules,\u201d in 2009 International\r\nConf. on Knowledge Discovery and Information Retrieval, pp. 43-52.\r\n[14] S. Tsang, Y. S. Koh and G. Dobbie, \u201cFinding Interesting Rare\r\nAssociation Rules Using Rare Pattern Tree,\u201d The University of\r\nAuckland, Springer-Verlag Berlin Heidelberg,2013.\r\n[15] J. Pei, J. Han, B. Mortazavi-Asl, J. Wang, H. Pinto, Q. Chen, M. Hsu, ,\r\n\u201cMining sequential patterns by pattern-growth: the prefixspan\r\napproach,\u201d IEEE Trans. Knowledge and Data Engineering 16, 1424\u2013\r\n1440, 2004.\r\n[16] R. Srikant, Q. Vu, and R. Agrawal, \u201cMining association rules with item\r\nconstraints,\u201d KDD-97, pp. 67-73, 1997.\r\n[17] Y. Hu, F. Wu, Y. Liao, \u201cSequential pattern mining with multiple minimum\r\nsupports: a tree based approach\u201d, in 2010, The 2nd International\r\nConf. on Software Engineering and Data Mining, Chengdu, China.\r\n[18] J. Pie, J. Han, and L. Lakshmanan., \u201cMining frequent itemsets with\r\nconvertible constraints\u201d, in 2001 IEEE ICDE Conf., p.433\u2013 442.\r\n[19] M. S. Saravanan, R.J. Rama, \u201cPerformance study of Association Rule\r\nMining Algorithms for Dyeing Processing System Innovative Systems\r\nDesign and Engineering\u201d, Vol 2, No 5, 2011.\r\n[20] http:\/\/www.cs.waikato.ac.nz\/ml\/weka , Last acess : 6 march 2015 \r\n[21] M. Walaa, H. Ahmed and K. Hoda, \u201cCombined Algorithm for Data\r\nMining using Association rules,\u201d Ain Shams of Electrical Engineering\r\nJ., Vol. 1.No. 1 ISSN: 1687-8582, 2008.\r\n[22] P. Jyothi, V. D. Mytri, \u201cA Fast association rule algorithm based on\r\nbitmap computing with multiple minimum supports using max\r\nconstraints,\u201d International of Comp. Sci & Electronics J.,Volume1,Issue\r\n2, IJCSEE,2013.\r\n[23] F.A. Hoque , N. Easmin and K. Rashed, \u201c Frequent pattern mining for\r\nmultiple minimum supports with support tuning and tree maintenance on\r\nincremental database,\u201d Research of Information Technology J., 3(2): 79-\r\n90 ,2012. ","publisher":"World Academy of Science, Engineering and Technology","index":"Open Science Index 101, 2015"}