Advertisement

Mining High-Utility Irregular Itemsets

  • Supachai Laoviboon
  • Komate AmphawanEmail author
Chapter
Part of the Studies in Big Data book series (SBD, volume 51)

Abstract

High-utility itemset mining (HUIM) currently plays an important role in a wide range of applications and data mining community. Several algorithms, methods and data structures have been proposed to improve efficiency of mining for such itemsets. Besides, HUIM is extended in several aspects including the regarding of “regularity or irregularity of occurrence” on high utility itemsets. This leads to the emerging of high-utility regular itemsets mining (HURIM) and high-utility irregular itemsets mining (HUIIM) which can help to observe occurrence behavior of high utility itemsets. Based on HURIM, the regularity threshold is applied to measure interestingness of itemsets and to prune search space. However, on HUIIM, the threshold cannot help to prune uninteresting itemsets causing this task consumes high computational cost. Thus, in this paper, we here present a single-pass algorithm, called HUIIM (High-Utility Irregular Itemset Miner), for efficiently mining high-utility irregular itemsets. The new-modified utility list structure (NUL) is applied for maintaining occurrence information simultaneously with utility value of an itemset and also for fast calculation of total utility of the itemset. Moreover, a new pruning technique is designed and applied to improve computational performance of HUIIM. Experimental studies were conducted on synthetic and real datasets to show efficiency of HUIIM (with and without the new pruning technique) in the terms of computational time and memory usage.

Notes

Acknowledgements

This work was financially supported by the Research Grant of Burapha University through National Research Council of Thailand (Grant no. 15/2561).

