Skip to main content
SpringerLink
Log in

A new approach for efficiently mining frequent weighted utility patterns

  • Published:
Applied Intelligence Aims and scope Submit manuscript

Abstract

Mining patterns that satisfy both frequency and utility constraints is an interesting problem in data mining. Currently, there are two main approaches to solving this problem: the first considers these two factors separately (skyline frequent-utility patterns), and the second combines these two factors to form a composite measure (frequent weighted utility patterns). In the second approach, the weighted utility support (wus), which represents the percentage occupancy of the total weighted utility of all transactions in a quantitative database, is used. This approach has the advantage of satisfying the downward-closure property, so it is easy to implement divide-and-conquer and pruning strategies on the candidate search space, as shown by algorithms such as MWIT-FWUI, MBiS-FWUI, and WUN-Miner. This study proposes an SWUN-list structure, a shortened version of the N-list structure, to effectively represent and mine frequent weighted utility patterns (FWUPs) in quantitative databases based on the second approach. Several theorems are also developed to quickly compute the wus values of patterns based on their SWUN-lists, as well as to determine the wus values of some special patterns without computation. The experiments are conducted on a variety of datasets to compare the proposed algorithm with the state-of-the-art methods. Experimental results confirm that the proposed method is superior to the existing methods for mining FWUPs in quantitative databases.

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
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19
Fig. 20
Fig. 21
Fig. 22
Fig. 23
Fig. 24
Fig. 25

Similar content being viewed by others

