Advertisement

A Survey of High Utility Pattern Mining Algorithms for Big Data

  • Morteza ZihayatEmail author
  • Mehdi Kargar
  • Jaroslaw Szlichta
Chapter
Part of the Studies in Big Data book series (SBD, volume 51)

Abstract

High utility pattern mining is an essential data mining task with a goal of extracting knowledge in the form of patterns. A pattern is called a high utility pattern if its utility, defined based on a domain objective, is no less than a minimum utility threshold. Several high utility pattern mining algorithms have been proposed in the last decade, yet most do not scale to the type of data we are nowadays dealing with, the so-called big data. This chapter aims to provide a comprehensive overview and a big-picture to readers of high utility pattern mining in big data. We first review the problem of high utility pattern mining and related technologies, such as Apache Spark, Apache Hadoop, and parallel and distributed processing. Then, we review recent advances in parallel and scalable high utility pattern mining, analyzing them through the big data point of view and indicate challenges to design parallel high utility pattern mining algorithms. In particular, we study two common types of high utility patterns, i.e., high utility itemsets (HUIs) and high utility sequential patterns (HUSPs). The chapter is concluded with a discussion of open problems and future directions.

References

  1. 1.
    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, 1708–1721 (2009)CrossRefGoogle Scholar
  2. 2.
    Ahmed, C.F., Tanbeer, S.K., Jeong, B.: A novel approach for mining high-utility sequential patterns in sequence databases. ETRI J. 32, 676–686 (2010)CrossRefGoogle Scholar
  3. 3.
    Ahmed, C.F., Tanbeer, S., Jeong, B.: A framework for mining high utility web access sequences. IETE J. 28, 3–16 (2011)Google Scholar
  4. 4.
    Ahmed, C.F., Tanbeer, S.K., Jeong, B.: A framework for mining high utility web access sequences. IETE J. 28, 3–16 (2011)Google Scholar
  5. 5.
    Ahmed, C.F., Tanbeer, S.K., Jeong, B.S.: Interactive mining of high utility patterns over data streams. Expert Syst. Appl. 39, 11979–11991 (2012)CrossRefGoogle Scholar
  6. 6.
    Borthakur, D.: The hadoop distributed file system: architecture and design. Hadoop Project Website 11(2007), 21 (2007)Google Scholar
  7. 7.
    Cao, L., Zhao, Y., Zhang, H., Luo, D., Zhang, C., Park, E.: Flexible frameworks for actionable knowledge discovery. IEEE Trans. Knowl. Data Eng. 22(9), 1299–1312 (2010)CrossRefGoogle Scholar
  8. 8.
    Chan, R., Yang, Q., Shen, Y.: Mining high-utility itemsets. In: Proceedings of Third IEEE International Conference on Data Mining, pp. 19–26 (2003)Google Scholar
  9. 9.
    Chen, Y., An, A.: Approximate parallel high utility itemset mining. Big Data Res. 6(Supplement C), 26–42 (2016).  https://doi.org/10.1016/j.bdr.2016.07.001. http://www.sciencedirect.com/science/article/pii/S2214579616300089CrossRefGoogle Scholar
  10. 10.
    Dawar, S., Sharma, V., Goyal, V.: Mining top-k high-utility itemsets from a data stream under sliding window model. Appl. Intell. 47(4), 1240–1255 (2017)CrossRefGoogle Scholar
  11. 11.
    Erwin, A., Gopalan, R.P., Achuthan, N.R.: Efficient Mining of High Utility Itemsets from Large Datasets, pp. 554–561. Springer, Berlin (2008)Google Scholar
  12. 12.
    Grama, A.: Introduction to Parallel Computing. Pearson Education (2003)Google Scholar
  13. 13.
    Kashyap, H., Ahmed, H.A., Hoque, N., Roy, S., Bhattacharyya, D.K.: Big data analytics in bioinformatics: a machine learning perspective. CoRR abs/1506.05101 (2015). http://arxiv.org/abs/1506.05101
  14. 14.
    Kim, D., Yun, U.: Mining high utility itemsets based on the time decaying model. Intell. Data Anal. 20(5), 1157–1180 (2016)CrossRefGoogle Scholar
  15. 15.
    Kitchin, R.: Big Data. Wiley (2016).  https://doi.org/10.1002/9781118786352.wbieg0145
  16. 16.
    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: Proceedings of the 8th IEEE International Conference on Data Mining, pp. 881–886 (2008)Google Scholar
  17. 17.
    Lin, Y.C., Wu, C.W., Tseng, V.S.: Mining High Utility Itemsets in Big Data, pp. 649–661. Springer International Publishing, Cham (2015)CrossRefGoogle Scholar
  18. 18.
    Liu, Y., Liao, W.K., Choudhary, A.: A fast high utility itemsets mining algorithm. In: Proceedings of the 1st International Workshop on Utility-Based Data Mining, pp. 90–99 (2005)Google Scholar
  19. 19.
    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
  20. 20.
    Marz, N.: Storm: distributed and fault-tolerant realtime computation (2013)Google Scholar
  21. 21.
    Mitchell, A., Page, D.: State of the news media 2015. In: Pew Research Journalism Project (2015). http://www.journalism.org/files/2015/04/FINAL-STATE-OF-THE-NEWS-MEDIA1.pdf
  22. 22.
    Mooney, C.H., Roddick, J.F.: Sequential pattern mining approaches and algorithms. ACM Comput. Surv. 45(2), 19:1–19:39 (2013)Google Scholar
  23. 23.
    Neumeyer, L., Robbins, B., Nair, A., Kesari, A.: S4: distributed stream computing platform. In: 2010 IEEE International Conference on Data Mining Workshops, (ICDMW), pp. 170–177. IEEE (2010)Google Scholar
  24. 24.
    Shie, B., Hsiao, H., Tseng, V.S.: Efficient algorithms for discovering high utility user behavior patterns in mobile commerce environments. KAIS J. 37 (2013)CrossRefGoogle Scholar
  25. 25.
    Shie, B.E., Yu, P.S., Tseng, V.S.: Efficient algorithms for mining maximal high utility itemsets from data streams with different models. Expert Syst. Appl. 39, 12947–12960 (2012)CrossRefGoogle Scholar
  26. 26.
    Spark, A.: Apache spark: lightning-fast cluster computing (2016)Google Scholar
  27. 27.
    Subramanian, K., Kandhasamy, P., Subramanian, S.: A novel approach to extract high utility itemsets from distributed databases. Comput. Inform. 31(6+), 1597–1615 (2013)Google Scholar
  28. 28.
    Szlichta, J., Godfrey, P., Golab, L., Kargar, M., Srivastava, D.: Effective and complete discovery of order dependencies via set-based axiomatization. In: Proceedings of the VLDB Endowment, vol. 10, no. 7, pp. 721–732 (2017)CrossRefGoogle Scholar
  29. 29.
    Tseng, V.S., Chu, C.J., Liang, T.: Efficient mining of temporal high-utility itemsets from data streams. In: ACM KDD Utility Based Data Mining, pp. 18–27 (2006)Google Scholar
  30. 30.
    Tseng, V.S., Wu, C.W., Shie, B.E., Yu, P.S.: Up-growth: an efficient algorithm for high utility itemset mining. In: Proceedings of International Conference on ACM SIGKDD, pp. 253–262 (2010)Google Scholar
  31. 31.
    Vo, B., Nguyen, H., Ho, T.B., Le, B.: Parallel Method for Mining High Utility Itemsets from Vertically Partitioned Distributed Databases, pp. 251–260. Springer, Berlin (2009)Google Scholar
  32. 32.
    Yin, J., Zheng, Z., Cao, L., Song, Y., Wei, W.: Efficiently mining top-k high utility sequential patterns. In: IEEE 13th International Conference on Data Mining (ICDM), pp. 1259–1264 (2013)Google Scholar
  33. 33.
    Yin, J., Zheng, Z., Cao, L.: Uspan: an efficient algorithm for mining high utility sequential patterns. In: Proceedings of ACM SIGKDD, pp. 660–668 (2012)Google Scholar
  34. 34.
    Yu, G., Li, K., Shao, S.: Mining high utility itemsets in large high dimensional data. In: First International Workshop on Knowledge Discovery and Data Mining (WKDD), pp. 17–20 (2008).  https://doi.org/10.1109/WKDD.2008.64
  35. 35.
    Zida, S., Fournier-Viger, P., Lin, J.C.W., Wu, C.W., Tseng, V.S.: Efim: a fast and memory efficient algorithm for high-utility itemset mining. Knowl. Inf. Syst. 51(2), 595–625 (2017).  https://doi.org/10.1007/s10115-016-0986-0CrossRefGoogle Scholar
  36. 36.
    Zihayat, M., An, A., Golab, L., Kargar, M., Szlichta, J.: Authority-based team discovery in social networks. In: Proceedings of the 20th International Conference on Extending Database Technology, EDBT 2017, Venice, Italy, March 21–24, 2017, pp. 498–501 (2017).  https://doi.org/10.5441/002/edbt.2017.54
  37. 37.
    Zihayat, M., Chen, Y., An, A.: Memory-adaptive high utility sequential pattern mining over data streams. Mach. Learn. 106(6), 799–836 (2017).  https://doi.org/10.1007/s10994-016-5617-1MathSciNetCrossRefGoogle Scholar
  38. 38.
    Zihayat, M., Davoudi, H., An, A.: Mining significant high utility gene regulation sequential patterns. BMC Syst. Biol. 11(6), 109 (2017).  https://doi.org/10.1186/s12918-017-0475-4
  39. 39.
    Zihayat, M., Hu, Z.Z., An, A., Hu, Y.: Distributed and parallel high utility sequential pattern mining. In: 2016 IEEE International Conference on Big Data, pp. 853–862 (2016).  https://doi.org/10.1109/BigData.2016.7840678
  40. 40.
    Zihayat, M., Wu, C.W., An, A., Tseng, V.S.: Mining high utility sequential patterns from evolving data streams. In: ASE BD&SI 2015, pp. 52:1–52:6 (2015)Google Scholar
  41. 41.
    Zihayat, M., An, A.: Mining top-k high utility patterns over data streams. Inf. Sci. 285, 138–161 (2014)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  • Morteza Zihayat
    • 1
    Email author
  • Mehdi Kargar
    • 1
  • Jaroslaw Szlichta
    • 2
  1. 1.Ted Rogers School of Information Technology ManagementRyerson UniversityTorontoCanada
  2. 2.Faculty of ScienceUniversity of Ontario Institute of TechnologyOshawaCanada

Personalised recommendations