Abstract
High Utility Quantitative Itemset Mining (HUQIM), which is an extension of the original High Utility Itemset Mining (HUIM), has become an important research area that answers the ever-growing need for useful information from the copious pool of data in reality. Due to the nature of the HUQIM problem, its search space is huge and could heavily affect the execution time. Thus, the recently proposed FHUQI-Miner has overcome these limits with novel pruning strategies to narrow the space and outperform previously introduced algorithms. However, there are certain shortcomings that the algorithm still faces. One of the limitations is that the proposed strategies would not operate as efficiently on dense datasets as they would on sparse datasets, resulting from the similarity in structure of the transactions and thus increasing the number of join operations in progress. To address this limitation, this work introduces an enhanced version of the FHUQI-Miner algorithm with an improved TQCS structure to reduce mining time and the number of joins performed.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Yao, H., Hamilton, H.J.: Mining itemset utilities from transaction databases. Data Knowl. Eng. 59(3), 603–626 (2006)
Zhang, C., Han, M., Sun, R., Du, S., Shen, M.: A survey of key technologies for high utility patterns mining. IEEE Access 8, 55798–55814 (2020)
Fournier-Viger, P., Chun-Wei Lin, J., Truong-Chi, T., Nkambou, R.: A survey of high utility itemset mining. In: Fournier-Viger, P., Lin, J.C.-W., Nkambou, R., Vo, B., Tseng, V.S. (eds.) High-Utility Pattern Mining. SBD, vol. 51, pp. 1–45. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-04921-8_1
Gan, W., Lin, J.C.-W., Fournier-Viger, P., Chao, H.-C., Tseng, V.S., Yu, P.S.: A survey of utility-oriented pattern mining. IEEE Trans. Knowl. Data Eng. 33(4), 1306–1327 (2021)
Li, C.-H., Wu, C.-W., Huang, J., Tseng, V.S.: An efficient algorithm for mining high utility quantitative itemsets. In: 2019 International Conference on Data Mining Workshops (ICDMW), pp. 1005–1012 (2019)
Nouioua, M., Fournier-Viger, P., Wu, C.-W., Lin, J.C.-W., Gan, W.: FHUQI-miner: fast high utility quantitative itemset mining. Appl. Intell. (2021)
Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: 20th International Conference on Very Large Data Bases (VLDB 1994), pp. 487–499 (1994)
Yao, H., Hamilton, H.J., Butz, G.J.: A foundational approach to mining itemset utilities from databases. In: SIAM International Conference on Data Mining, vol. 4, pp. 482–486 (2004)
Liu, Y., Liao, W.K., Choudhary, A.: A two-phase algorithm for fast discovery of high utility itemsets. In: 9th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining, vol. 3518, pp. 689–695 (2005)
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)
Le, B., Nguyen, H., Cao, T.A., Vo, B.: A novel algorithm for mining high utility itemsets. In: First Asian Conference on Intelligent Information and Database Systems, pp. 13–17 (2009)
Liu, M., Qu, J.: Mining high utility itemsets without candidate generation. In: ACM International Conference on Information and Knowledge Management, CIKM, pp. 55–64 (2012)
Zida, S., Fournier-Viger, P., Wu, C.-W., Lin, J.C.-W., Tseng, V.S.: Efficient mining of high-utility sequential rules. In: Machine Learning and Data Mining in Pattern Recognition, pp. 157–171 (2015)
Nguyen, L.T.T., Nguyen, P., Nguyen, T.D.D., Vo, B., Fournier-Viger, P., Tseng, V.S.: Mining high-utility itemsets in dynamic profit databases. Knowl.-Based Syst. 175, 130–144 (2019)
Yen, S.-J., Lee, Y.-S.: Mining high utility quantitative association rules. In: Data Warehousing and Knowledge Discovery, pp. 283–292 (2007)
Fournier-Viger, P., et al.: The SPMF open-source data mining library version 2. In: Berendt, B., et al. (eds.) ECML PKDD 2016. LNCS (LNAI), vol. 9853, pp. 36–40. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-46131-1_8
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Nguyen, L.T.T., Pham, A.N.H., Nguyen, T.D.D., Kozierkiewicz, A., Vo, B., Tung, N.T. (2023). Efficient Pruning Strategy for Mining High Utility Quantitative Itemsets. In: Nguyen, N.T., et al. Advances in Computational Collective Intelligence. ICCCI 2023. Communications in Computer and Information Science, vol 1864. Springer, Cham. https://doi.org/10.1007/978-3-031-41774-0_26
Download citation
DOI: https://doi.org/10.1007/978-3-031-41774-0_26
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-41773-3
Online ISBN: 978-3-031-41774-0
eBook Packages: Computer ScienceComputer Science (R0)