{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T15:27:08Z","timestamp":1772206028815,"version":"3.50.1"},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,2,6]],"date-time":"2024-02-06T00:00:00Z","timestamp":1707177600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,2,6]],"date-time":"2024-02-06T00:00:00Z","timestamp":1707177600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U21A20513"],"award-info":[{"award-number":["U21A20513"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Taishan Scholars Program of Shandong Province","award":["tsqn202211091"],"award-info":[{"award-number":["tsqn202211091"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Sci. Eng."],"published-print":{"date-parts":[[2024,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Top-<jats:italic>k<\/jats:italic> frequent itemset mining (top-<jats:italic>k<\/jats:italic> FIM) plays an important role in many practical applications. It reports the <jats:italic>k<\/jats:italic> itemsets with the highest supports. Rather than the subtle minimum support threshold specified in FIM, top-<jats:italic>k<\/jats:italic> FIM only needs the more understandable parameter of the result number. The existing algorithms require at least two passes of scan on the table, and incur high execution cost on massive data. This paper develops a prefix-partitioning-based PTF algorithm to mine top-<jats:italic>k<\/jats:italic> frequent itemsets efficiently, where each prefix-based partition keeps the transactions sharing the same prefix item. PTF can skip most of the partitions directly which cannot generate any top-<jats:italic>k<\/jats:italic> frequent itemsets. Vertical mining is developed to process the partitions of vertical representation with the high-support-first principle, and only a small fraction of the items are involved in the processing of the partitions. Two improvements are proposed to reduce execution cost further. Hybrid vertical storage mode maintains the prefix-based partitions adaptively and the candidate pruning reduces the number of the explored candidates. The extensive experimental results show that, on massive data, PTF can achieve up to 1348.53 times speedup ratio and involve up to 355.31 times less I\/O cost compared with the state-of-the-art algorithms.<\/jats:p>","DOI":"10.1007\/s41019-024-00241-2","type":"journal-article","created":{"date-parts":[[2024,2,6]],"date-time":"2024-02-06T10:02:10Z","timestamp":1707213730000},"page":"177-203","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Efficient Top-k Frequent Itemset Mining on Massive Data"],"prefix":"10.1007","volume":"9","author":[{"given":"Xiaolong","family":"Wan","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5477-9249","authenticated-orcid":false,"given":"Xixian","family":"Han","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,6]]},"reference":[{"key":"241_CR1","doi-asserted-by":"publisher","first-page":"114530","DOI":"10.1016\/j.eswa.2020.114530","volume":"169","author":"AA Abdelaal","year":"2021","unstructured":"Abdelaal AA, Abed S, Alshayeji M, Al-laho M (2021) Customized frequent patterns mining algorithms for enhanced top-rank-k frequent pattern mining. Expert Syst Appl 169:114530","journal-title":"Expert Syst Appl"},{"key":"241_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-14142-8","volume-title":"Data mining\u2014the textbook","author":"CC Aggarwal","year":"2015","unstructured":"Aggarwal CC (2015) Data mining\u2014the textbook. Springer, Berlin"},{"key":"241_CR3","volume-title":"Frequent pattern mining","year":"2014","unstructured":"Aggarwal CC, Han J (eds) (2014) Frequent pattern mining. Springer, Berlin"},{"key":"241_CR4","doi-asserted-by":"crossref","unstructured":"Agrawal R, Imielinski T, Swami AN (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\u2013216","DOI":"10.1145\/170035.170072"},{"key":"241_CR5","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules in large databases. In: Proceedings of 20th international conference on very large data bases, pp 487\u2013499"},{"issue":"21","key":"241_CR6","doi-asserted-by":"publisher","first-page":"7882","DOI":"10.1016\/j.eswa.2015.06.021","volume":"42","author":"K Amphawan","year":"2015","unstructured":"Amphawan K, Lenca P (2015) Mining top-k frequent-regular closed patterns. Expert Syst Appl 42(21):7882\u20137894","journal-title":"Expert Syst Appl"},{"key":"241_CR7","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.bdr.2017.06.006","volume":"9","author":"D Apiletti","year":"2017","unstructured":"Apiletti D, Baralis E, Cerquitelli T, Garza P, Pulvirenti F, Venturini L (2017) Frequent itemsets mining for big data: a comparative analysis. Big Data Res 9:67\u201383","journal-title":"Big Data Res"},{"key":"241_CR8","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.eswa.2018.03.041","volume":"105","author":"N Aryabarzan","year":"2018","unstructured":"Aryabarzan N, Minaei-Bidgoli B, Teshnehlab M (2018) negFIN: an efficient algorithm for fast mining frequent itemsets. Expert Syst Appl 105:129\u2013143","journal-title":"Expert Syst Appl"},{"issue":"4","key":"241_CR9","first-page":"83:1","volume":"51","author":"G Atluri","year":"2018","unstructured":"Atluri G, Karpatne A, Kumar V (2018) Spatio-temporal data mining: a survey of problems and methods. ACM Comput Surv 51(4):83:1-83:41","journal-title":"ACM Comput Surv"},{"issue":"1","key":"241_CR10","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/j.datak.2006.07.008","volume":"62","author":"S Bistarelli","year":"2007","unstructured":"Bistarelli S, Bonchi F (2007) Soft constraint based pattern mining. Data Knowl Eng 62(1):118\u2013137","journal-title":"Data Knowl Eng"},{"issue":"11","key":"241_CR11","doi-asserted-by":"publisher","first-page":"1490","DOI":"10.1109\/TKDE.2005.183","volume":"17","author":"D Burdick","year":"2005","unstructured":"Burdick D, Calimlim M, Flannick J, Gehrke J, Yiu T (2005) MAFIA: a maximal frequent itemset algorithm. IEEE Trans Knowl Data Eng 17(11):1490\u20131504","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"241_CR12","volume-title":"Wiley encyclopedia of management\u2014vol 12 strategic management","author":"DF Channon","year":"2015","unstructured":"Channon DF, Sammut-Bonnici T (2015) Wiley encyclopedia of management\u2014vol 12 strategic management. Wiley, New York"},{"issue":"1","key":"241_CR13","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s10844-013-0265-4","volume":"42","author":"H Chen","year":"2014","unstructured":"Chen H (2014) Mining top-k frequent patterns over data streams sliding window. J Intell Inf Syst 42(1):111\u2013131","journal-title":"J Intell Inf Syst"},{"issue":"9","key":"241_CR14","doi-asserted-by":"publisher","first-page":"1052","DOI":"10.1109\/TKDE.2004.44","volume":"16","author":"Y-L Cheung","year":"2004","unstructured":"Cheung Y-L, Fu AW-C (2004) Mining frequent itemsets without support threshold: With and without item constraints. IEEE Trans Knowl Data Eng 16(9):1052\u20131069","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"5","key":"241_CR15","doi-asserted-by":"publisher","first-page":"1321","DOI":"10.1007\/s00778-007-0078-6","volume":"17","author":"K-T Chuang","year":"2008","unstructured":"Chuang K-T, Huang J-L, Chen M-S (2008) Mining phtop-k frequent patterns in the presence of the memory constraint. VLDB J 17(5):1321\u20131344","journal-title":"VLDB J"},{"issue":"3","key":"241_CR16","doi-asserted-by":"publisher","first-page":"809","DOI":"10.1007\/s10489-017-0932-1","volume":"47","author":"S Dawar","year":"2017","unstructured":"Dawar S, Goyal V, Bera D (2017) A hybrid framework for mining high-utility itemsets in a sparse transaction database. Appl Intell 47(3):809\u2013827","journal-title":"Appl Intell"},{"key":"241_CR17","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1016\/j.asoc.2016.01.010","volume":"41","author":"Z-H Deng","year":"2016","unstructured":"Deng Z-H (2016) DiffNodesets: an efficient structure for fast mining frequent itemsets. Appl Soft Comput 41:214\u2013223","journal-title":"Appl Soft Comput"},{"issue":"10","key":"241_CR18","doi-asserted-by":"publisher","first-page":"4505","DOI":"10.1016\/j.eswa.2014.01.025","volume":"41","author":"Z-H Deng","year":"2014","unstructured":"Deng Z-H, Lv S-L (2014) Fast mining frequent itemsets using nodesets. Expert Syst Appl 41(10):4505\u20134512","journal-title":"Expert Syst Appl"},{"issue":"9","key":"241_CR19","doi-asserted-by":"publisher","first-page":"2008","DOI":"10.1007\/s11432-012-4638-z","volume":"55","author":"Z-H Deng","year":"2012","unstructured":"Deng Z-H, Wang Z, Jiang J-J (2012) A new algorithm for fast mining frequent itemsets using n-lists. Sci China Inf Sci 55(9):2008\u20132030","journal-title":"Sci China Inf Sci"},{"key":"241_CR20","doi-asserted-by":"crossref","unstructured":"Dunkel B, Soparkar N (1999) Data organization and access for efficient data mining. In: Proceedings of the 15th international conference on data engineering, pp 522\u2013529","DOI":"10.1109\/ICDE.1999.754968"},{"key":"241_CR21","doi-asserted-by":"crossref","unstructured":"Fang G-D, Deng Z-H (2008) VTK: vertical mining of top-rank-k frequent patterns. In: Ma J, Yin Y, Yu J, Zhou S (eds) Fifth international conference on fuzzy systems and knowledge discovery, FSKD 2008, 18\u201320 October 2008, Jinan, Shandong, China, Proceedings, vol 2. IEEE Computer Society, pp 620\u2013624","DOI":"10.1109\/FSKD.2008.472"},{"key":"241_CR22","doi-asserted-by":"crossref","unstructured":"Fournier-Viger, P, Lin JC-W, Gomariz A, Gueniche T et\u00a0al (2016) The SPMF open-source data mining library version 2. In: Proceedings of 19th European conference on principles of data mining and knowledge discovery, Part III, volume 9853 of LNCS. Springer, Berlin, pp 36\u201340","DOI":"10.1007\/978-3-319-46131-1_8"},{"key":"241_CR23","doi-asserted-by":"crossref","unstructured":"Fu AW-C, Kwong RW-w, Tang J (2000) Mining phN-most interesting itemsets. In: Proceedings of the 12th international symposium on foundations of intelligent systems, volume 1932 of LNCS, pp 59\u201367. Springer, Berlin","DOI":"10.1007\/3-540-39963-1_7"},{"issue":"10","key":"241_CR24","doi-asserted-by":"publisher","first-page":"1347","DOI":"10.1109\/TKDE.2005.166","volume":"17","author":"G Grahne","year":"2005","unstructured":"Grahne G, Zhu J (2005) Fast algorithms for frequent itemset mining using fp-trees. IEEE Trans Knowl Data Eng 17(10):1347\u20131362","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"2","key":"241_CR25","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1007\/s10618-016-0480-z","volume":"31","author":"V Grossi","year":"2017","unstructured":"Grossi V, Romei A, Turini F (2017) Survey on using constraints in data mining. Data Min Knowl Discov 31(2):424\u2013464","journal-title":"Data Min Knowl Discov"},{"key":"241_CR26","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1016\/j.artint.2015.09.007","volume":"244","author":"T Guns","year":"2017","unstructured":"Guns T, Dries A, Nijssen S, Tack G, De Raedt L (2017) MiningZinc: a declarative framework for constraint-based mining. Artif Intell 244:6\u201329","journal-title":"Artif Intell"},{"issue":"12\u201313","key":"241_CR27","doi-asserted-by":"publisher","first-page":"1951","DOI":"10.1016\/j.artint.2011.05.002","volume":"175","author":"T Guns","year":"2011","unstructured":"Guns T, Nijssen S, De Raedt L (2011) Itemset mining: a constraint programming perspective. Artif Intell 175(12\u201313):1951\u20131983","journal-title":"Artif Intell"},{"issue":"4","key":"241_CR28","doi-asserted-by":"publisher","first-page":"1674","DOI":"10.1109\/TKDE.2019.2945573","volume":"33","author":"Z Halim","year":"2021","unstructured":"Halim Z, Ali O, Khan MG (2021) On the efficient representation of datasets as graphs to mine maximal frequent itemsets. IEEE Trans Knowl Data Eng 33(4):1674\u20131691","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"1","key":"241_CR29","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10618-006-0059-1","volume":"15","author":"J Han","year":"2007","unstructured":"Han J, Cheng H, Xin D, Yan X (2007) Frequent pattern mining: current status and future directions. Data Min Knowl Discov 15(1):55\u201386","journal-title":"Data Min Knowl Discov"},{"issue":"1","key":"241_CR30","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1023\/B:DAMI.0000005258.31418.83","volume":"8","author":"J Han","year":"2004","unstructured":"Han J, Pei J, Yin Y, Mao R (2004) Mining frequent patterns without candidate generation: a frequent-pattern tree approach. Data Min Knowl Discov 8(1):53\u201387","journal-title":"Data Min Knowl Discov"},{"key":"241_CR31","doi-asserted-by":"publisher","first-page":"31409","DOI":"10.1109\/ACCESS.2019.2902602","volume":"7","author":"X Han","year":"2019","unstructured":"Han X, Liu X, Chen J, Lai G, Gao H, Li J (2019) Efficiently mining frequent itemsets on massive data. IEEE Access 7:31409\u201331421","journal-title":"IEEE Access"},{"key":"241_CR32","doi-asserted-by":"crossref","unstructured":"Hirano S, Tsumoto S (2019) Mining frequent temporal patterns from medical data based on fuzzy ranged relations. In: 2019 IEEE international conference on big data (big data), pp 2654\u20132658. IEEE","DOI":"10.1109\/BigData47090.2019.9006563"},{"key":"241_CR33","doi-asserted-by":"crossref","unstructured":"Keogh EJ, Lonardi S, Ratanamahatana C (2004) Towards parameter-free data mining. In: Proceedings of the tenth ACM SIGKDD international conference on knowledge discovery and data mining. ACM, pp 206\u2013215","DOI":"10.1145\/1014052.1014077"},{"key":"241_CR34","unstructured":"Kersten ML, Sidirourgos L (2017) A database system with amnesia. In: 8th Biennial conference on innovative data systems research, CIDR 2017, Chaminade, CA, USA, January 8\u201311, 2017, Online Proceedings. http:\/\/www.cidrdb.org"},{"issue":"19","key":"241_CR35","doi-asserted-by":"publisher","first-page":"6648","DOI":"10.1016\/j.eswa.2015.04.048","volume":"42","author":"T Le","year":"2015","unstructured":"Le T, Vo B (2015) An n-list-based algorithm for mining frequent closed patterns. Expert Syst Appl 42(19):6648\u20136657","journal-title":"Expert Syst Appl"},{"key":"241_CR36","doi-asserted-by":"crossref","unstructured":"Lee J, Clifton CW (2014) Top-k frequent itemsets via differentially private FP-trees. In: The 20th ACM SIGKDD international conference on knowledge discovery and data mining, pp 931\u2013940. ACM","DOI":"10.1145\/2623330.2623723"},{"key":"241_CR37","doi-asserted-by":"crossref","unstructured":"Li H, Wang Y, Zhang D, Zhang M, Chang EY (2008) PFP: parallel FP-growth for query recommendation. In: Pu P, Bridge DG, Mobasher B, Ricci F (eds) Proceedings of the 2008 ACM conference on recommender systems, RecSys 2008, Lausanne, Switzerland, October 23\u201325, 2008. ACM, pp 107\u2013114","DOI":"10.1145\/1454008.1454027"},{"key":"241_CR38","doi-asserted-by":"crossref","unstructured":"Liang W, Chen H, Zhang J, Zhao D, Li C (2020) An effective scheme for top-k frequent itemset mining under differential privacy conditions. Sci China Inf Sci 63(5)","DOI":"10.1007\/s11432-018-9849-y"},{"issue":"3","key":"241_CR39","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1023\/B:DAMI.0000041128.59011.53","volume":"9","author":"G Liu","year":"2004","unstructured":"Liu G, Hongjun L, Lou W, Yabo X, Xu JY (2004) Efficient mining of frequent patterns using ascending frequency ordered prefix-tree. Data Min Knowl Discov 9(3):249\u2013274","journal-title":"Data Min Knowl Discov"},{"key":"241_CR40","doi-asserted-by":"crossref","unstructured":"Luna JM, Fournier-Viger P, Ventura S (2019) Frequent itemset mining: a 25 years review. Wiley Interdiscip Rev Data Min Knowl Discov 9(6)","DOI":"10.1002\/widm.1329"},{"issue":"2","key":"241_CR41","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1093\/bib\/bbt074","volume":"16","author":"S Naulaerts","year":"2015","unstructured":"Naulaerts S, Meysman P, Bittremieux W, Trung-Nghia V et al (2015) A primer to frequent itemset mining for bioinformatics. Briefings Bioinform 16(2):216\u2013231","journal-title":"Briefings Bioinform"},{"key":"241_CR42","doi-asserted-by":"crossref","unstructured":"Park JS, Chen M-S, Yu PS (1995) An effective hash based algorithm for mining association rules. In: Proceedings of the 1995 ACM SIGMOD international conference on management of data. ACM Press, pp 175\u2013186","DOI":"10.1145\/568271.223813"},{"key":"241_CR43","unstructured":"Pei J, Han J, Lu H, Nishio S, Tang S, Yang D (2001) H-mine: hyper-structure mining of frequent patterns in large databases. In: Proceedings of the 2001 IEEE international conference on data mining, pp 441\u2013448"},{"key":"241_CR44","doi-asserted-by":"publisher","first-page":"118156","DOI":"10.1109\/ACCESS.2020.3004528","volume":"8","author":"T-T Pham","year":"2020","unstructured":"Pham T-T, Do T, Nguyen A, Vo B, Hong T-P (2020) An efficient method for mining top-k closed sequential patterns. IEEE Access 8:118156\u2013118163","journal-title":"IEEE Access"},{"issue":"1","key":"241_CR45","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/s10489-013-0506-9","volume":"41","author":"G Pyun","year":"2014","unstructured":"Pyun G, Yun U (2014) Mining top-k frequent patterns with combination reducing techniques. Appl Intell 41(1):76\u201398","journal-title":"Appl Intell"},{"issue":"1","key":"241_CR46","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s10115-010-0363-3","volume":"30","author":"A Salam","year":"2012","unstructured":"Salam A, Khayal MSH (2012) Mining top-k frequent patterns without minimum support threshold. Knowl Inf Syst 30(1):57\u201386","journal-title":"Knowl Inf Syst"},{"key":"241_CR47","unstructured":"Savasere A, Omiecinski E, Navathe SB (1995) An efficient algorithm for mining association rules in large databases. In: Proceedings of 21th international conference on very large data bases. Morgan Kaufmann, pp 432\u2013444"},{"issue":"4","key":"241_CR48","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1007\/s10723-018-9456-0","volume":"17","author":"A Shah","year":"2019","unstructured":"Shah A, Halim Z (2019) On efficient mining of frequent itemsets from big uncertain databases. J Grid Comput 17(4):831\u2013850","journal-title":"J Grid Comput"},{"key":"241_CR49","doi-asserted-by":"crossref","unstructured":"Tang B, Zeng J, Tang Q, Yang C, Shen Q, Hou U L, Yan X, Zeng D (2022) CheetahKG: a demonstration for core-based top-k frequent pattern discovery on knowledge graphs. In 38th IEEE International Conference on Data Engineering, ICDE 2022, pp 3134\u20133137. IEEE","DOI":"10.1109\/ICDE53745.2022.00281"},{"issue":"4","key":"241_CR50","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1007\/s10115-004-0175-4","volume":"7","author":"P Tzvetkov","year":"2005","unstructured":"Tzvetkov P, Yan X, Han J (2005) TSP: mining top-phk closed sequential patterns. Knowl Inf Syst 7(4):438\u2013457","journal-title":"Knowl Inf Syst"},{"issue":"2","key":"241_CR51","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/s10844-013-0281-4","volume":"44","author":"W Ugarte","year":"2015","unstructured":"Ugarte W, Boizumault P, Loudni S, Cr\u00e9milleux B, Lepailleur A (2015) Soft constraints for pattern mining. J Intell Inf Syst 44(2):193\u2013221","journal-title":"J Intell Inf Syst"},{"key":"241_CR52","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1016\/j.eswa.2016.12.023","volume":"73","author":"B Vo","year":"2017","unstructured":"Vo B, Pham S, Le T, Deng Z-H (2017) A novel approach for mining maximal frequent patterns. Expert Syst Appl 73:178\u2013186","journal-title":"Expert Syst Appl"},{"issue":"5","key":"241_CR53","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1109\/TKDE.2005.81","volume":"17","author":"J Wang","year":"2005","unstructured":"Wang J, Han J, Ying L, Tzvetkov P (2005) TFP: an efficient algorithm for mining top-k frequent closed itemsets. IEEE Trans Knowl Data Eng 17(5):652\u2013664","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"241_CR54","doi-asserted-by":"publisher","first-page":"7352","DOI":"10.1038\/s41598-022-10648-4","volume":"12","author":"T Xu","year":"2022","unstructured":"Xu T, Xu A, Mango J, Liu P, Ma X, Zhang L (2022) Efficient processing of top-k frequent spatial keyword queries. Sci Rep 12:7352","journal-title":"Sci Rep"},{"issue":"3","key":"241_CR55","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1109\/69.846291","volume":"12","author":"MJ Zaki","year":"2000","unstructured":"Zaki MJ (2000) Scalable algorithms for association mining. IEEE Trans Knowl Data Eng 12(3):372\u2013390","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"241_CR56","doi-asserted-by":"crossref","unstructured":"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. ACM, pp 326\u2013335","DOI":"10.1145\/956750.956788"},{"key":"241_CR57","doi-asserted-by":"crossref","unstructured":"Zaki MJ, Hsiao C-J (2002) CHARM: an efficient algorithm for closed itemset mining. In: Proceedings of the Second SIAM international conference on data mining. SIAM, pp 457\u2013473","DOI":"10.1137\/1.9781611972726.27"},{"issue":"2","key":"241_CR58","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s10115-007-0081-7","volume":"15","author":"S Zhang","year":"2008","unstructured":"Zhang S, Xindong W, Zhang C, Jingli L (2008) Computing the minimum-support for mining frequent patterns. Knowl Inf Syst 15(2):233\u2013257","journal-title":"Knowl Inf Syst"}],"container-title":["Data Science and Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41019-024-00241-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41019-024-00241-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41019-024-00241-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,11]],"date-time":"2024-06-11T17:19:54Z","timestamp":1718126394000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s41019-024-00241-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,6]]},"references-count":58,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["241"],"URL":"https:\/\/doi.org\/10.1007\/s41019-024-00241-2","relation":{},"ISSN":["2364-1185","2364-1541"],"issn-type":[{"value":"2364-1185","type":"print"},{"value":"2364-1541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,2,6]]},"assertion":[{"value":"29 May 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 October 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 December 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 February 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors. Results are gotten through simulation and tested number of times to take final value.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval"}}]}}