Abstract
The mining of frequent weighted utility patterns (FWUPs) is an important task in the field of data mining that aims to discover frequent patterns from quantitative databases while taking into account the importance or weight of each item. Although there are many approaches that have been proposed to solve this problem, all of these methods focus on databases in which the weight of each item is fixed. In real-life situations, the weight of each item may change over time; for example, the weights of the products in a store may change every month, every quarter, or every year. This is an important aspect that previous studies have not considered. In this paper, we first introduce a new problem that involves mining FWUPs with dynamic weighted items from quantitative databases (called dynamic quantitative databases, dQDBs). Following this, we propose an algorithm called dFWUT that uses a tidset data structure to solve this problem. Next, an algorithm called dFWUNL is developed that uses a new data structure called a WUNList to mine FWUPs from dQDBs. Finally, experiments on multiple databases are carried out to show that the proposed method is more efficient than another state-of-the-art algorithm in terms of running time and memory usage, especially for dense datasets or sparse datasets with a small mining threshold.
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs10489-023-04554-z/MediaObjects/10489_2023_4554_Fig1_HTML.png)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs10489-023-04554-z/MediaObjects/10489_2023_4554_Fig2_HTML.png)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs10489-023-04554-z/MediaObjects/10489_2023_4554_Fig3_HTML.png)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs10489-023-04554-z/MediaObjects/10489_2023_4554_Fig4_HTML.png)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs10489-023-04554-z/MediaObjects/10489_2023_4554_Fig5_HTML.png)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs10489-023-04554-z/MediaObjects/10489_2023_4554_Fig6_HTML.png)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs10489-023-04554-z/MediaObjects/10489_2023_4554_Fig7_HTML.png)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs10489-023-04554-z/MediaObjects/10489_2023_4554_Fig8_HTML.png)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs10489-023-04554-z/MediaObjects/10489_2023_4554_Fig9_HTML.png)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs10489-023-04554-z/MediaObjects/10489_2023_4554_Fig10_HTML.png)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs10489-023-04554-z/MediaObjects/10489_2023_4554_Fig11_HTML.png)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs10489-023-04554-z/MediaObjects/10489_2023_4554_Fig12_HTML.png)
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Data availability
The datasets analysed during the current study are available in the Frequent Itemset Mining Dataset Repository, http://fimi.ua.ac.be/data.
References
Agrawal R, Imielinski T, Swami A (1993) Mining association rules between sets of items in large databases. In: SIGMOD '93 proceedings of the 1993 ACM SIGMOD international conference on management of data
Agrawal R, Srikant R (1994) Fast algorithms for mining association rules. In: The 20th VLDB conference, Santiago, Chile
Han J, Pei J, Yin Y (2000) Mining frequent patterns without candidate generation. In: The 2000 ACM SIGMOD international conference on Management of Data
Zaki MJ (2000) Scalable algorithms for association mining. IEEE Trans Knowl Data Eng 12(3):372–390
Deng Z, Wang Z, Jiang J (2012) A new algorithm for fast mining frequent itemsets using N-lists. Sci China Inf Sci 55(9):2008–2030
Vo B, Le T, Hong T, Le B (2014) An effective approach for maintenance of pre-large-based frequent-itemset lattice in incremental mining. Appl Intell 41(3):759–775
Vo B, Le T, Coenen F, Hong T (2016) Mining frequent itemsets using the N-list and subsume concepts. Int J Mach Learn Cybern 7(2):253–265
Tao F, Murtagh F, Farid M (2003) Weighted association rule mining using weighted support and significance framework. In: Proceedings of the ninth ACM SIGKDD international conference on knowledge discovery and data mining, Washington, DC, USA
Vo B, Coenen F, Le B (2013) A new method for mining frequent weighted itemsets based on WIT-tree. Expert Syst Appl 40(4):1256–1264
Lee G, Yun U, Ryu K (2017) Mining frequent weighted itemsets without storing transaction IDs and generating candidates. Int J Uncertain Fuzziness Knowl-Based Syst 25(1):111–144
Nguyen H, Vo B, Nguyen MTH, Hong T (2015) An improved algorithm for mining frequent weighted Itemsets. In: 2015 IEEE international conference on systems, man, and cybernetics, Hong Kong, China
Nguyen H, Vo B, Nguyen M, Pedrycz W (2016) An efficient algorithm for mining frequent weighted itemsets using interval word segments. Appl Intell 45(4):1008–1020
Nguyen H, Le T, Nguyen M, Fournier-Viger P, Tseng VS, Vo B (2022) Mining frequent weighted utility itemsets in hierarchical quantitative databases. Knowl-Based Syst 237:107709
Bui H, Vo B, Nguyen H, Nguyen-Hoang TA, Hong TP (2018) A weighted N-list-based method for mining frequent weighted itemsets. Expert Syst Appl 96:388–405
Vo B, Bui H, Vo T, Le T (2020) Mining top-rank-k frequent weighted itemsets using WN-list structures and an early pruning strategy. Knowl-Based Syst 201–202:106064
Bui H, Vo B, Nguyen-Hoang TA, Yun U (2020) Mining frequent weighted closed itemsets using the WN-list structure and an early pruning strategy. Appl Intell 51:1439–1459
Bui H, Nguyen-Hoang TA, Vo B, Nguyen H, Le T (2021) A sliding window-based approach for mining frequent weighted patterns over data streams. IEEE Access 9:56318–56329
Vo B, Le T, Nguyen G, Hong T-P (2017) Efficient algorithms for mining erasable closed patterns from product datasets. IEEE Access 5(1):3111–3120
Baek Y, Yun U, Lin JCW, Yoon E, Fujita H (2020) Efficiently mining erasable stream patterns for intelligent systems over uncertain data. Int J Intell Syst 35(11):1699–1734
Nguyen G, Le T, Vo B, Le B (2015) EIFDD: an efficient approach for erasable itemset mining of very dense datasets. Appl Intell 43(1):85–94
Le T, Vo B, Fournier-Viger P, Lee MY, Baik SW (2019) SPPC: a new tree structure for mining erasable patterns in data streams. Appl Intell 49(2):478–495
Lin JCW, Djenouri Y, Srivastava G, Yun U, Fournier-Viger P (2021) A predictive GA-based model for closed high-utility itemset mining. Appl Soft Comput 108:107422
Nam H, Yun U, Yoon E, Lin JCW (2020) Efficient approach of recent high utility stream pattern mining with indexed list structure and pruning strategy considering arrival times of transactions. Inf Sci 529:1–27
Qu JF, Fournier-Viger P, Liu M, Hang B, Wang F (2020) Mining high utility itemsets using extended chain structure and utility machine. Knowl-Based Syst 208:106457
Kim H, Yun U, Baek Y, Kim H, Nam H, Lin JC, Fournier-Viger P (2021) Damped sliding based utility oriented pattern mining over stream data. Knowl-Based Syst 213:106653
Nam H, Yun U, Vo B, Truong T, Deng ZH, Yoon E (2020) Efficient approach for damped window-based high utility pattern mining with list structure. IEEE Access 8:50958–50968
Kim J, Yun U, Yoon E, Lin JCW, Fournier-Viger P (2020) One scan based high average-utility pattern mining in static and dynamic databases. Futur Gener Comput Syst 111:143–158
Yun U, Kim D, Yoon E, Fujita H (2018) Damped window based high average utility pattern mining over data streams. Knowl-Based Syst 144:188–205
Baek Y, Yun U, Kim H, Kim J, Vo B, Truong T, Deng ZH (2021) Approximate high utility itemset mining in noisy environments. Knowl-Based Syst 212:106596
Kim J, Yun U, Kim H, Ryu T, Lin JCW (2021) Average utility driven data analytics on damped windows for intelligent systems with data streams. Int J Intell Syst 36(10):5741–5769
Bui H, Vo B, Nguyen H (2016) WUN-miner: a new method for mining frequent weighted utility itemsets. In: The 2016 IEEE conference on system, man, and cybernetics (SMC 2016), Budapest
Nguyen H, Vo B, Nguyen MTH, Hong T (2015) MBiS: an efficient method for mining frequent weighted utility itemsets from quantitative databases. J Comput Sci Cybern 31. https://doi.org/10.15625/1813-9663/31/1/5154
Khan MS, Muyeba M, Coenen F (2008) A weighted utility framework for mining association rules. In: Computer modeling and simulation, 2008
Ramkumar GD, Ranka S, Tsur S (1998) Weighted association rules: model and algorithm. In: Proceedings of the fourth international conference on knowledge discovery and data mining (KDD-98), New York City, New York, USA
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 (SDM)
Liu Y, Liao W, Choudhary A (2005) A two-phase algorithm for fast discovery of high utility itemsets. Advances in Knowledge Discovery and Data Mining 3518:689–695
Tseng VS, Wu C, Shie B, 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
Tseng VS, Shie B, Wu C, Yu PS (2012) 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
Zida S, Fournier-Viger P, Lin JC, Wu C, Tseng VS (2015) EFIM: a highly efficient algorithm for high-utility itemset mining. In: Mexican international conference on artificial intelligence
Krishnamoorthy S (2017) HMiner: efficiently mining high utility itemsets. Expert Syst Appl 90:168–183
Podpecan V, Lavrac N, Kononenko I (2007, September) A fast algorithm for mining utility-frequent itemsets. In: International workshop on constraint-based mining and learning, Warsaw, Poland
Yeh JS, Li YC, Chang CC, (2007, May) Two-phase algorithms for a novel utility-frequent mining model. In: Pacific-Asia conference on knowledge discovery and data mining, Berlin, Heidelberg
Goyal V, Sureka A, Patel D (2015, July) Efficient skyline itemsets mining. In: Proceedings of the eighth international C* conference on Computer Science & Software Engineering
Pan JS, Lin JCW, Yang L, Fournier-Viger P, Hong TP (2017) Efficiently mining of skyline frequent-utility patterns. Intell Data Anal 21(6):1407–1423
Lin JCW, Yang L, Fournier-Viger P, Hong TP (2019) Mining of skyline patterns by considering both frequent and utility constraints. Eng Appl Artif Intell 77:229–238
Song W, Zheng C, Fournier-Viger P (2021) Mining skyline frequent-utility itemsets with utility filtering In: Pacific rim international conference on artificial intelligence
Deng Z, Lv S (2014) Fast mining frequent itemsets using Nodesets. Expert Syst Appl 41(10):4505–4512
Rymon R (1992) Search through systematic set enumeration. In: Proceeding of the Int'l conference principles of knowledge representation and reasoning
Fournier-Viger P, Lin JCW, Gomariz A, Gueniche T, Soltani A, Deng Z, Lam HT (2016) The SPMF Open-Source Data Mining Library Version 2. ECML/PKDD (3): 36–40
Funding statement
The author(s) received no specific funding for this study.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflicts of interests/competing interests
The authors declare that they have no conflicts of interest to report regarding the present study.
Additional information
Publisher’s note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Nguyen, H., Le, N., Bui, H. et al. Mining frequent weighted utility patterns with dynamic weighted items from quantitative databases. Appl Intell 53, 19629–19646 (2023). https://doi.org/10.1007/s10489-023-04554-z
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10489-023-04554-z