Skip to main content
SpringerLink
Log in

Mining frequent weighted closed itemsets using the WN-list structure and an early pruning strategy

  • Published:
Applied Intelligence Aims and scope Submit manuscript

Abstract

The problem of mining frequent weighted itemsets (FWIs) is an extension of the mining frequent itemsets (FIs), which considers not only the frequent occurrence of items but also their relative importance in a dataset. However, like mining FIs, mining FWIs usually produces a large result set, which makes it difficult to extract rules and creates redundancy. The problem of mining frequent weighted closed itemsets (FWCIs) has been proposed as a solution to this issue, which produces a smaller result set while preserving sufficient information to extract rules. The weighted node-list (WN-list) structure is currently considered the state-of-the-art structure for mining FWIs. In this study, we first propose the definition of WN-list ancestral operation and a theorem as the theoretical basis for eliminating unsatisfactory candidates, then propose an efficient algorithm, namely NFWCI, for mining FWCIs using the WN-list and an early pruning strategy. The experimental results on many sparse and dense datasets show that the proposed algorithm outperforms the-state-of-the-art algorithm for mining FWCIs.

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
Fig. 26
Fig. 27
Fig. 28
Fig. 29
Fig. 30
Fig. 31
Fig. 32
Fig. 33
Fig. 34
Fig. 35
Fig. 36
Fig. 37
Fig. 38
Fig. 39

Similar content being viewed by others