References

  1. Tuong L, Vo B (2016) The lattice-based approaches for mining association rules: a review. Wiley Interdiscip Rev Data Min Knowl Discov 6(4):140–151

    Article  Google Scholar 

  2. Vo B, Le T, Hong T-P, 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 

  3. Zhang S, Zhang Y, Yin L, Yuan T, Wu Z, Luo H (2019) Mining frequent items over the distributed hierarchical continuous weighted data streams in Internet of Things. IEEE Access 7:74890–74898

    Article  Google Scholar 

  4. Agrawal Rakesh T, Imieliński, Swami A (1993) 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

  5. Jiawei H, PeiJ Yin Y, Mao R (2004) Mining frequent patterns without candidate generation: A frequent-pattern tree approach. Data Min Knowl Discov 8(1):53–87

    Article  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

  7. Deng Z-H, Wang ZH, Jiang JJ (2012) A new algorithm for fast mining frequent itemsets using N-lists. Sci China Inform Sci 55(9):2008–2030

    Article  MathSciNet  MATH  Google Scholar 

  8. Deng Z-H, Lv S-L (2015) PrePost+: An efficient N-lists-based algorithm for mining frequent itemsets via Children–Parent Equivalence pruning. Expert Syst Appl 42(13):5424–5432

    Article  Google Scholar 

  9. Deng Z-H (2016) DiffNodesets: An efficient structure for fast mining frequent itemsets. Appl Soft Comput 41:214–223

    Article  Google Scholar 

  10. Vo B, Le T, Coenen F, Tzung-Pei H (2016) Mining frequent itemsets using the N-list and subsume concepts. Int J Mach Learn Cybernet 7(2):253–265

    Article  Google Scholar 

  11. Huong B, Vo B, Nguyen-Hoang T-A, Yun U (2021) Mining frequent weighted closed itemsets using the WN-list structure and an early pruning strategy. Appl Intell 51(3):1439–1459

    Article  Google Scholar 

  12. Huong B, Nguyen-Hoang T-A, 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

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

    Article  Google Scholar 

  14. Yoonji B, 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 

  15. Tuong L, Vo B, Fournier-Viger P, Lee MY, Sung Wook Baik (2019) SPPC: a new tree structure for mining erasable patterns in data streams. Appl Intell 49(2):478–495

    Article  Google Scholar 

  16. Vo B, Le T, Tzung-Pei H (2017) Efficient algorithms for mining erasable closed patterns from product datasets. IEEE Access 5:3111–3120

    Article  Google Scholar 

  17. 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, pp 55–64

  18. 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, Berlin, pp 689–695

  19. Bui Huong B, Vo, Nguyen H (2016) WUN-miner: A new method for mining frequent weighted utility itemsets. In: 2016 IEEE International Conference on Systems, Man, and Cybernetics (SMC). IEEE, pp 001365–001370

  20. Duy HN, Bay VD, Tzung-Pei H (2015) MBiS: an efficient method for mining frequent weighted utility itemsets from quantitative databases. J Comput Sci Cybern 31(1):17–30

  21. Unil Y, Ryang H, Ryu KH (2014) High utility itemset mining with techniques for reducing overestimated utilities and pruning candidates. Expert Syst Appl 41(8):3861–3878

    Article  Google Scholar 

  22. Heungmo R, Yun U (2017) Indexed list-based high utility pattern mining with utility upper-bound reduction and pattern combination techniques. Knowl Inf Syst 51(2):627–659

    Article  Google Scholar 

  23. Duong Q-H, Fournier-Viger P, Ramampiaro H, Nørvåg K, Dam T-L (2018) Efficient high utility itemset mining using buffered utility-lists. Appl Intell 48(7):1859–1877

    Article  Google Scholar 

  24. Qu J-F, Liu M, Fournier-Viger P (2019) Efficient algorithms for high utility itemset mining without candidate generation. High-Utility Pattern Mining. Springer, Cham, pp 131–160

    Chapter  Google Scholar 

  25. Vikram G, Sureka A, Patel D (2015) Efficient skyline itemsets mining. In: Proceedings of the Eighth International C* Conference on Computer Science & Software Engineering, pp 119–124

  26. Jeng-Shyang P, Lin JC-H, Yang L, Fournier-Viger P, Hong T-P (2017) Efficiently mining of skyline frequent-utility patterns. Intell Data Anal 21(6):1407–1423

    Article  Google Scholar 

  27. Chun-Wei LJ, Yang Lu, Tzung-Pei H (2019) Mining of skyline patterns by considering both frequent and utility constraints. Eng Appl Artif Intell 77:229–238

    Article  Google Scholar 

  28. Vo B, Le B, Jung JJ (2012) A tree-based approach for mining frequent weighted utility itemsets. In: International Conference on Computational Collective Intelligence. Springer, Berlin, pp. 114–123

  29. Deng Z-H, Sheng-Long Lv (2014) Fast mining frequent itemsets using Nodesets. Expert Syst Appl 41(10):4505–4512

    Article  Google Scholar 

  30. Fournier-Viger P, Chun-Wei Lin J, Truong-Chi T, Nkambou R (2019) A survey of high utility itemset mining. High-utility pattern mining. Springer, Cham, pp 1–45

    Chapter  Google Scholar 

  31. Heonho K, Yun U, Baek Y, Kim J, Vo B, Yoon E, Fujita H (2021) Efficient list based mining of high average utility patterns with maximum average pruning strategies. Inform Sci 543:85–105

    Article  Google Scholar 

  32. Yoonji B, Yun U, Kim H, Kim J, Vo B, Truong T, Deng Z-H (2021) Approximate high utility itemset mining in noisy environments. Knowl-Based Syst 212:106596

    Article  Google Scholar 

  33. Jongseong K, Yun U, Kim H, Ryu T, Chun-Wei Lin J, Fournier‐Vier P, Pedrycz W (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 

  34. Judae L, Yun U, Lee G, Yoon E (2018) Efficient incremental high utility pattern mining based on pre-large concept. Eng Appl Artif Intell 72:111–123

    Article  Google Scholar 

  35. Hyoju N, Yun U, Vo B, Truong T, Deng Z-H, Yoon E (2020) Efficient approach for damped window-based high utility pattern mining with list structure. IEEE Access 8:50958–50968

    Article  Google Scholar 

  36. Unil Y, Nam H, Kim J, Kim H, Baek Y, Lee J, Yoon E, Truong T, Vo B, Pedrycz W (2020) Efficient transaction deleting approach of pre-large based high utility pattern mining in dynamic databases. Future Gener Comput Syst 103:58–78

    Article  Google Scholar 

  37. Vid P, Lavrac N, Kononenko I (2007) A fast algorithm for mining utility-frequent itemsets. Constraint-Based Mining and Learning :9

  38. Yeh J-S, Li Y-C, Chang C-C (2007) Two-phase algorithms for a novel utility-frequent mining model. In: Pacific-Asia Conference on Knowledge Discovery and Data Mining. Springer, Berlin, pp 433–444

  39. Sulaiman KM, Muyeba M, Coenen F (2008) A weighted utility framework for mining association rules. In: 2008 Second UKSIM European Symposium on Computer Modeling and Simulation. IEEE, pp 87–92

  40. Tram T, Vo B, Le TTN, Nguyen NT (2017) Text clustering using frequent weighted utility itemsets. Cybernet Syst 48(3):193–209

    Article  Google Scholar 

  41. Zhang L, Fu G, Cheng F, Qiu J, Su Y (2018) A multi-objective evolutionary approach for mining frequent and high utility itemsets. Appl Soft Comput 62:974–986

    Article  Google Scholar 

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

  43. Frequent itemset mining dataset repository. Available: http://fimi.ua.ac.be/data/. Accessed 25 Aug 2021

  44. An open-source data mining library. Available: http://www.philippe-fournier-viger.com/spmf/index.php?link=datasets.php. Accessed 25 Aug 2021

Download references

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. Faculty of Computer Science, University of Information Technology, Vietnam National University HCMC, Ho Chi Minh City, Vietnam

    Huong Bui

  4. Informetrics Research Group, Ton Duc Thang University, Ho Chi Minh City, Vietnam

    Tuong Le

  5. Faculty of Information Technology, Ton Duc Thang 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.

Additional information

Publisher’s note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

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. A new approach for efficiently mining frequent weighted utility patterns. Appl Intell 53, 121–140 (2023). https://doi.org/10.1007/s10489-022-03580-7

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10489-022-03580-7

Keywords

Search

Navigation