{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T02:06:26Z","timestamp":1780970786838,"version":"3.54.1"},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T00:00:00Z","timestamp":1770249600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T00:00:00Z","timestamp":1770249600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"DOI":"10.1007\/s11227-026-08247-5","type":"journal-article","created":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T05:52:51Z","timestamp":1770270771000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Efficiently mining frequent weighted utility closed patterns with pruning strategies from dynamic quantitative databases"],"prefix":"10.1007","volume":"82","author":[{"given":"Nguyen","family":"Le","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ham","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Minh","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Huong","family":"Bui","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Unil","family":"Yun","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bay","family":"Vo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,2,5]]},"reference":[{"key":"8247_CR1","doi-asserted-by":"crossref","unstructured":"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","DOI":"10.1145\/170035.170072"},{"key":"8247_CR2","doi-asserted-by":"crossref","unstructured":"Han J, Pei J, Yin Y, (2000) Mining frequent patterns without candidate generation. In: The 2000 ACM SIGMOD International Conference on Management of Data","DOI":"10.1145\/342009.335372"},{"issue":"3","key":"8247_CR3","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"},{"issue":"9","key":"8247_CR4","doi-asserted-by":"publisher","first-page":"2008","DOI":"10.1007\/s11432-012-4638-z","volume":"55","author":"Z Deng","year":"2012","unstructured":"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\u20132030","journal-title":"Sci China Inf Sci"},{"issue":"2","key":"8247_CR5","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/s13042-014-0252-2","volume":"7","author":"B Vo","year":"2016","unstructured":"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\u2013265","journal-title":"Int J Mach Learn Cybern"},{"key":"8247_CR6","doi-asserted-by":"crossref","unstructured":"Pasquier N, Bastide Y, Taouil R, Lakhal L, (1999) Discovering frequent closed itemsets for association rules. In: Database Theory - ICDT'99, Jerusalem, Israel","DOI":"10.1007\/3-540-49257-7_25"},{"key":"8247_CR7","unstructured":"Zaki MJ, Hsiao C-J (1999) CHARM: an efficient algorithm for closed association rule mining. Technical Report 99"},{"issue":"1","key":"8247_CR8","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/TKDE.2006.10","volume":"18","author":"C Lucchese","year":"2006","unstructured":"Lucchese C, Orlando S, Perego R (2006) Fast and memory efficient mining of frequent closed itemsets. IEEE Trans Knowl Data Eng 18(1):21\u201336","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"19","key":"8247_CR9","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":"8247_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.114738","volume":"174","author":"N Aryabarzan","year":"2021","unstructured":"Aryabarzan N, Minaei-Bidgoli B (2021) Neclatclosed: a vertical algorithm for mining frequent closed itemsets. Expert Syst Appl 174:114738","journal-title":"Expert Syst Appl"},{"issue":"1","key":"8247_CR11","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1142\/S0218488517500052","volume":"25","author":"G Lee","year":"2017","unstructured":"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\u2013144","journal-title":"Int J Uncertain Fuzziness Knowl Based Syst"},{"key":"8247_CR12","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1016\/j.eswa.2017.10.039","volume":"96","author":"H Bui","year":"2018","unstructured":"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\u2013405","journal-title":"Expert Syst Appl"},{"key":"8247_CR13","doi-asserted-by":"crossref","unstructured":"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. Knowledge-Based Systems, Vols. 201\u2013202, p. ID 106064","DOI":"10.1016\/j.knosys.2020.106064"},{"key":"8247_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2023.111060","volume":"282","author":"S Kim","year":"2023","unstructured":"Kim S, Kim H, Cho M, Kim H, Vo B, Lin JCW, Yun U (2023) Efficient approach for mining high-utility patterns on incremental databases with dynamic profits. Knowl Based Syst 282:111060","journal-title":"Knowl Based Syst"},{"issue":"1","key":"8247_CR15","doi-asserted-by":"publisher","first-page":"767","DOI":"10.1007\/s10489-023-05145-8","volume":"54","author":"B Huynh","year":"2024","unstructured":"Huynh B, Tung NT, Nguyen TD, Trinh C, Snasel V, Nguyen L (2024) New approaches for mining high utility itemsets with multiple utility thresholds. Appl Intell 54(1):767\u2013790","journal-title":"Appl Intell"},{"key":"8247_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2024.121218","volume":"681","author":"Y Yan","year":"2024","unstructured":"Yan Y, Niu X, Zhang Z, Fournier-Viger P, Ye L, Min F (2024) Efficient high utility itemset mining without the join operation. Inf Sci 681:121218","journal-title":"Inf Sci"},{"key":"8247_CR17","doi-asserted-by":"publisher","first-page":"1288","DOI":"10.1016\/j.ins.2022.07.037","volume":"609","author":"C Lee","year":"2022","unstructured":"Lee C, Baek Y, Ryu T, Kim H, Kim H, Lin JCW, Vo B, Yun U (2022) An efficient approach for mining maximized erasable utility patterns. Inf Sci 609:1288\u20131308","journal-title":"Inf Sci"},{"key":"8247_CR18","doi-asserted-by":"crossref","unstructured":"Kim H, Cho M, Nam H, Baek Y, Park S, Kim D, Vo B, Yun U (2024) Advanced incremental erasable pattern mining from the time-sensitive data stream. Knowledge-Based Systems, pp. 299, 112001","DOI":"10.1016\/j.knosys.2024.112001"},{"key":"8247_CR19","doi-asserted-by":"crossref","unstructured":"Khan MS, Muyeba M, Coenen F (2008) A weighted utility framework for mining association rules. In: Computer Modeling and Simulation, 2008","DOI":"10.1109\/EMS.2008.73"},{"key":"8247_CR20","doi-asserted-by":"crossref","unstructured":"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 Cybernetics, vol. 31","DOI":"10.15625\/1813-9663\/31\/1\/5154"},{"key":"8247_CR21","doi-asserted-by":"crossref","unstructured":"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, 2016.","DOI":"10.1109\/SMC.2016.7844428"},{"issue":"1","key":"8247_CR22","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/s10489-022-03580-7","volume":"53","author":"H Nguyen","year":"2023","unstructured":"Nguyen H, Le N, Bui H, Le T (2023) A new approach for efficiently mining frequent weighted utility patterns. Appl Intell 53(1):121\u2013140","journal-title":"Appl Intell"},{"issue":"16","key":"8247_CR23","doi-asserted-by":"publisher","first-page":"19629","DOI":"10.1007\/s10489-023-04554-z","volume":"53","author":"H Nguyen","year":"2023","unstructured":"Nguyen H, Le N, Bui H, Le T (2023) Mining frequent weighted utility patterns with dynamic weighted items from quantitative databases. Appl Intell 53(16):19629\u201319646","journal-title":"Appl Intell"},{"key":"8247_CR24","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1137\/1.9781611972740.51"},{"key":"8247_CR25","doi-asserted-by":"crossref","unstructured":"Liu Y, Liao W, Choudhary A, (2005) A two-phase algorithm for fast discovery of high utility itemsets. In: Advances in Knowledge Discovery and Data Mining, vol. 3518, pp. 689\u2013695.","DOI":"10.1007\/11430919_79"},{"key":"8247_CR26","doi-asserted-by":"crossref","unstructured":"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","DOI":"10.1145\/1835804.1835839"},{"issue":"8","key":"8247_CR27","doi-asserted-by":"publisher","first-page":"1772","DOI":"10.1109\/TKDE.2012.59","volume":"25","author":"VS Tseng","year":"2012","unstructured":"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\u20131786","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"8247_CR28","doi-asserted-by":"crossref","unstructured":"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","DOI":"10.1145\/2396761.2396773"},{"key":"8247_CR29","doi-asserted-by":"crossref","unstructured":"Fournier-Viger P, Wu CW, Zida S, Tseng VS (2014) FHM: faster high-utility itemset mining using estimated utility co-occurrence pruning. In: Foundations of Intelligent Systems: 21st International Symposium, ISMIS 2014, Roskilde, Denmark","DOI":"10.1007\/978-3-319-08326-1_9"},{"issue":"2","key":"8247_CR30","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/s10115-016-0986-0","volume":"51","author":"S Zida","year":"2017","unstructured":"Zida S, Fournier-Viger P, Lin JCW, Wu CW, Tseng VS (2017) EFIM: a fast and memory efficient algorithm for high-utility itemset mining. Knowl Inf Syst 51(2):595\u2013625","journal-title":"Knowl Inf Syst"},{"key":"8247_CR31","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1016\/j.eswa.2017.08.028","volume":"90","author":"S Krishnamoorthy","year":"2017","unstructured":"Krishnamoorthy S (2017) HMiner: efficiently mining high utility itemsets. Expert Syst Appl 90:168\u2013183","journal-title":"Expert Syst Appl"},{"key":"8247_CR32","doi-asserted-by":"publisher","first-page":"1859","DOI":"10.1007\/s10489-017-1057-2","volume":"48","author":"QH Duong","year":"2018","unstructured":"Duong QH, Fournier-Viger P, Ramampiaro H, Norvag K, Dam TL (2018) Efficient high utility itemset mining using buffered utility-lists. Appl Intell 48:1859\u20131877","journal-title":"Appl Intell"},{"key":"8247_CR33","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/j.knosys.2019.03.022","volume":"175","author":"LTT Nguyen","year":"2019","unstructured":"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\u2013144","journal-title":"Knowl Based Syst"},{"key":"8247_CR34","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2022.108865","volume":"248","author":"P Wu","year":"2022","unstructured":"Wu P, Niu X, Fournier-Viger P, Huang C, Wang B (2022) UBP-Miner: an efficient bit based high utility itemset mining algorithm. Knowl-Based Syst 248:108865","journal-title":"Knowl-Based Syst"},{"issue":"5","key":"8247_CR35","first-page":"6099","volume":"53","author":"G Li","year":"2023","unstructured":"Li G, Shang T, Zhang Y (2023) Efficient mining high average-utility itemsets with effective pruning strategies and novel list structure. Appl Intell 53(5):6099\u20136118","journal-title":"Appl Intell"},{"key":"8247_CR36","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2023.119924","volume":"657","author":"H Kim","year":"2024","unstructured":"Kim H, Kim H, Cho M, Vo B, Lin JCW, Fujita H, Yun U (2024) Efficient approach of high average utility pattern mining with indexed list-based structure in dynamic environments. Inf Sci 657:119924","journal-title":"Inf Sci"},{"key":"8247_CR37","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2024.111796","volume":"294","author":"H Duong","year":"2024","unstructured":"Duong H, Truong T, Le B, Fournier-Viger P (2024) Mining interesting sequential patterns using a novel balanced utility measure. Knowl-Based Syst 294:111796","journal-title":"Knowl-Based Syst"},{"issue":"7","key":"8247_CR38","doi-asserted-by":"publisher","first-page":"3009","DOI":"10.1109\/TKDE.2024.3349454","volume":"36","author":"J He","year":"2024","unstructured":"He J, Han X, Wan X, Wang J (2024) Efficient skyline frequent-utility itemset mining algorithm on massive data. IEEE Trans Knowl Data Eng 36(7):3009\u20133023","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"8247_CR39","doi-asserted-by":"crossref","unstructured":"Vo B, Le B, Jung JJ (2012), A tree-based approach for mining frequent weighted utility itemsets. In: Computational Collective Intelligence. Technologies and Applications. Springer, pp. 114\u2013123.","DOI":"10.1007\/978-3-642-34630-9_12"},{"issue":"3","key":"8247_CR40","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1080\/01969722.2016.1276774","volume":"48","author":"T Tran","year":"2017","unstructured":"Tran T, Vo B, Le TTN, Nguyen NT (2017) Text clustering using frequent weighted utility itemsets. Cybernet Syst 48(3):193\u2013209","journal-title":"Cybernet Syst"},{"key":"8247_CR41","doi-asserted-by":"publisher","first-page":"107709","DOI":"10.1016\/j.knosys.2021.107709","volume":"237","author":"H Nguyen","year":"2022","unstructured":"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","journal-title":"Knowl Based Syst"},{"key":"8247_CR42","unstructured":"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."},{"key":"8247_CR43","doi-asserted-by":"crossref","unstructured":"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, August.","DOI":"10.1145\/956755.956779"},{"issue":"10","key":"8247_CR44","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"},{"key":"8247_CR45","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, Washington, DC, USA, August.","DOI":"10.1145\/956750.956788"},{"issue":"1","key":"8247_CR46","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s10115-014-0732-4","volume":"43","author":"J Sahoo","year":"2015","unstructured":"Sahoo J, Das AK, Goswami A (2015) An effective association rule mining scheme using a new generic basis. Knowl Inf Syst 43(1):127\u2013156","journal-title":"Knowl Inf Syst"},{"issue":"1","key":"8247_CR47","first-page":"199","volume":"33","author":"B Vo","year":"2017","unstructured":"Vo B (2017) An efficient method for mining frequent weighted closed itemsets from weighted item transaction databases. J Inf Sci Eng 33(1):199\u2013216","journal-title":"J Inf Sci Eng"},{"key":"8247_CR48","doi-asserted-by":"publisher","first-page":"1439","DOI":"10.1007\/s10489-020-01899-7","volume":"51","author":"H Bui","year":"2020","unstructured":"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\u20131459","journal-title":"Appl Intell"},{"key":"8247_CR49","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1016\/j.asoc.2016.01.010","volume":"41","author":"Z Deng","year":"2016","unstructured":"Deng Z (2016) Diffnodesets: an efficient structure for fast mining frequent itemsets. Appl Soft Comput 41:214\u2013223","journal-title":"Appl Soft Comput"},{"issue":"3","key":"8247_CR50","doi-asserted-by":"publisher","first-page":"726","DOI":"10.1109\/TKDE.2014.2345377","volume":"27","author":"VS Tseng","year":"2014","unstructured":"Tseng VS, Wu CW, Fournier-Viger P, Philip SY (2014) Efficient algorithms for mining the concise and lossless representation of high utility itemsets. IEEE Trans Knowl Data Eng 27(3):726\u2013739","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"8247_CR51","doi-asserted-by":"crossref","unstructured":"Wu CW, Fournier-Viger P, Gu JY, Tseng VS (2015) Mining closed+ high utility itemsets without candidate generation. In: 2015 Conference on Technologies and Applications of Artificial Intelligence (TAAI)","DOI":"10.1109\/TAAI.2015.7407089"},{"key":"8247_CR52","doi-asserted-by":"crossref","unstructured":"Fournier-Viger P, Zida S, 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","DOI":"10.1007\/978-3-319-41920-6_15"},{"issue":"2","key":"8247_CR53","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/s11704-016-6245-4","volume":"13","author":"TL Dam","year":"2019","unstructured":"Dam TL, Li K, Fournier-Viger P, Duong QH (2019) CLS-miner: efficient and effective closed high-utility itemset mining. Front Comput Sci 13(2):357\u2013381","journal-title":"Front Comput Sci"},{"key":"8247_CR54","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.ins.2019.05.006","volume":"495","author":"LTT Nguyen","year":"2019","unstructured":"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\u201399","journal-title":"Inf Sci"},{"key":"8247_CR55","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2022.109921","volume":"257","author":"H Duong","year":"2022","unstructured":"Duong H, Hoang T, Tran T, Truong T, Le B, Fournier-Viger P (2022) Efficient algorithms for mining closed and maximal high utility itemsets. Knowl Based Syst 257:109921","journal-title":"Knowl Based Syst"},{"key":"8247_CR56","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2024.124383","author":"TD Nguyen","year":"2024","unstructured":"Nguyen TD, Tung NT, Nguyen LT, Pham TT, Vo B (2024) MLC-miner: efficiently discovering multi-level closed high utility patterns from quantitative hierarchical transaction databases. Expert Syst Appl. https:\/\/doi.org\/10.1016\/j.eswa.2024.124383","journal-title":"Expert Syst Appl"},{"key":"8247_CR57","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.116220","volume":"191","author":"J Liu","year":"2022","unstructured":"Liu J, Ye Z, Yang X, Wang X, Shen L, Jiang X (2022) Efficient strategies for incremental mining of frequent closed itemsets over data streams. Expert Syst Appl 191:116220","journal-title":"Expert Syst Appl"},{"issue":"6","key":"8247_CR58","doi-asserted-by":"publisher","first-page":"2509","DOI":"10.1007\/s10115-023-01831-8","volume":"65","author":"M Li","year":"2023","unstructured":"Li M, Han M, Chen Z, Wu H, Zhang X (2023) FCHM-stream: fast closed high utility itemsets mining over data streams. Knowl Inf Syst 65(6):2509\u20132539","journal-title":"Knowl Inf Syst"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-026-08247-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-026-08247-5","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-026-08247-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T05:52:56Z","timestamp":1770270776000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-026-08247-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,5]]},"references-count":58,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2026,2]]}},"alternative-id":["8247"],"URL":"https:\/\/doi.org\/10.1007\/s11227-026-08247-5","relation":{},"ISSN":["1573-0484"],"issn-type":[{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,5]]},"assertion":[{"value":"13 June 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 January 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 February 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"129"}}