H-Map-Based Technique for Mining High Average Utility Itemset

References

• J. Han, and M. Kamber, Data Mining: Concepts and Techniques. San Francisco, CA: Elsevier, 1999.
   Google Scholar
• P. Fournier-Viger, J. Chun, W. Lin, R. U. Kiran, Y. S. Koh, and R. Thomas, “A survey of sequential pattern mining,” Data Sci. Pattern Recognit., Vol. 1, no. 1, pp. 54–77, 2017.
   Google Scholar
• A. Borah, and B. Nath, “Rare pattern mining: Challenges and future perspectives,” Complex Intell. Syst., Vol. 5, no. 1, pp. 1–23, 2019.
   Web of Science ®Google Scholar
• P. Fournier-Viger, J. C. W. Lin, B. Vo, T. T. Chi, J. Zhang, and H. B. Le, “A survey of itemset mining,” Wiley Interdiscip. Rev. Data Min. Knowl. Discov., Vol. 7, no. 4, 2017.
   Web of Science ®Google Scholar
• S. Datta, K. Mali, and S. Ghosh, “Mining frequent patterns partially devoid of dissociation with automated MMS specification strategy,” IETE J. Res., pp. 1–20, 2020.
   Web of Science ®Google Scholar
• C. F. Ahmed, S. K. Tanbeer, B. S. Jeong, and Y. K. Lee, “Efficient tree structures for high utility pattern mining in incremental databases,” IEEE Trans. Knowl. Data Eng., Vol. 21, no. 12, pp. 1708–21, 2009.
   Web of Science ®Google Scholar
• G. Grahne, and J. Zhu, “Fast algorithms for frequent itemset mining using FP-trees,” IEEE Trans. Knowl. Data Eng., Vol. 17, no. 10, pp. 1347–62, 2005.
   Web of Science ®Google Scholar
• M. J. Zaki, “Scalable algorithms for association mining,” IEEE Trans. Knowl. Data Eng., Vol. 12, no. 3, pp. 372–90, 2000.
   Web of Science ®Google Scholar
• J. Pei, J. Han, H. Lu, S. Nishio, S. Tang, and D. Yang, “H-mine: Hyper-structure mining of frequent patterns in large databases,” in Proceedings of IEEE International Conference on Data Mining, ICDM, San Jose, CA, 2001, pp. 441–8.
   Google Scholar
• Z. Li, F. Chen, J. Wu, Z. Liu, and W. Liu, “Efficient weighted probabilistic frequent itemset mining in uncertain databases,” Expert Syst., Vol. 38, no. 5, pp. 1–17, 2021.
   Web of Science ®Google Scholar
• J. Pillai, and O. P. Vyas, “Overview of itemset utility mining and its applications,” Int. J. Comput. Appl., Vol. 5, no. 11, pp. 9–13, 2010.
   Google Scholar
• R. Agarwal, A. Gautam, A. K. Saksena, A. Rai, and S. V. Karatangi, “Method for mining frequent item sets considering average utility,” in 2021 International Conference on Emerging Smart Computing and Informatics, ESCI 2021, Pune, Mar. 2021, pp. 275–8.
   Google Scholar
• Y. Liu, W. K. Liao, and A. Choudhary, “A fast high utility itemsets mining algorithm,” in Proceedings of 1st International Workshop on Utility-Based Data Mining, Chicago, IL, 2005, pp. 90–9.
   Google Scholar
• V. S. Tseng, C. W. Wu, B. E. Shie, and P. S. Yu, “UP-Growth: An efficient algorithm for high utility itemset mining,” in Proceedings of 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington, DC, 2010, pp. 253–62.
   Google Scholar
• M. Liu, and J. Qu, “Mining high utility itemsets without candidate generation,” in ACM International Conference on Information and Knowledge Management, November, 2012, pp. 55–64.
   Google Scholar
• G. C. Lan, T. P. Hong, and V. S. Tseng, “Efficiently mining high average-utility itemsets with an improved upper-bound strategy,” Int. J. Inf. Technol. Decis. Mak., Vol. 11, no. 5, pp. 1009–30, 2012.
   Web of Science ®Google Scholar
• 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.
   Web of Science ®Google Scholar
• T. Lu, B. Vo, H. T. Nguyen, and T. P. Hong, “A new method for mining high average utility itemsets,” Lect. Notes Comput. Sci. (Including Subser. Lect. Notes Artif. Intell. Lect. Notes Bioinformatics), Vol. 8838, pp. 33–42, 2014.
   Google Scholar
• I. Yildirim, and M. Celik, “An efficient tree-based algorithm for mining high average-utility itemset,” IEEE. Access., Vol. 7, pp. 144245–63, 2019.
   Google Scholar
• J. C. W. Lin, S. Ren, P. Fournier-Viger, T. P. Hong, J. H. Su, and B. Vo, “A fast algorithm for mining high average-utility itemsets,” Appl. Intell., Vol. 47, no. 2, pp. 331–46, 2017.
   Web of Science ®Google Scholar
• J. C. W. Lin, S. Ren, P. Fournier-Viger, and T. P. Hong, “EHAUPM: Efficient high average-utility pattern mining with tighter upper bounds,” IEEE. Access., Vol. 5, pp. 12927–40, 2017.
   Web of Science ®Google Scholar
• T. Truong, H. Duong, B. Le, and P. Fournier-Viger, “Efficient vertical mining of high average-utility itemsets based on novel upper-bounds,” IEEE Trans. Knowl. Data Eng., Vol. 31, no. 2, pp. 301–14, 2019.
   Web of Science ®Google Scholar
• R. Wu, and Z. He, “Top-k high average-utility itemsets mining with effective pruning strategies,” Appl. Intell., Vol. 48, no. 10, pp. 3429–45, 2018.
   Web of Science ®Google Scholar
• J. M. T. Wu, J. C. W. Lin, M. Pirouz, and P. Fournier-Viger, “TUB-HAUPM: tighter upper bound for mining high average-utility patterns,” IEEE. Access., Vol. 6, pp. 18655–69, 2018.
   Web of Science ®Google Scholar
• K. K. Sethi, and D. Ramesh, “A fast high average-utility itemset mining with efficient tighter upper bounds and novel list structure,” IEEE. Access., Vol. 76, no. 12, pp. 10288–318, 2020.
   Google Scholar
• 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–65, 2011.
   Web of Science ®Google Scholar
• 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. Informatics, Vol. 30, no. 2, pp. 233–43, 2016.
   Web of Science ®Google Scholar
• J. C. W. Lin, S. Ren, and P. Fournier-Viger, “MEMU: more efficient algorithm to mine high average-utility patterns with multiple minimum average-utility thresholds,” IEEE. Access., Vol. 6, pp. 7593–609, 2018.
   Web of Science ®Google Scholar
• T. Truong, H. Duong, B. Le, P. Fournier-Viger, and U. Yun, “Efficient high average-utility itemset mining using novel vertical weak upper-bounds,” Knowledge-Based Syst., Vol. 183, pp. 104847, 2019.
   Web of Science ®Google Scholar
• J. M. T. Wu, Q. Teng, J. C. W. Lin, and C. F. Cheng, “Incrementally updating the discovered high average-utility patterns with the pre-large concept,” IEEE. Access., Vol. 8, pp. 66788–98, 2020.
   Web of Science ®Google Scholar
• J. M. T. Wu, J. C. W. Lin, M. Pirouz, and P. Fournier-Viger, “TUB-HAUPM: tighter upper bound for mining high average-utility patterns,” IEEE. Access., Vol. 6, pp. 18655–69, 2018.
   Web of Science ®Google Scholar