References

  1. Bhavithra JSA (2019) Personalized web page recommendation using case-based clustering and weighted association rule mining. Clust Comput 22:6991–7002

    Article  Google Scholar 

  2. Gan W, Lin JCW, Fournier-Viger P, Chao HC, Yu PS (2020) HUOPM: high-utility occupancy pattern mining. IEEE Transactions on Cybernetics 50(3):1195–1208

    Article  Google Scholar 

  3. Kiran RU, Reddy PPC, Zettsu K, Toyoda M, Kitsuregawa M, Reddy PK (2020) Efficient discovery of weighted frequent neighborhood itemsets in very large spatiotemporal databases. IEEE Access 8:27584–27596

    Article  Google Scholar 

  4. Lakshmi KS, Vadivu G (2019) A novel approach for disease comorbidity prediction using weighted association rule mining, J Ambient Intell Humaniz Comput, pp. 1–8

  5. Vanahalli MK, Patil N (2020) Distributed load balancing frequent colossal closed itemset mining algorithm for high dimensional dataset. Journal of Parallel and Distributed Computing 144:136–152

    Article  Google Scholar 

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

    Article  Google Scholar 

  7. Deng Z (2016) DiffNodesets: an efficient structure for fast mining frequent itemsets. Appl Soft Comput 41:214–223

    Article  Google Scholar 

  8. Fournier-Viger P, Lin JCW, Vo B, Chi TT, Zhang J, Le HB (2017) A survey of itemset mining, Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery, vol. 7, no. 4

  9. Fourier-Viger P, Li Z, Lin JC-W, Kiran RU, Fujita H (2019) Efficient algorithms to identify periodic patterns in multiple sequences. Inf Sci 489:205–226

    Article  MathSciNet  Google Scholar 

  10. Han J, Pei J, Mortazavi-Asl B, Pinto H, Chen Q, Dayal U, Hsu M-C (2001) Prefixspan: Mining sequential patterns efficiently by prefix-projected pattern growth, in The 17th International Conference on Data Engineering, Heidelberg, Germany

  11. Jiang C, Coenen F, Zito M (2013) A survey of frequent subgraph mining algorithms. Knowl Eng Rev 28(1):75–105

    Article  Google Scholar 

  12. Duneja E, Sachan AK (2012) A survey on frequent itemset mining with association rules. International Journal of Computer Applications 46(23):18–24

    Google Scholar 

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

  14. Gan W, Lin JCW, Fourier-Viger P, Chao HC, Zhan J, Zhang J (2018) Exploiting highly qualified pattern with frequency and weight occupancy. Knowl Inf Syst 56(1):165–196

    Article  Google Scholar 

  15. Gan W, Lin JCW, Fourier-Viger P, Chao HC, Wu JMT, Zhan J (2017) Extracting recent weighted-based patterns from uncertain temporal databases. Eng Appl Artif Intell 61:161–172

    Article  Google Scholar 

  16. Lee G, Yun U, Ryu K (2017) Mining frequent weighted itemsets without storing transaction IDs and generating candidates. International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 25(1):111–144

    Article  Google Scholar 

  17. Lin JCW, Gan W, Fourier-Viger P, Hong TP, Chao HC (2017) Mining weighted frequent itemsets without candidate generation in uncertain databases. International Journal of Information Technology & Decision Making 16(6):1549–1579

    Article  Google Scholar 

  18. Lin JCW, Gan W, Fournier-Viger P, Hong TP (2015) RWFIM: recent weighted-frequent itemsets mining. Eng Appl Artif Intell 45:18–32

    Article  Google Scholar 

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

  20. Vo B, Coenen F, Le B (2013) A new method for mining frequent weighted itemsets based on WIT-trees. Expert Syst Appl 40(4):1256–1264

    Article  Google Scholar 

  21. Fournier-Viger P, Zhang Y, Lin JCW, Hamido F, Koh YS (2019) Mining local and peak high utility itemsets. Inf Sci 481:344–367

    Article  MathSciNet  Google Scholar 

  22. Gan W, Lin JCW, Fourier-Viger P, Chao HC, Tseng VS, Yu PS (2019) A survey of utility-oriented pattern mining, IEEE Trans Knowl Data Eng, pp. 1–20

  23. Gan W, Lin JC-W, Fournier-Viger P, Chao H-C, Hong T-P, Fujita H (2018) A survey of incremental high-utility itemset mining. Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery 8(2):e1242

    Google Scholar 

  24. Nguyen LTT, Nguyen P, Nguyen TDD, Vo B, Fournier-Viger P, Tseng VS (2019) Mining high-utility itemsets in dynamic profit databases. Knowl-Based Syst 175:130–144

    Article  Google Scholar 

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

  26. Yun U, 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. Futur Gener Comput Syst 103:58–78

    Article  Google Scholar 

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

  28. Le T, Vo B (2015) An N-list-based algorithm for mining frequent closed patterns. Expert Syst Appl 42(19):6648–6657

    Article  Google Scholar 

  29. Pasquier N, Bastide Y, Taouil R, Lakhal L (1999) Discovering frequent closed itemsets for association rules, in Database Theory - ICDT'99, Jerusalem, Israel

  30. Pei J, Han J Mao R (2000) CLOSET: an efficient algorithm for mining frequent closet itemsets, in 2000 ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, Dallas, Texas, USA

  31. Vo B, Hong L, Le B (2012) DBV-miner: a dynamic bit-vector approach for fast mining frequent closed itemsets. Expert Syst Appl 39(8):7196–7206

    Article  Google Scholar 

  32. Vo B (2017) An efficient method for mining frequent weighted closed itemsets from weighted item transaction databases. Journal of Information Science & Engineering 33(1):199–216

    Google Scholar 

  33. Dam TL, Li K, Fournier-Viger P, Duong QH (2019) CLS-miner: efficient and effective closed high-utility itemset mining. Frontiers of Computer Science 13(2):357–381

    Article  Google Scholar 

  34. Fournier-Viger PZS, Lin JCW, Wu CW, Tseng VS (2016) EFIM-closed: fast and memory efficient discovery of closed high-utility itemsets, in International Conference on Machine Learning and Data Mining in Pattern Recognition, New York

  35. Nguyen LTT, Vu VV, Lam MTH, Duong TTM, Manh LT, Nguyen TTT, Vo B, Fujita H (2019) An efficient method for mining high utility closed itemsets. Inf Sci 495:78–99

    Article  Google Scholar 

  36. Wei T, Wang B, Zhang Y, Hu K, Yao Y, Liu H (2020) FCHUIM: efficient frequent and closed high-utility itemsets mining. IEEE Access 8:109928–109939

    Article  Google Scholar 

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

    Google Scholar 

  38. Yun U, Leggett JJ (2005) WFIM: weighted frequent itemset mining with a weight range and a minimum weight, in Proceedings of the 2005 SIAM International Conference on Data Mining

  39. Lan GC, Hong TP, Lee HY, Lin CW (2015) Tightening upper bounds for mining weighted frequent itemsets. Intelligent Data Analysis 19(2):413–429

    Article  Google Scholar 

  40. Li Z, Chen F, Wu J, Liu Z, Liu W (2020) Efficient weighted probabilistic frequent itemset mining in uncertain databases, Expert Systems, p. e12551

  41. Zaki M, Hsiao C (2005) Efficient algorithm for mining closed itemsets and their lattice structure. IEEE Transaction on Knowledge and Data Engineering 17(4):462–478

    Article  Google Scholar 

  42. Zaki MJ, Gouda K (2003) "Fast vertical mining using diffsets, in Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington, DC, USA

  43. Deng Z, Wang Z, Jiang J (2012) A new algorithm for fast mining frequent itemsets using N-lists. SCIENCE CHINA Inf Sci 55(9):2008–2030

    Article  MathSciNet  Google Scholar 

  44. Wang J, Han J, Pei J (2003) CLOSET+ : searching for best strategies for mining frequent closed itemsets," in Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington, DC, USA

  45. Grahne G, Zhu J (2005) Fast algorithms for frequent itemset mining using FP-trees. IEEE Trans Knowl Data Eng 17(10):1347–1362

    Article  Google Scholar 

  46. Lucchese C, Orlando S, Perego R (2006) Fast and memory efficient mining of frequent closed itemsets. IEEE Trans Knowl Data Eng 18(1):21–36

    Article  Google Scholar 

  47. Hashem T, Karim MR, Samiullah M, Ahmed CF (2017) An efficient dynamic superset bit-vector approach for mining frequent closed itemsets and their lattice structure. Expert Syst Appl 67:252–271

    Article  Google Scholar 

  48. Vanahalli MK, Patil N (2019) An efficient parallel row enumerated algorithm for mining frequent colossal closed itemsets from high dimensional datasets. Inf Sci 496:343–362

    Article  Google Scholar 

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

    Article  Google Scholar 

  50. Huynh-Thi-Le Q, Le T, Vo B, Le B (2015) An efficient and effective algorithm for mining top-rank-k frequent patterns. Expert Syst Appl 42(1):156–164

    Article  Google Scholar 

  51. Zaki MJ (2004) Mining non-redundant association rules. Data Min Knowl Disc 9(3):223–248

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Huong Bui & Tu-Anh Nguyen-Hoang

  2. Vietnam National University, Ho Chi Minh City, Vietnam

    Huong Bui & Tu-Anh Nguyen-Hoang

  3. Faculty of Information Technology, Ho Chi Minh City University of Technology (HUTECH), Ho Chi Minh City, Vietnam

    Bay Vo

  4. Department of Computer Engineering, Sejong University, Seoul, Republic of Korea

    Unil Yun

Authors
  1. Huong Bui
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bay Vo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Tu-Anh Nguyen-Hoang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Unil Yun
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Bay Vo.

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

Bui, H., Vo, B., Nguyen-Hoang, TA. et al. Mining frequent weighted closed itemsets using the WN-list structure and an early pruning strategy. Appl Intell 51, 1439–1459 (2021). https://doi.org/10.1007/s10489-020-01899-7

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10489-020-01899-7

Keywords

Search

Navigation