Abstract
Most businesses focus on the profits. For example, supermarkets often analyze sale activities to investigate which products bring the most revenue, as well as find out customer trends based on their carts. To achieve this, a number of studies have examined high utility itemsets (HUIs). Traditional association rule mining algorithms only generate a set of highly frequent rules, but these rules do not provide useful answers for what the high utility association rules are. This chapter provides overview current approaches to mine high utility association rules.
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., Imielinski, T., Swami, A.: Mining association rules between sets of items in large databases. In: Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, pp. 207–216 (1993)
Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: VLDB 1994, pp. 487–499 (1994)
Choi, V.: Faster algorithms for constructing a concept (Galois) lattice (2006). arXiv:cs.DM/0602069
Duong, H.V., Truong, T.C., Vo, B.: An efficient method for mining frequent itemsets with double constraint. Eng. Appl. Artif. Intell. 27, 148–154 (2014)
Fournier-Viger, P., Wu, C., Zida, S., Tseng, V.S.: Faster high utility itemset mining using estimated utility co-occurrence pruning. In: Proceedings 21st International Symposium on Methodologies for Intelligent Systems, pp. 83–92 (2014)
Gan, W., Lin, J.C., Fournier-Viger, P., Chao, H.: More Efficient Algorithms for Mining High-Utility Itemsets with Multiple Minimum Utility Thresholds. DEXA(1), 71–87 (2016)
Grahne, G., Zhu, J.: Fast algorithms for frequent itemset mining using FP-trees. IEEE Trans. Knowl. Data Eng. 17(10), 1347–1362 (2005)
Liu, Y., Liao, W., Choudhary, A.: A two-phase algorithm for fast discovery of high utility itemsets. In: Proceedings of the 9th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining, pp. 689–695 (2005)
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)
Mai, T., Vo, B., Nguyen, L.T.T.: A lattice-based approach for mining high utility association rules. Inf. Sci. 399, 81–97 (2017)
Nguyen, D., Nguyen, L.T.T., Vo, B., Pedrycz, W.: Efficient mining of class association rules with the itemset constraint. Knowl. Based Syst. 103, 73–88 (2016)
Nguyen, D., Vo, B., Le, B.: CCAR: an efficient method for mining class association rules with itemset constraints. Eng. Appl. Artif. Intell. 37, 115–124 (2015)
Priss, U.: Lattice-based information retrieval. Knowl. Organ. 27(3), 132–142 (2000)
Sahoo, J., Das, A.K., Goswami, A.: An effective association rule mining scheme using a new generic basis. Knowl. Inf. Syst. 43(1), 127–156 (2015)
Sahoo, J., Das, A.K., Goswami, A.: An efficient approach for mining association rules from high utility itemsets. Expert Syst. Appl. 42(13), 5754–5778 (2015)
Tseng, V.S., Wu, C., 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)
Tseng, V.S., Wu, C., Shie, B., Yu, P.S.: P-Growth: an efficient algorithm for high utility itemset minin. In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 253–262 (2010)
Tseng, V.S., Wu, C., Shie, B., Yu, P.S.: Efficient algorithms for mining high utility itemsets from transactional databases. IEEE Trans. Knowl. Data Eng. 25(8), 1772–1786 (2013)
Vo, B., Hong, T., Le, B.: A lattice-based approach for mining most generalization association rules. Knowl. Based Syst. 45, 20–30 (2013)
Vo, B., Le, B.: Mining traditional association rules using frequent itemsets lattice. In: 39th International Conference on Computers and Industrial Engineering, pp. 1401–1406 (2009)
Vo, B., Le, B.: Mining minimal non-redundant association rules using frequent itemsets lattice. J. Intell. Syst. Technol. Appl. 10(1), 92–106 (2011a)
Vo, B., Le, B.: Interestingness for association rules: combination between lattice and hash tables. Expert Syst. Appl. 38(9), 11630–11640 (2011)
Vo, B., Nguyen, H., Le, B.: Mining high utility itemsets from vertical distributed databases. In: International Conference Computing and Communication Technologies, pp. 1–4 (2009)
Vo, B., Le, T., Pedrycz, W., Nguyen, G., Baik, S.W.: Mining erasable itemsets with subset and superset itemset constraints. Expert Syst. Appl. 69, 50–61 (2017)
Yun, U., Ryang, H., Ryu, K.H.: High utility itemset mining with techniques for reducing overestimated utilities and pruning candidates. Expert Syst. Appl. 41(8), 3861–3878 (2014)
Zaki, M.J., Hsiao, C.J.: Efficient algorithms for mining closed itemsets and their lattice structure. IEEE Trans. Knowl. Data Eng. 17(4), 462–478 (2005)
Zida, S., Fournier-Viger, P., Lin, J.W., Wu, C., Tseng, V.S.: EFIM: A Fast and Memory Efficient Algorithm for High-Utility Itemset Minin. Knowl. Inf. Syst. 51(2), 595–625 (2017)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Nguyen, L.T.T., Mai, T., Vo, B. (2019). High Utility Association Rule Mining. In: Fournier-Viger, P., Lin, JW., Nkambou, R., Vo, B., Tseng, V. (eds) High-Utility Pattern Mining. Studies in Big Data, vol 51. Springer, Cham. https://doi.org/10.1007/978-3-030-04921-8_6
Download citation
DOI: https://doi.org/10.1007/978-3-030-04921-8_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-04920-1
Online ISBN: 978-3-030-04921-8
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)