{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,22]],"date-time":"2026-05-22T05:04:43Z","timestamp":1779426283190,"version":"3.53.1"},"reference-count":38,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Sciences"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1016\/j.ins.2026.123488","type":"journal-article","created":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T23:07:48Z","timestamp":1775689668000},"page":"123488","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Fast and scalable sliding-window-based algorithms for mining frequent weighted utility patterns over dynamic quantitative data streams"],"prefix":"10.1016","volume":"748","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8746-6070","authenticated-orcid":false,"given":"Nguyen","family":"Le","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ham","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-9404-9420","authenticated-orcid":false,"given":"Minh","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4838-1538","authenticated-orcid":false,"given":"Huong","family":"Bui","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2723-1138","authenticated-orcid":false,"given":"Bay","family":"Vo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Unil","family":"Yun","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.ins.2026.123488_b0005","series-title":"Presented at the ACM sigmod record","first-page":"207","article-title":"Mining association rules between sets of items in large databases","author":"Agrawal","year":"1993"},{"key":"10.1016\/j.ins.2026.123488_b0010","doi-asserted-by":"crossref","unstructured":"P. Fournier-Viger, J. Chun-Wei Lin, T. Truong-Chi, R. Nkambou, A survey of high utility itemset mining, in High-Utility Pattern Mining, vol. 51, P. Fournier-Viger, J.C.-W. Lin, R. Nkambou, B. Vo, V.S. Tseng, Eds., in Studies in Big Data, vol. 51. , Cham: Springer International Publishing, 2019, pp. 1\u201345. doi: 10.1007\/978-3-030-04921-8_1.","DOI":"10.1007\/978-3-030-04921-8_1"},{"key":"10.1016\/j.ins.2026.123488_b0015","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2023.111060","article-title":"Efficient approach for mining high-utility patterns on incremental databases with dynamic profits","volume":"282","author":"Kim","year":"2023","journal-title":"Knowl.-Based Syst."},{"key":"10.1016\/j.ins.2026.123488_b0020","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2022.109702","article-title":"Efficient approach of sliding window-based high average-utility pattern mining with list structures","volume":"256","author":"Lee","year":"2022","journal-title":"Knowl.-Based Syst."},{"issue":"1","key":"10.1016\/j.ins.2026.123488_b0025","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/s10618-020-00715-7","article-title":"Recency-based sequential pattern mining in multiple event sequences","volume":"35","author":"Kim","year":"2021","journal-title":"Data Min. Knowl. Disc."},{"issue":"1","key":"10.1016\/j.ins.2026.123488_b0030","doi-asserted-by":"crossref","first-page":"17","DOI":"10.15625\/1813-9663\/31\/1\/5154","article-title":"MBiS: an efficient method for mining frequent weighted utility itemsets from quantitative databases","volume":"31","author":"Ham","year":"2015","journal-title":"J. Comput. Sci. Cybern."},{"key":"10.1016\/j.ins.2026.123488_b0035","doi-asserted-by":"crossref","unstructured":"H. Bui, B. Vo, H. Nguyen, WUN-miner: a new method for mining frequent weighted utility itemsets, Presented at the 2016 IEEE International Conference on Systems, Man, and Cybernetics (SMC), IEEE, 2016, pp. 001365\u2013001370.","DOI":"10.1109\/SMC.2016.7844428"},{"issue":"1","key":"10.1016\/j.ins.2026.123488_b0040","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/s10489-022-03580-7","article-title":"A new approach for efficiently mining frequent weighted utility patterns","volume":"53","author":"Nguyen","year":"2023","journal-title":"Appl. Intell."},{"issue":"16","key":"10.1016\/j.ins.2026.123488_b0045","doi-asserted-by":"crossref","first-page":"19629","DOI":"10.1007\/s10489-023-04554-z","article-title":"Mining frequent weighted utility patterns with dynamic weighted items from quantitative databases","volume":"53","author":"Nguyen","year":"2023","journal-title":"Appl. Intell."},{"issue":"22","key":"10.1016\/j.ins.2026.123488_b0050","doi-asserted-by":"crossref","first-page":"27072","DOI":"10.1007\/s10489-023-04925-6","article-title":"High utility pattern mining algorithm over data streams using ext-list","volume":"53","author":"Han","year":"2023","journal-title":"Appl. Intell."},{"issue":"6","key":"10.1016\/j.ins.2026.123488_b0055","doi-asserted-by":"crossref","first-page":"2509","DOI":"10.1007\/s10115-023-01831-8","article-title":"FCHM-stream: fast closed high utility itemsets mining over data streams","volume":"65","author":"Li","year":"2023","journal-title":"Knowl. Inf. Syst."},{"issue":"9","key":"10.1016\/j.ins.2026.123488_b0060","doi-asserted-by":"crossref","first-page":"7239","DOI":"10.1109\/TIE.2017.2682782","article-title":"Efficient high utility pattern mining for establishing manufacturing plans with sliding window control","volume":"64","author":"Yun","year":"2017","journal-title":"IEEE Trans. Ind. Electron."},{"key":"10.1016\/j.ins.2026.123488_b0065","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/j.ins.2019.04.050","article-title":"Advanced approach of sliding window based erasable pattern mining with list structure of industrial fields","volume":"494","author":"Yun","year":"2019","journal-title":"Inf. Sci."},{"key":"10.1016\/j.ins.2026.123488_b0070","series-title":"Presented at the Pacific-Asia Conference on Knowledge Discovery and Data Mining","first-page":"689","article-title":"A two-phase algorithm for fast discovery of high utility itemsets","author":"Liu","year":"2005"},{"key":"10.1016\/j.ins.2026.123488_b0075","series-title":"Presented at the Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","first-page":"253","article-title":"UP-Growth: an efficient algorithm for high utility itemset mining","author":"Tseng","year":"2010"},{"issue":"8","key":"10.1016\/j.ins.2026.123488_b0080","doi-asserted-by":"crossref","first-page":"1772","DOI":"10.1109\/TKDE.2012.59","article-title":"Efficient algorithms for mining high utility itemsets from transactional databases","volume":"25","author":"Tseng","year":"2012","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/j.ins.2026.123488_b0085","series-title":"Presented at the Proceedings of the 21st ACM International Conference on Information and Knowledge Management","first-page":"55","article-title":"Mining high utility itemsets without candidate generation","author":"Liu","year":"2012"},{"key":"10.1016\/j.ins.2026.123488_b0090","doi-asserted-by":"crossref","unstructured":"P. Fournier-Viger, C.-W. Wu, S. Zida, V.S. Tseng, FHM: Faster high-utility itemset mining using estimated utility co-occurrence pruning, in Foundations of Intelligent Systems, vol. 8502, T. Andreasen, H. Christiansen, J.-C. Cubero, Z.W. Ra\u015b, Eds., in Lecture Notes in Computer Science, vol. 8502. , Cham: Springer International Publishing, 2014, pp. 83\u201392. doi: 10.1007\/978-3-319-08326-1_9.","DOI":"10.1007\/978-3-319-08326-1_9"},{"issue":"2","key":"10.1016\/j.ins.2026.123488_b0095","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1007\/s10115-016-0986-0","article-title":"EFIM: a fast and memory efficient algorithm for high-utility itemset mining","volume":"51","author":"Zida","year":"2017","journal-title":"Knowl. Inf. Syst."},{"key":"10.1016\/j.ins.2026.123488_b0100","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1016\/j.eswa.2017.08.028","article-title":"HMiner: efficiently mining high utility itemsets","volume":"90","author":"Krishnamoorthy","year":"2017","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.ins.2026.123488_b0105","doi-asserted-by":"crossref","unstructured":"J.-F. Qu, M. Liu, P. Fournier-Viger, Efficient algorithms for high utility itemset mining without candidate generation, in High-Utility Pattern Mining, vol. 51, P. Fournier-Viger, J.C.-W. Lin, R. Nkambou, B. Vo, V.S. Tseng, Eds., in Studies in Big Data, vol. 51. , Cham: Springer International Publishing, 2019, pp. 131\u2013160. doi: 10.1007\/978-3-030-04921-8_5.","DOI":"10.1007\/978-3-030-04921-8_5"},{"key":"10.1016\/j.ins.2026.123488_b0110","doi-asserted-by":"crossref","DOI":"10.1016\/j.ins.2024.121218","article-title":"Efficient high utility itemset mining without the join operation","volume":"681","author":"Yan","year":"2024","journal-title":"Inf. Sci."},{"key":"10.1016\/j.ins.2026.123488_b0115","doi-asserted-by":"crossref","unstructured":"T. Truong-Chi, P. Fournier-Viger, A survey of high utility sequential pattern mining, in High-Utility Pattern Mining, vol. 51, P. Fournier-Viger, J.C.-W. Lin, R. Nkambou, B. Vo, V.S. Tseng, Eds., in Studies in Big Data, vol. 51. , Cham: Springer International Publishing, 2019, pp. 97\u2013129. doi: 10.1007\/978-3-030-04921-8_4.","DOI":"10.1007\/978-3-030-04921-8_4"},{"key":"10.1016\/j.ins.2026.123488_b0120","doi-asserted-by":"crossref","DOI":"10.1016\/j.engappai.2022.105355","article-title":"Effective algorithms to mine skyline frequent-utility itemsets","volume":"116","author":"Liu","year":"2022","journal-title":"Eng. Appl. Artif. Intel."},{"key":"10.1016\/j.ins.2026.123488_b0125","series-title":"Presented at the 2008 Second UKSIM European Symposium on Computer Modeling and simulation","first-page":"87","article-title":"A weighted utility framework for mining association rules","author":"Khan","year":"2008"},{"key":"10.1016\/j.ins.2026.123488_b0130","series-title":"Presented at the International Conference on Computational Collective Intelligence","first-page":"114","article-title":"A tree-based approach for mining frequent weighted utility itemsets","author":"Vo","year":"2012"},{"issue":"3","key":"10.1016\/j.ins.2026.123488_b0135","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1080\/01969722.2016.1276774","article-title":"Text clustering using frequent weighted utility itemsets","volume":"48","author":"Tran","year":"2017","journal-title":"Cybern. Syst."},{"key":"10.1016\/j.ins.2026.123488_b0140","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2021.107709","article-title":"Mining frequent weighted utility itemsets in hierarchical quantitative databases","volume":"237","author":"Nguyen","year":"2022","journal-title":"Knowl.-Based Syst."},{"issue":"9","key":"10.1016\/j.ins.2026.123488_b0145","doi-asserted-by":"crossref","first-page":"2008","DOI":"10.1007\/s11432-012-4638-z","article-title":"A new algorithm for fast mining frequent itemsets using N-lists","volume":"55","author":"Deng","year":"2012","journal-title":"Science China Inf. Sci."},{"key":"10.1016\/j.ins.2026.123488_b0150","doi-asserted-by":"crossref","unstructured":"D. Trabold, T. Horv\u00e1th, Mining strongly closed itemsets from data streams, in Discovery Science, vol. 10558, A. Yamamoto, T. Kida, T. Uno, T. Kuboyama, Eds., in Lecture Notes in Computer Science, vol. 10558. , Cham: Springer International Publishing, 2017, pp. 251\u2013266. doi: 10.1007\/978-3-319-67786-6_18.","DOI":"10.1007\/978-3-319-67786-6_18"},{"issue":"6","key":"10.1016\/j.ins.2026.123488_b0155","doi-asserted-by":"crossref","first-page":"799","DOI":"10.1007\/s10994-016-5617-1","article-title":"Memory-adaptive high utility sequential pattern mining over data streams","volume":"106","author":"Zihayat","year":"2017","journal-title":"Mach. Learn."},{"key":"10.1016\/j.ins.2026.123488_b0160","doi-asserted-by":"crossref","DOI":"10.1016\/j.engappai.2020.103735","article-title":"Erasable pattern mining based on tree structures with damped window over data streams","volume":"94","author":"Baek","year":"2020","journal-title":"Eng. Appl. Artif. Intel."},{"key":"10.1016\/j.ins.2026.123488_b0165","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ins.2020.03.030","article-title":"Efficient approach of recent high utility stream pattern mining with indexed list structure and pruning strategy considering arrival times of transactions","volume":"529","author":"Nam","year":"2020","journal-title":"Inf. Sci."},{"issue":"2","key":"10.1016\/j.ins.2026.123488_b0170","doi-asserted-by":"crossref","first-page":"1466","DOI":"10.1016\/j.eswa.2007.11.061","article-title":"Mining frequent itemsets over data streams using efficient window sliding techniques","volume":"36","author":"Li","year":"2009","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.ins.2026.123488_b0175","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/j.is.2012.01.005","article-title":"Mining frequent itemsets in a stream","volume":"39","author":"Calders","year":"2014","journal-title":"Inf. Syst."},{"issue":"10","key":"10.1016\/j.ins.2026.123488_b0180","doi-asserted-by":"crossref","first-page":"7619","DOI":"10.1007\/s11227-020-03190-5","article-title":"SWEclat: a frequent itemset mining algorithm over streaming data using Spark Streaming","volume":"76","author":"Xiao","year":"2020","journal-title":"J. Supercomput."},{"issue":"1","key":"10.1016\/j.ins.2026.123488_b0185","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/s10115-022-01763-9","article-title":"An efficient algorithm for mining closed high utility itemsets over data streams with one dataset scan","volume":"65","author":"Han","year":"2023","journal-title":"Knowl. Inf. Syst."},{"issue":"3","key":"10.1016\/j.ins.2026.123488_b0190","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1109\/69.846291","article-title":"Scalable algorithms for association mining","volume":"12","author":"Zaki","year":"2000","journal-title":"IEEE Trans. Knowl. Data Eng."}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025526004196?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025526004196?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,22]],"date-time":"2026-05-22T04:04:37Z","timestamp":1779422677000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020025526004196"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":38,"alternative-id":["S0020025526004196"],"URL":"https:\/\/doi.org\/10.1016\/j.ins.2026.123488","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Fast and scalable sliding-window-based algorithms for mining frequent weighted utility patterns over dynamic quantitative data streams","name":"articletitle","label":"Article Title"},{"value":"Information Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ins.2026.123488","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Inc. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"123488"}}