Abstract
In data science, a key task is high utility itemset mining (HUIM), that is determining the values that co-occur in data and have a high utility (importance). That task is applied for instance to identify the most profitable sets of products in transactions. A shortcoming of current algorithms is that they focus on the utility of patterns, but ignore their cost (e.g. time, effort, money or other resources that are consumed). Hence, this paper defines the problem of low cost high utility itemset mining. The aim is to find patterns that have a high average utility and a low average-cost. An example application is to find patterns indicating learners’ studying patterns in an e-learning platform that result in obtaining high grades (utility) for a relatively small effort (cost). An efficient algorithm named LCIM (Low Cost Itemset Miner) is proposed to solve this problem. To reduce the search space, LCIM uses a novel lower bound on the average cost. Observations from experiments confirm that LCIM find interesting patterns and is efficient.
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
Notes
- 1.
The original name is average utility but it is renamed to be more precise.
References
Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proceedings of VLDB, vol. 1215, pp. 487–499 (1994)
Chan, R., Yang, Q., Shen, Y.: Mining high utility itemsets. In: Proceedings of ICDM, pp. 19–26 (2003)
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. 48(7), 1859–1877 (2017). https://doi.org/10.1007/s10489-017-1057-2
Fournier-Viger, P., Li, J., Lin, J.C., Truong-Chi, T., Kiran, R.U.: Mining cost-effective patterns in event logs. Knowl. Based Syst. 191, 105241 (2020)
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
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
Fournier-Viger, P., Lin, J.C.W., Vo, B., Chi, T.T., Zhang, J., Le, B.: A survey of itemset mining. WIREs Data Min. Knowl. Discov. 7(4), e1207 (2017)
Fournier-Viger, P., Wu, C.-W., Zida, S., Tseng, V.S.: FHM: faster high-utility itemset mining using estimated utility co-occurrence pruning. In: Andreasen, T., Christiansen, H., Cubero, J.-C., Raś, Z.W. (eds.) ISMIS 2014. LNCS (LNAI), vol. 8502, pp. 83–92. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-08326-1_9
Kim, H., et al.: Efficient list based mining of high average utility patterns with maximum average pruning strategies. Inf. Sci. 543, 85–105 (2021)
Nawaz, M.S., Fournier-Viger, P., Yun, U., Wu, Y., Song, W.: Mining high utility itemsets with hill climbing and simulated annealing. ACM Trans. Manag. Inf. Syst. 13(1), 1–22 (2022)
Peng, A.Y., Koh, Y.S., Riddle, P.: mHUIMiner: a fast high utility itemset mining algorithm for sparse datasets. In: Kim, J., Shim, K., Cao, L., Lee, J.-G., Lin, X., Moon, Y.-S. (eds.) PAKDD 2017. LNCS (LNAI), vol. 10235, pp. 196–207. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-57529-2_16
Qu, J., Fournier-Viger, P., Liu, M., Hang, B., Wang, F.: Mining high utility itemsets using extended chain structure and utility machine. Knowl. Based Syst. 208, 106457 (2020)
Qu, J.-F., Liu, M., Fournier-Viger, P.: Efficient algorithms for high utility itemset mining without candidate generation. In: Fournier-Viger, P., Lin, J.C.-W., Nkambou, R., Vo, B., Tseng, V.S. (eds.) High-Utility Pattern Mining. SBD, vol. 51, pp. 131–160. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-04921-8_5
Verma, A., Dawar, S., Kumar, R., Navathe, S., Goyal, V.: High-utility and diverse itemset mining. Appl. Intell. 51(7), 4649–4663 (2021). https://doi.org/10.1007/s10489-020-02063-x
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Nawaz, M.S., Fournier-Viger, P., Alhusaini, N., He, Y., Wu, Y., Bhattacharya, D. (2022). LCIM: Mining Low Cost High Utility Itemsets. In: Surinta, O., Kam Fung Yuen, K. (eds) Multi-disciplinary Trends in Artificial Intelligence. MIWAI 2022. Lecture Notes in Computer Science(), vol 13651. Springer, Cham. https://doi.org/10.1007/978-3-031-20992-5_7
Download citation
DOI: https://doi.org/10.1007/978-3-031-20992-5_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-20991-8
Online ISBN: 978-3-031-20992-5
eBook Packages: Computer ScienceComputer Science (R0)