References

  1. 1.
    Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: VLDB, pp. 487–499 (1994)Google Scholar
  2. 2.
    Ahmed, C.F., Tanbeer, S.K., Jeong, B.S., Lee, Y.K.: Efficient tree structures for high utility pattern mining in incremental databases. IEEE Trans. Knowl. Data Eng. 21(12), 1708–1721 (2009)CrossRefGoogle Scholar
  3. 3.
    Ahmed, C.F., Tanbeer, S.K., Jeong, B.: Mining high utility web access sequences in dynamic web log data. In: Proceeding of the International Conference on Software Engineering Artificial Intelligence Networking and Parallel/Distributed Computing. IEEE, London, UK, June 2010, pp. 76–81 (2010)Google Scholar
  4. 4.
    Ahmed, C.F., Tanbeer, S.K., Jeong, B.S., Lee, Y.-K.: HUC-prune: an efficient candidate pruning technique to mine high utility patterns. Appl. Intell. 34(2), 181–198 (2011)CrossRefGoogle Scholar
  5. 5.
    Amphawan, K., Surarerks, A.: Pushing regularity constraint on high utility itemsets mining. In: 2015 2nd International Conference on Advanced Informatics: Concepts, Theory and Applications (ICAICTA), pp. 1–6 (2015)Google Scholar
  6. 6.
    Amphawan, K., Lenca, P.: Mining Top-k frequent/regular patterns based on user-given trade-off between frequency and regularity, pp. 1–12 (2013)Google Scholar
  7. 7.
    Amphawan, K., Lenca, P.: Mining top-k frequent-regular closed patterns. Expert Syst. Appl. 42(21), 7882–7894 (2015)CrossRefGoogle Scholar
  8. 8.
    Amphawan, K., Lenca, P., Surarerks, A.: Mining top-k periodic-frequent patterns without support threshold. In: Proceedings of the 3rd International Conference on Advances in Information Technology, vol. 55, pp. 18–29 (2009)Google Scholar
  9. 9.
    Amphawan, K., Lenca, P., Jitpattanakul, A., Surarerks, A.: Mining high utility itemsets with regular occurrence. J. ICT Res. Appl. 10(2), 153–176 (2016)CrossRefGoogle Scholar
  10. 10.
    Chan, R., Yang, Q., Shen, Y.-D.: Mining high utility itemsets. In: Third IEEE International Conference on Data Mining, 2003. ICDM 2003, pp. 19–26 (2003)Google Scholar
  11. 11.
    Chang, J.H., Lee, W.S.: Finding recent frequent itemsets adaptively over online data streams. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 487–492. ACM (2003)Google Scholar
  12. 12.
    Dam, T.-L.: PHM: mining periodic high-utility itemsets. In: Advances in Data Mining. Applications and Theoretical Aspects: 16th Industrial Conference, ICDM 2016, New York, NY, USA, 13–17 July 2016. Proceedings, vol. 9728, p. 64. Springer (2016)Google Scholar
  13. 13.
    Dinh, T., Huynh, V.-N., Le, B.: Mining periodic high utility sequential patterns. In: Asian Conference on Intelligent Information and Database Systems, pp. 545–555. Springer (2017)Google Scholar
  14. 14.
    Dong, G., Li, J.: Efficient mining of emerging patterns: discovering trends and differences. In: Proceedings of the Fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 43–52. ACM (1999)Google Scholar
  15. 15.
    Duong, Q.-H., Fournier-Viger, P., Ramampiaro, H., Nørvåg, K., Dam, T.-L.: Efficient high utility itemset mining using buffered utility-lists. Appl. Intell. (2017)Google Scholar
  16. 16.
    Eisariyodom, S., Amphawan, K.: Discovering interesting itemsets based on change in regularity of occurrence. In: 2017 9th International Conference on Knowledge and Smart Technology (KST), pp. 138–143. IEEE (2017)Google Scholar
  17. 17.
    Fournier-Viger, P., Zida, S.: FOSHU: faster on-shelf high utility itemset mining – with or without negative unit profit. In: Proceedings of the 30th Annual ACM Symposium on Applied Computing, SAC’15, pp. 857–864 (2015)Google Scholar
  18. 18.
    Fournier-Viger, P., Wu, C.-W., Zida, S., Tseng, V.S.: FHM: faster high-utility itemset mining using estimated utility co-occurrence pruning, pp. 83–92 (2014)Google Scholar
  19. 19.
    Gouda, K., Zaki, M.J.: Efficiently mining maximal frequent itemsets. In: Proceedings IEEE International Conference on Data Mining, 2001. ICDM 2001, pp. 163–170. IEEE (2001)Google Scholar
  20. 20.
    Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, SIGMOD’00, pp. 1–12 (2000)Google Scholar
  21. 21.
    Klangwisan, K., Amphawan, K.: Mining weighted-frequent-regular itemsets from transactional database. In: 2017 9th International Conference on Knowledge and Smart Technology (KST), pp. 66–71. IEEE (2017)Google Scholar
  22. 22.
    Krishnamoorthy, S.: Pruning strategies for mining high utility itemsets. Expert Syst. Appl. 42(5), 2371–2381 (2015)CrossRefGoogle Scholar
  23. 23.
    Krishnamoorthy, S.: Efficiently mining high utility itemsets with negative unit profits. Knowl.-Based Syst. (2017)Google Scholar
  24. 24.
    Lan, G.-C., Hong, T.-P., Tseng, V.S.: Discovery of high utility itemsets from on-shelf time periods of products. Expert Syst. Appl. 38(5), 5851–5857 (2011)CrossRefGoogle Scholar
  25. 25.
    Laoviboon, S., Amphawan, K.: Mining high-utility itemsets with irregular occurrence. In: 2017 9th International Conference on Knowledge and Smart Technology (KST), pp. 89–94. IEEE (2017)Google Scholar
  26. 26.
    Li, H.-F., Lee, S.-Y.: Mining frequent itemsets over data streams using efficient window sliding techniques. Expert Syst. Appl. 36(2), 1466–1477 (2009)CrossRefGoogle Scholar
  27. 27.
    Li, H.-F., Huang, H.-Y., Chen, Y.-C., Liu, Y.-J., Lee, S.-Y.: Fast and memory efficient mining of high utility itemsets in data streams. In: Eighth IEEE International Conference on Data Mining, 2008. ICDM’08, pp. 881–886. IEEE (2008)Google Scholar
  28. 28.
    Lin, C.-W., Hong, T.-P., Lan, G.-C., Wong, J.-W., Lin, W.-Y.: Efficient updating of discovered high-utility itemsets for transaction deletion in dynamic databases. Adv. Eng. Inform. 29(1), 16–27 (2015)CrossRefGoogle Scholar
  29. 29.
    Lin, J.C.-W., Fournier-Viger, P., Gan, W.: FHN: an efficient algorithm for mining high-utility itemsets with negative unit profits. Knowl.-Based Syst. 111, 283–298 (2016)CrossRefGoogle Scholar
  30. 30.
    Lin, J.C.-W., Zhang, J., Fournier-Viger, P., Hong, T.-P., Chen, C.-M., Su, J.-H.: Efficient mining of short periodic high-utility itemsets. In: 2016 IEEE International Conference on Systems, Man, and Cybernetics (SMC), pp. 003083–003088. IEEE (2016)Google Scholar
  31. 31.
    Lin, J.C.-W., Ren, S., Fournier-Viger, P., Hong, T.-P., Su, J.-H., Vo, B.: A fast algorithm for mining high average-utility itemsets. Appl. Intell. 47(2), 331–346 (2017)CrossRefGoogle Scholar
  32. 32.
    Lin, J.C.-W., Zhang, J., Fournier-Viger, P., Hong, T.-P., Zhang, J.: A two-phase approach to mine short-period high-utility itemsets in transactional databases. Adv. Eng. Inform. 33, 29–43 (2017)CrossRefGoogle Scholar
  33. 33.
    Liu, M., Qu, J.: Mining high utility itemsets without candidate generation. In: Proceedings of the 21st ACM International Conference on Information and Knowledge Management, pp. 55–64 (2012)Google Scholar
  34. 34.
    Liu, Y., Cheng, C., Tseng, V.S.: Mining differential top-k co-expression pattern from time course comparative gens expression datasets. In: Proceeding of the International Conference on Communication, Computing, and Security. CRC Press, Gurgaon, India, September 2016, p. 230 (2013)CrossRefGoogle Scholar
  35. 35.
    Liu, Y., Liao, W.-K., Choudhary, A.: A two-phase algorithm for fast discovery of high utility itemsets. Adv. Knowl. Discov. Data Min. 3518, 689–695 (2005)Google Scholar
  36. 36.
    Mai, T., Vo, B., Nguyen, L.T.T.: A lattice-based approach for mining high utility association rules. Inf. Sci. 399, 81–97 (2017)CrossRefGoogle Scholar
  37. 37.
    Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Discovering frequent closed itemsets for association rules. In: International Conference on Database Theory, pp. 398–416. Springer (1999)Google Scholar
  38. 38.
    Pei, J., Han, J., Mao, R., et al.: Closet: an efficient algorithm for mining frequent closed itemsets. In: ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, vol. 4, pp. 21–30 (2000)Google Scholar
  39. 39.
    Podpecan, V., Lavrac, N., Kononenko, I.: A fast algorithm for mining utility-frequent itemsets. In: Constraint-Based Mining and Learning, p. 9 (2007)Google Scholar
  40. 40.
    Ryang, H., Yun, U.: Top-k high utility pattern mining with effective threshold raising strategies. Knowl-Based Syst. 76, 109–126 (2015)CrossRefGoogle Scholar
  41. 41.
    Shie, B.-E., Hsiao, H.-F., Tseng, V., Philip, Y.: Mining high utility mobile sequential patterns in mobile commerce environments. In: Database Systems for Advanced Applications, pp. 224–238. Springer (2011)Google Scholar
  42. 42.
    Shie, B.-E., Hsiao, H.-F., Tseng, V.S.: Efficient algorithms for discovering high utility user behavior patterns in mobile commerce environments. In: Knowledge and Information Systems, pp. 1–25 (2013)Google Scholar
  43. 43.
    Tanbeer, S., Ahmed, C., Jeong, B.-S.: Mining regular patterns in data streams. In: Database Systems for Advanced Applications, pp. 399–413. Springer (2010)Google Scholar
  44. 44.
    Tanbeer, S.K., Ahmed, C.F., Jeong, B.-S., Lee, Y.K.: Discovering periodic-frequent patterns in transactional databases. In: Proceedings of the 13th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining, pp. 242–253 (2009)CrossRefGoogle Scholar
  45. 45.
    Tanbeer, S.K., Ahmed, C.F., Jeong, B.-S.: Mining regular patterns in incremental transactional databases. In: 2010 12th International Asia-Pacific Web Conference (APWEB), pp. 375–377. IEEE (2010)Google Scholar
  46. 46.
    Tao, F., Murtagh, F., Farid, M.: Weighted association rule mining using weighted support and significance framework. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 661–666. ACM (2003)Google Scholar
  47. 47.
    Thilagu, M., Nadatajan, R.: Efficiently mining of effective web traversal pattern with average utility. In: Proceeding of the International Conference on Communication, Computing, and Security. CRC Press, Gurgaon, India, September 2016, pp. 444–451 (2016)CrossRefGoogle Scholar
  48. 48.
    Tseng, V.S., Shie, B.E., Wu, C.W., Yu, P.S.: Efficient algorithms for mining high utility itemsets from transactional databases. IEEE Trans. Knowl. Data Eng. 25(8), 1772–1786 (2013)CrossRefGoogle Scholar
  49. 49.
    Tseng, V.S., Wu, C.W., Fournier-Viger, P., Yu, P.S.: Efficient algorithms for mining top-k high utility itemsets. IEEE Trans. Knowl. Data Eng. 28(1), 54–67 (2016)CrossRefGoogle Scholar
  50. 50.
    Tseng, V.S., Shie, B.E., Wu, C.W., Yu, P.S.: Up-growth: an efficient algorithm for high utility itemset mining. In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 18–27 (2010)Google Scholar
  51. 51.
    Yun, U., Kim, D.: Mining of high average-utility itemsets using novel list structure and pruning strategy. Future Gener. Comput. Syst. 68, 346–360 (2017)CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Computational Innovation LaboratoryBurapha UniversityChonburiThailand

Personalised recommendations