Mining of High Average-Utility Pattern Using Multiple Minimum Thresholds in Big DataAuthor : R. Vasumathi and S. Murugan
Volume 8 No.2 Special Issue:March 2019 pp 57-60
In the past years most of the research have been conducted on high average-utility itemset mining (HAUIM) with wide applications. However, most of the methods are used for centralized databases with a single machine performing the mining job. Existing algorithms cannot be applied for big data. We try to solve this issue, by developing a new method for mining high average-utility itemset mining in big data. Map Reduce also used in this paper. Many algorithms were proposed only mine HAUIs using a single minimum high average-utility threshold. In this paper we also try solve this by mining HAUIs multiple minimum high average-utility thresholds. We have developed two pruning methods namely Reduction of utility co-occurrence pruning Method (RUCPM) and Pruning without Scanning Database (PWSD).
Data Mining, Frequent Itemset Mining, High Average Utility Mining, Big Data, Map Reduce
 R. Agarwal, T. Imielinski, and A. Swami, “Database mining: a performance perspective”, IEEE Trans. Knowl. Data Eng, Vol. 5, No.6, pp.914–925 1993.
 Y.Liu, W. Liao, and A.K Choudhary, “A two-phase algorithm for fast discovery of high utility itemsets”, Springer,Vol. 3518, pp. 689–695, 2005
 T.P Hong, C.H. Lee and S.L. Wang, “Effective utility mining with the measure of average utility”, Expert Syst. Appl. Vol. 38, No. 7, pp. 8259–8265, 2011.
 C.W.Lin, T.P.Hong, and W.H,Lu,” Efficiently mining high average utility itemsets with a tree structure”, Springer,Vol. 5990, pp. 131–139, 2010.
 G.C. Lan, T.P. Hong, and V.S. Tseng, “A projection-based approach for discovering high average-utility itemsets” , J. Inf. Sci. Eng.Vol. 28, No.1, pp. 193–209, 2012.
 T.P. Hong, C.H. Lee, and S.L. Wang, “Effective utility mining with the measure of average utility”, Expert Syst. Appl., Vol. 38, No. 7, pp. 8259_8265, 2011.
 J.C.W. Lin, S. Ren, and P. Fournier-Viger, “EHAUPM: Efficient high average-utility pattern mining with tighter upper bounds”, IEEE Access, Vol. 5, pp. 12927_12940, 2017.
 T. Lu, B. Vo, H. T. Nguyen, and T.P. Hong, “A new method for mining high average utility itemsets”, J.Computer Information Systems and Industrial Management. Springer, pp. 33-42, 2014.
 J. C.W. Lin, T. Li, P. Fournier-Viger, T.P. Hong, J. Zhan, and M. Voznak, “An efficient algorithm to mine high average-utility itemsets”, Adv. Eng. Informat., Vol. 30, No. 2, pp. 233 – 243, 2016.
 Jerry Chun-Wei Lin, Shifeng Ren, and Philippe Fournier-Viger “MEMU: More Efficient Algorithm to Mine High Average-Utility Patterns with Multiple Minimum Average-Utility Thresholds”, IEEE Access, Vol. 6, 2018.
 J. C.W. Lin, T. Li, P. Fournier-Viger, T.P. Hong and J.-H. Su, “Efficient mining of high average-utility itemsets with multiple minimum thresholds”, Proc. Ind. Conf. Data Mining, pp. 14 – 28, 2016.
 C.W. Lin, T.P. Hong, and W. H. Lu, “Efficiently mining high average utility item sets with a tree structure”, Proc. Int. Conf. Intell. Inf. Database Syst., pp. 131 – 139, 2010.
 R. Agrawal, and R. Srikant, “Fast algorithms for mining association rules in large databases”, In International Conference on Very Large Data Bases, pp. 487–499 1994.
 R. Chan, Q. Yang, and Y.D. Shen, “Mining high utility itemsets”, In IEEE International Conference on Data Mining, pp. 19–26, 2003.