Skip to main content
SpringerLink
Log in

Mining frequent weighted utility patterns with dynamic weighted items from quantitative databases

  • Published:
Applied Intelligence Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12

Similar content being viewed by others

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

  1. 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

  2. Agrawal R, Srikant R (1994) Fast algorithms for mining association rules. In: The 20th VLDB conference, Santiago, Chile

  3. Han J, Pei J, Yin Y (2000) Mining frequent patterns without candidate generation. In: The 2000 ACM SIGMOD international conference on Management of Data

  4. Zaki MJ (2000) Scalable algorithms for association mining. IEEE Trans Knowl Data Eng 12(3):372–390

    Article  Google Scholar 

  5. 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

    Article  MathSciNet  MATH  Google Scholar 

  6. 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

    Article  Google Scholar 

  7. 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

    Article  Google Scholar 

  8. 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

  9. 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

    Article  Google Scholar 

  10. 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

    Article  Google Scholar 

  11. 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

  12. 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

    Article  Google Scholar 

  13. 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

    Article  Google Scholar 

  14. 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

    Article  Google Scholar 

  15. 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

  16. 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

    Article  Google Scholar 

  17. 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

    Article  Google Scholar 

  18. 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

    Article  Google Scholar 

  19. 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

    Article  Google Scholar 

  20. 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

    Article  Google Scholar 

  21. 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

    Article  Google Scholar 

  22. 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

    Article  Google Scholar 

  23. 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

    Article  MathSciNet  MATH  Google Scholar 

  24. 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

    Article  Google Scholar 

  25. 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

    Article  Google Scholar 

  26. 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

    Article  Google Scholar 

  27. 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

    Article  Google Scholar 

  28. 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

    Article  Google Scholar 

  29. 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

    Article  Google Scholar 

  30. 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

    Article  Google Scholar 

  31. 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

  32. 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

  33. Khan MS, Muyeba M, Coenen F (2008) A weighted utility framework for mining association rules. In: Computer modeling and simulation, 2008

  34. 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

  35. 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)

  36. 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

  37. 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

  38. 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

    Article  Google Scholar 

  39. 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

  40. 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

  41. Krishnamoorthy S (2017) HMiner: efficiently mining high utility itemsets. Expert Syst Appl 90:168–183

    Article  Google Scholar 

  42. 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

  43. 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

  44. 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

  45. 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

    Article  Google Scholar 

  46. 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

    Article  Google Scholar 

  47. Song W, Zheng C, Fournier-Viger P (2021) Mining skyline frequent-utility itemsets with utility filtering In: Pacific rim international conference on artificial intelligence

  48. Deng Z, Lv S (2014) Fast mining frequent itemsets using Nodesets. Expert Syst Appl 41(10):4505–4512

    Article  Google Scholar 

  49. Rymon R (1992) Search through systematic set enumeration. In: Proceeding of the Int'l conference principles of knowledge representation and reasoning

  50. 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

Download references

Funding statement

The author(s) received no specific funding for this study.

Author information

Authors and Affiliations

  1. Faculty of Information Technology, HUTECH University, Ho Chi Minh City, Vietnam

    Ham Nguyen

  2. Faculty of Information Technology, iSPACE Cybersecurity Vocational Training College, Ho Chi Minh City, Vietnam

    Nguyen Le

  3. Department of Computing Fundamentals, FPT University, Ho Chi Minh City, Vietnam

    Huong Bui

  4. Laboratory for Artificial Intelligence, Institute for Computational Science and Artificial Intelligence, Van Lang University, Ho Chi Minh City, Vietnam

    Tuong Le

  5. Faculty of Information Technology, School of Technology, Van Lang University, Ho Chi Minh City, Vietnam

    Tuong Le

Authors
  1. Ham Nguyen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nguyen Le
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Huong Bui
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Tuong Le
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Tuong Le.

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.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

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

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10489-023-04554-z

Keywords

Search

Navigation