Abstract
Patterns discovered through mining approaches often result in a large number of findings. Analyzing these patterns can be a time-consuming process. Since the early days of pattern mining, compact representations of patterns have been utilized alongside regular patterns. There are two types of compact representations: closed and maximal. Pattern mining approaches, such as frequent pattern mining (FPM) or high-utility pattern mining (HUPM), have incorporated these compact representations to reduce the number of outcomes while still preserving insights from the databases. Recently, the HUPM task has been extended to handle hierarchical transaction databases, significantly enlarging the search space compared to traditional transaction databases. Consequently, the number of discovered patterns has also increased. However, approaches have yet to be proposed to address this issue. Therefore, this study proposes new techniques for mining multi-level maximal high-utility patterns from hierarchical transaction databases. Additionally, we introduce a novel algorithm called MaxMinerML, which efficiently solves this task by leveraging these techniques. Empirical evaluations on real-world databases have demonstrated that MaxMinerML is efficient in memory usage and mining time.
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
Agrawal, R., Imieliński, T., Swami A.: Mining asso-ciation rules between sets of items in large data-bases. ACM SIGMOD Rec. 22, 207–216 (1993)
Yao, H., Hamilton, H.J., Butz, G.J.: A foundational ap-proach to mining itemset utilities from databases. In: SIAM International Conference on Data Mining, pp. 482–486 (2004)
Liu, M., Qu, J.: Mining high utility itemsets without candidate generation. In: ACM International Confer-ence Proceeding Series, pp. 55–64 (2012)
Tung, N.T., Nguyen, L.T.T., Nguyen, T.D.D., Fourier-Viger, P., Nguyen, N.T., Vo, B.: Efficient mining of cross-level high-utility itemsets in taxonomy quantitative databases. Inf Sci (N Y) 587, 41–62 (2022)
Fournier-Viger, P., Wu, C.W., Zida, S., Tseng, V.S.: FHM: faster high-utility itemset mining using estimated utility co-occurrence pruning. In: International Symposium on Methodologies for Intelligent Systems, pp. 83–92 (2014)
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, 595–625 (2017)
Wu, C.W., Fournier-Viger, P., Gu, J.Y., Tseng, V.S.: Mining closed+ high utility itemsets without candidate generation. In: TAAI 2015 - 2015 Conference on Technologies and Applications of Artificial Intelligence, pp. 187–194. IEEE (2016)
Dam, T.L., Li, K., Fournier-Viger, P., Duong, Q.H.: CLS-Miner: efficient and effective closed high-utility itemset mining. Front. Comput. Sci. 13, 357–381 (2019)
Fournier-Viger, P., Zida, S., Lin, J.CW., Wu, CW., Tseng, V.S.: EFIM-Closed: fast and memory efficient discovery of closed high-utility itemsets. In: Perner, P. (eds.) Machine Learning and Data Mining in Pattern Recognition. MLDM 2016. LNCS, vol. 9729, pp 199–213. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-41920-6_15
Nguyen, T.D.D., Nguyen, L.T.T., Vu, L., Vo, B., Pedrycz, W.: Efficient algorithms for mining closed high utili-ty itemsets in dynamic profit databases. Expert Syst. Appl. 186, 115741 (2021)
Nguyen, L.T.T., Vu, D.B., Nguyen, T.D.D., Vo, B.: Min-ing maximal high utility itemsets on dynamic profit da-tabases. Cybern. Syst. 51, 140–160 (2020)
Cagliero, L., Chiusano, S., Garza, P., Ricupero, G.: Discovering high-utility itemsets at multiple abstrac-tion levels. In: Kirikova, M., et al. (eds.) New Trends in Databases and Information Systems. ADBIS 2017. CCIS, vol. 767, pp. 224–234. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-67162-8_22
Fournier-Viger, P., Wang, Y., Lin, J.CW., Luna, J.M., Ventura, S.: Mining cross-level high utility itemsets. In: Fujita, H., Fournier-Viger, P., Ali, M., Sasaki, J. (eds) Trends in Artificial Intelligence Theory and Applications. Artificial Intelligence Practices. IEA/AIE 2020. LNCS, vol. 12144, pp. 858–871 . Springer, Cham (2020). https://doi.org/10.1007/978-3-030-55789-8_73
Nguyen, T.D.D., Nguyen, L.T.T., Kozierkiewicz, A., Pham, T., Vo, B.: An efficient approach for mining high-utility itemsets from multiple abstraction levels. In: Nguyen, N.T., Chittayasothorn, S., Niyato, D., Trawiński, B. (eds.) Intelligent Information and Database Systems. ACIIDS 2021. LNCS, vol. 12672. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-73280-6_8
Tung, N.T., Nguyen, L.T.T., Nguyen, T.D.D., Vo, B.: An efficient method for mining multi-level high utility Item-sets. App. Intell. 52, 5475–5496 (2022)
Nouioua, M., Wang, Y., Fournier-Viger, P., Lin, J.C.-W., Wu, J.M.-T.: TKC: mining top-k cross-level high utility itemsets. In: 2020 International Conference on Data Mining Workshops (ICDMW), pp. 673–682 (2020)
Tung, N.T., Nguyen, L.T.T., Nguyen, T.D.D., Fourier-Viger, P., Nguyen, N.T., Vo, B.: Efficient mining of cross-level high-utility itemsets in taxonomy quantitative databases. Inf. Sci. (N Y) 587, 41–62 (2022)
Liu, Y., Liao, W.K., Choudhary, A.: A two-phase algorithm for fast discovery of high utility itemsets. In: Ho, T.B., Cheung, D., Liu, H. (eds.) Advances in Knowledge Discovery and Data Mining. PAKDD 2005. LNCS, vol. 3518, pp. 689–695. Springer, Berlin, Heidelberg (2005). https://doi.org/10.1007/11430919_79
Wu, C.W., Fournier-Viger, P., Gu, J.Y., Tseng, V.S.: Mining compact high utility itemsets without candidate generation. In: Fournier-Viger, P., Lin, J.W., Nkambou, R., Vo, B., Tseng, V. (eds.) High-Utility Pattern Mining. Studies in Big Data, LNCS, vol. 51, pp. 41–62. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-04921-8_11
Fournier-Viger, P., et al.: The SPMF open-source data mining library version 2. In: Berendt, B., et al. (eds.) Machine Learning and Knowledge Discovery in Databases. ECML PKDD 2016. LNCS, vol. 9853, pp. 36–40. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-46131-1_8
Acknowledgment
This research is funded by Vietnam National University HoChiMinh City (VNU-HCM) under grant number B2023-28-02.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Nguyen, T.D.D., Tung, N.T., Nguyen, L.T.T., Vo, B. (2024). Efficiently Discover Multi-level Maximal High-Utility Patterns from Hierarchical Databases. In: Nguyen, N.T., et al. Computational Collective Intelligence. ICCCI 2024. Lecture Notes in Computer Science(), vol 14810. Springer, Cham. https://doi.org/10.1007/978-3-031-70816-9_30
Download citation
DOI: https://doi.org/10.1007/978-3-031-70816-9_30
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-70815-2
Online ISBN: 978-3-031-70816-9
eBook Packages: Computer ScienceComputer Science (R0)