Abstract
Data Mining refers to the process of extracting previously unknown and useful patterns from large datasets. Traditional data mining approaches focus mainly on finding the most frequent patterns from databases. However, mining the frequent patterns alone is not sufficient in all scenarios. For example, a business manager might be more interested to find the most profitable items by taking into account frequency and profit both, rather than mining the most common items alone. Therefore, in recent years, the research focus has shifted to mining of high utility patterns from datasets, where utility is used to represent users’ preference and it can be cost, profit or any other aesthetic value depending upon the application. High-utility itemset mining (HUIM) deals with the problem of finding high utility itemsets (HUIs), where every item is associated with atleast two utility values-internal and external. HUIM has found numerous applications in web mining, cross-marketing, customer segmentation, medical treatments, etc. This paper explains the concept of HUIM, it’s relevance and applications, and also provides an in depth analysis of techniques and advancements in the field of HUIM.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Oppitz M, Tomsu P (2018) Internet of things. In: Inventing the cloud century, Springer, pp 435–469
Tsai C-W, Lai C-F, Chiang M-C, Yang LT et al (2014) Data mining for internet of things: a survey. IEEE Commun Surv Tutor 16(1):77–97
Agrawal R, Imieliński T, Swami A (1993) Mining association rules between sets of items in large databases. In: ACM sigmod record, vol 22. ACM, pp 207–216
Han J, Pei J, Yin Y (2000) Mining frequent patterns without candidate generation. In: ACM sigmod record, vol 29. ACM, pp 1–12
Yao H, Hamilton HJ, Butz CJ (2004) A foundational approach to mining itemset utilities from databases. In: Proceedings of the 2004 SIAM international conference on data mining. SIAM, pp 482–486
Geng L, Hamilton HJ (2006) Interestingness measures for data mining: a survey. ACM Comput Surv (CSUR) 38(3):9
Ahn K-I (2012) Effective product assignment based on association rule mining in retail. Expert Syst Appl 39(16):12551–12556
Gan W, Lin JC-W, Fournier-Viger P, Chao H-C, Fujita H (2018) Extracting non-redundant correlated purchase behaviors by utility measure. Knowl-Based Syst 143:30–41
Shie B-E, Philip SY, Tseng VS (2013) Mining interesting user behavior patterns in mobile commerce environments. Appl Intell 38(3):418–435
Li G, Law R, Vu HQ, Rong J, Zhao XR (2015) Identifying emerging hotel preferences using emerging pattern mining technique. Tour Manage 46:311–321
Zhu X, Guo J, Cheng X, Lan Y (2012) More than relevance: high utility query recommendation by mining users’ search behaviors. In: Proceedings of the 21st ACM international conference on information and knowledge management. ACM, pp 1814–1818
Ahmed CF, Tanbeer SK, Jeong B-S (2011) A framework for mining high utility web access sequences. IETE Tech Rev 28(1):3–16
Ahmed CF, Tanbeer SK, Jeong B-S (2010) Mining high utility web access sequences in dynamic web log data. In: 2010 11th ACIS international conference on software engineering artificial intelligence networking and parallel/distributed computing (SNPD). IEEE, pp 76–81
Zihayat M, An A (2014) Mining top-k high utility patterns over data streams. Inf Sci 285:138–161
Khaleel MA, Pradham SK, Dash G et al (2013) A survey of data mining techniques on medical data for finding locally frequent diseases. Int J Adv Res Comput Sci Softw Eng 3(8)
Pillai J, Vyas O (2010) Overview of itemset utility mining and its applications. Int J Comput Appl 5(11):9–13
Yao H, Hamilton HJ (2006) Mining itemset utilities from transaction databases. Data Knowl Eng 59(3):603–626
Liu Y, Liao W-k, Choudhary A (2005) A two-phase algorithm for fast discovery of high utility itemsets. In: Pacific-Asia conference on knowledge discovery and data mining. Springer, pp 689–695
Liu Y, Liao W-k, Choudhary A (2005) A fast high utility itemsets mining algorithm. In: Proceedings of the 1st international workshop on Utility-based data mining. ACM, pp 90–99
Zaki MJ (1999) Parallel and distributed association mining: a survey. IEEE Concurr 4:14–25
Li Y-C, Yeh J-S, Chang C-C (2008) Isolated items discarding strategy for discovering high utility itemsets. Data Knowl Eng 64(1):198–217
Li Y-C, Yeh J-S, Chang C-C (2005) Direct candidates generation: a novel algorithm for discovering complete share-frequent itemsets. In: International conference on fuzzy systems and knowledge discovery. Springer, pp 551–560
Hu J, Mojsilovic A (2007) High-utility pattern mining: A method for discovery of high-utility item sets. Pattern Recogn 40(11):3317–3324
Ahmed CF, Tanbeer SK, Jeong B-S, Lee Y-K (2009) Efficient tree structures for high utility pattern mining in incremental databases. IEEE Trans Knowl Data Eng 21(12):1708–1721
Lin C-W, Hong T-P, Lu W-H (2011) An effective tree structure for mining high utility itemsets. Expert Syst Appl 38(6):7419–7424
Tseng VS, Wu C-W, Shie B-E, Yu PS (2010) Up-growth: an efficient algorithm for high utility itemset mining. In: Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, pp 253–262
Tseng VS, Shie B-E, Wu C-W, Philip SY (2013) Efficient algorithms for mining high utility itemsets from transactional databases. IEEE Trans Knowl Data Eng 25(8):1772–1786
Liu M, Qu J (2012) Mining high utility itemsets without candidate generation. In: Proceedings of the 21st ACM international conference on Information and knowledge management. ACM, pp 55–64
Lin M-Y, Tu T-F, Hsueh S-C (2012) High utility pattern mining using the maximal itemset property and lexicographic tree structures. Inf Sci 215:1–14
Erwin A, Gopalan RP, Achuthan N (2008) Efficient mining of high utility itemsets from large datasets. In: Pacific-Asia conference on knowledge discovery and data mining. Springer, pp 554–561
Wang L, Wang S (2021) Huil-tn & hui-tn: Mining high utility itemsets based on pattern-growth. PLoS ONE 16(3):e0248349
Freitas AA (2003) A survey of evolutionary algorithms for data mining and knowledge discovery. In: Advances in evolutionary computing, Springer, pp 819–845
Kannimuthu S, Premalatha K (2014) Discovery of high utility itemsets using genetic algorithm with ranked mutation. Appl Artif Intell 28(4):337–359
Lin JC-W, Yang L, Fournier-Viger P, Wu JM-T, Hong T-P, Wang LS-L, Zhan J (2016) Mining high-utility itemsets based on particle swarm optimization. Eng Appl Artif Intell 55:320–330
Poli R, Kennedy J, Blackwell T (2007) Particle swarm optimization. Swarm Intell 1(1):33–57
Wu JM-T, Zhan J, Lin JC-W (2017) An aco-based approach to mine high-utility itemsets. Knowl-Based Syst 116:102–113
Dorigo M, Gambardella LM (1997) Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans Evol Comput 1(1):53–66
Nawaz MS, Fournier-Viger P, Song W, Lin JC-W, Noack B (2021) Investigating crossover operators in genetic algorithms for high-utility itemset mining. In: Intelligent information and database systems: 13th Asian conference, ACIIDS 2021, Phuket, Thailand, April 7–10, 2021, proceedings 13. Springer International Publishing, pp 16–28
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Pushp, Chand, S. (2022). Knowledge Discovery and Data Mining for Intelligent Business Solutions. In: Tiwari, S., Trivedi, M.C., Kolhe, M.L., Mishra, K., Singh, B.K. (eds) Advances in Data and Information Sciences. Lecture Notes in Networks and Systems, vol 318. Springer, Singapore. https://doi.org/10.1007/978-981-16-5689-7_18
Download citation
DOI: https://doi.org/10.1007/978-981-16-5689-7_18
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-16-5688-0
Online ISBN: 978-981-16-5689-7
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)