{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T04:15:10Z","timestamp":1776658510235,"version":"3.51.2"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,9,24]],"date-time":"2022-09-24T00:00:00Z","timestamp":1663977600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,9,24]],"date-time":"2022-09-24T00:00:00Z","timestamp":1663977600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62062004"],"award-info":[{"award-number":["62062004"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004772","name":"Natural Science Foundation of Ningxia Province","doi-asserted-by":"publisher","award":["2020AAC03216"],"award-info":[{"award-number":["2020AAC03216"]}],"id":[{"id":"10.13039\/501100004772","id-type":"DOI","asserted-by":"publisher"}]},{"name":"North Minzu University Innovation Project Fund","award":["YCX20077"],"award-info":[{"award-number":["YCX20077"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2023,1]]},"DOI":"10.1007\/s10115-022-01763-9","type":"journal-article","created":{"date-parts":[[2022,9,24]],"date-time":"2022-09-24T20:38:35Z","timestamp":1664051915000},"page":"207-240","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["An efficient algorithm for mining closed high utility itemsets over data streams with one dataset scan"],"prefix":"10.1007","volume":"65","author":[{"given":"Meng","family":"Han","sequence":"first","affiliation":[]},{"given":"Haodong","family":"Cheng","sequence":"additional","affiliation":[]},{"given":"Ni","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Xiaojuan","family":"Li","sequence":"additional","affiliation":[]},{"given":"Le","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,9,24]]},"reference":[{"key":"1763_CR1","doi-asserted-by":"crossref","unstructured":"Liu Y, Liao W-K, Choudhary A (2005) A fast high utility itemsets mining algorithm. In: Proceedings of the 1st international workshop on utility-based data mining, pp 90\u201399. Association for Computing Machinery, New York, NY, USA. https:\/\/doi.org\/10.1145\/1089827.1089839","DOI":"10.1145\/1089827.1089839"},{"key":"1763_CR2","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules. In: Proceedings of the 20th international conference on very large data bases, VLDB, vol 1215, pp 487\u2013499. Morgan Kaufmann, San Francisco, CA. Citeseer"},{"issue":"8","key":"1763_CR3","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-E, Wu C-W, Philip SY (2012) Efficient algorithms for mining high utility itemsets from transactional databases. IEEE Trans Knowl Data Eng 25(8):1772\u20131786. https:\/\/doi.org\/10.1109\/TKDE.2012.59","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1763_CR4","doi-asserted-by":"crossref","unstructured":"Dawar S, Goyal V (2015) Up-hist tree: an efficient data structure for mining high utility patterns from transaction databases. In: Proceedings of the 19th international database engineering and applications symposium, pp 56\u201361. Association for Computing Machinery, New York, NY, USA. https:\/\/doi.org\/10.1145\/2790755.2790771","DOI":"10.1145\/2790755.2790771"},{"key":"1763_CR5","doi-asserted-by":"crossref","unstructured":"Tseng VS, Wu C-W, Shie B-E, 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, pp 253\u2013262. Association for Computing Machinery, New York, NY, USA (2010). https:\/\/doi.org\/10.1145\/1835804.1835839","DOI":"10.1145\/1835804.1835839"},{"issue":"8","key":"1763_CR6","doi-asserted-by":"publisher","first-page":"3861","DOI":"10.1016\/j.eswa.2013.11.038","volume":"41","author":"U Yun","year":"2014","unstructured":"Yun U, Ryang H, Ryu KH (2014) High utility itemset mining with techniques for reducing overestimated utilities and pruning candidates. Expert Syst Appl 41(8):3861\u20133878. https:\/\/doi.org\/10.1016\/j.eswa.2013.11.038","journal-title":"Expert Syst Appl"},{"key":"1763_CR7","doi-asserted-by":"crossref","unstructured":"Liu J, Wang K, Fung BC (2012) Direct discovery of high utility itemsets without candidate generation. In: 2012 IEEE 12th international conference on data mining, Brussels, Belgium, pp 984\u2013989 (2012). https:\/\/doi.org\/10.1109\/ICDM.2012.20. IEEE","DOI":"10.1109\/ICDM.2012.20"},{"key":"1763_CR8","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, pp 55\u201364. Association for Momputing Machinery, New York, NY, USA (2012). https:\/\/doi.org\/10.1145\/2396761.2396773","DOI":"10.1145\/2396761.2396773"},{"key":"1763_CR9","doi-asserted-by":"crossref","unstructured":"Fournier-Viger P, Wu C-W, Zida S, Tseng VS (2014) Fhm: faster high-utility itemset mining using estimated utility co-occurrence pruning. In: International Symposium on Methodologies for Intelligent Systems, Berlin, pp 83\u201392. Springer. https:\/\/doi.org\/10.1007\/978-3-319-08326-1_9","DOI":"10.1007\/978-3-319-08326-1_9"},{"issue":"5","key":"1763_CR10","doi-asserted-by":"publisher","first-page":"2371","DOI":"10.1016\/j.eswa.2014.11.001","volume":"42","author":"S Krishnamoorthy","year":"2015","unstructured":"Krishnamoorthy S (2015) Pruning strategies for mining high utility itemsets. Expert Syst Appl 42(5):2371\u20132381. https:\/\/doi.org\/10.1016\/j.eswa.2014.11.001","journal-title":"Expert Syst Appl"},{"issue":"13","key":"1763_CR11","doi-asserted-by":"publisher","first-page":"5754","DOI":"10.1016\/j.eswa.2015.02.051","volume":"42","author":"J Sahoo","year":"2015","unstructured":"Sahoo J, Das AK, Goswami A (2015) An efficient approach for mining association rules from high utility itemsets. Expert Syst Appl 42(13):5754\u20135778. https:\/\/doi.org\/10.1016\/j.eswa.2015.02.051","journal-title":"Expert Syst Appl"},{"issue":"5","key":"1763_CR12","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1109\/TKDE.2015.2510012","volume":"28","author":"J Liu","year":"2015","unstructured":"Liu J, Wang K, Fung BC (2015) Mining high utility patterns in one phase without generating candidates. IEEE Trans Knowl Data Eng 28(5):1245\u20131257. https:\/\/doi.org\/10.1109\/TKDE.2015.2510012","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"2","key":"1763_CR13","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 JC-W, Wu C-W, Tseng VS (2017) Efim: a fast and memory efficient algorithm for high-utility itemset mining. Knowl Inf Syst 51(2):595\u2013625. https:\/\/doi.org\/10.1007\/s10115-016-0986-0","journal-title":"Knowl Inf Syst"},{"issue":"2","key":"1763_CR14","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s10115-018-1207-9","volume":"59","author":"BP Jaysawal","year":"2019","unstructured":"Jaysawal BP, Huang J-W (2019) Dmhups: discovering multiple high utility patterns simultaneously. Knowl Inf Syst 59(2):337\u2013359. https:\/\/doi.org\/10.1007\/s10115-018-1207-9","journal-title":"Knowl Inf Syst"},{"issue":"4","key":"1763_CR15","doi-asserted-by":"publisher","first-page":"1240","DOI":"10.1016\/j.ins.2014.01.045","volume":"47","author":"S Dawar","year":"2017","unstructured":"Dawar S, Sharma V, Goyal V (2017) Mining top-k high-utility itemsets from a data stream under sliding window model. Appl Intell 47(4):1240\u20131255. https:\/\/doi.org\/10.1016\/j.ins.2014.01.045","journal-title":"Appl Intell"},{"issue":"15","key":"1763_CR16","doi-asserted-by":"publisher","first-page":"11979","DOI":"10.1016\/j.eswa.2012.03.062","volume":"39","author":"CF Ahmed","year":"2012","unstructured":"Ahmed CF, Tanbeer SK, Jeong B-S, Choi H-J (2012) Interactive mining of high utility patterns over data streams. Expert Syst Appl 39(15):11979\u201311991","journal-title":"Expert Syst Appl"},{"issue":"9","key":"1763_CR17","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1016\/j.eswa.2016.03.001","volume":"57","author":"H Ryang","year":"2016","unstructured":"Ryang H, Yun U (2016) High utility pattern mining over data streams with sliding window technique. Expert Syst Appl 57(9):214\u2013231","journal-title":"Expert Syst Appl"},{"key":"1763_CR18","doi-asserted-by":"crossref","unstructured":"Jaysawal BP, Huang J-W (2020) Sohupds: a single-pass one-phase algorithm for mining high utility patterns over a data stream. In: Proceedings of the 35th annual ACM symposium on applied computing, pp 490\u2013497. Association for Computing Machinery, New York, NY, USA","DOI":"10.1145\/3341105.3373928"},{"issue":"3","key":"1763_CR19","doi-asserted-by":"publisher","first-page":"726","DOI":"10.1109\/TKDE.2014.2345377","volume":"27","author":"VS Tseng","year":"2014","unstructured":"Tseng VS, Wu C-W, 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. https:\/\/doi.org\/10.1109\/TKDE.2014.2345377","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1763_CR20","doi-asserted-by":"crossref","unstructured":"Wu C-W, Fournier-Viger P, Gu J-Y, Tseng VS (2015) Mining closed+ high utility itemsets without candidate generation. In: 2015 Conference on technologies and applications of artificial intelligence (TAAI), Tainan, Taiwan, pp 187\u2013194. IEEE","DOI":"10.1109\/TAAI.2015.7407089"},{"key":"1763_CR21","doi-asserted-by":"crossref","unstructured":"Fournier-Viger P, Zida S, Lin JC-W, Wu C-W, 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, pp 199\u2013213. Springer. https:\/\/doi.org\/10.1007\/978-3-319-41920-6_15","DOI":"10.1007\/978-3-319-41920-6_15"},{"issue":"2","key":"1763_CR22","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/s11704-016-6245-4","volume":"13","author":"T-L Dam","year":"2019","unstructured":"Dam T-L, Li K, Fournier-Viger P, Duong Q-H (2019) Cls-miner: efficient and effective closed high-utility itemset mining. Front Comput Sci 13(2):357\u2013381. https:\/\/doi.org\/10.1007\/s11704-016-6245-4","journal-title":"Front Comput Sci"},{"key":"1763_CR23","doi-asserted-by":"crossref","unstructured":"Pramanik S, Goswami A (2021) Discovery of closed high utility itemsets using a fast nature-inspired ant colony algorithm. Appl Intell 1\u201317","DOI":"10.1007\/s10489-021-02922-1"},{"issue":"6","key":"1763_CR24","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107422","volume":"108","author":"JC-W Lin","year":"2021","unstructured":"Lin JC-W, Djenouri Y, Srivastava G, Yun U, Fournier-Viger P (2021) A predictive ga-based model for closed high-utility itemset mining. Appl Soft Comput 108(6):107422","journal-title":"Appl Soft Comput"},{"key":"1763_CR25","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.knosys.2018.11.019","volume":"165","author":"T-L Dam","year":"2019","unstructured":"Dam T-L, Ramampiaro H, N\u00f8rv\u00e5g K, Duong Q-H (2019) Towards efficiently mining closed high utility itemsets from incremental databases. Knowl Based Syst 165:13\u201329. https:\/\/doi.org\/10.1016\/j.knosys.2018.11.019","journal-title":"Knowl Based Syst"},{"issue":"11","key":"1763_CR26","doi-asserted-by":"publisher","first-page":"2500","DOI":"10.7544\/issn1000-1239.2021.20200554","volume":"58","author":"H Cheng","year":"2021","unstructured":"Cheng H, Han M, Zhang N, Li X, Wang L (2021) Closed high utility itemsets mining over data stream based on sliding window model. J Comput Res Dev 58(11):2500. https:\/\/doi.org\/10.7544\/issn1000-1239.2021.20200554","journal-title":"J Comput Res Dev"},{"issue":"1","key":"1763_CR27","doi-asserted-by":"publisher","first-page":"6","DOI":"10.2174\/2213275912666190204134822","volume":"14","author":"K Singh","year":"2021","unstructured":"Singh K, Singh SS, Luhach AK, Kumar A, Biswas B (2021) Mining of closed high utility itemsets: a survey. Recent Adv Comput Sci Commun 14(1):6\u201312","journal-title":"Recent Adv Comput Sci Commun"},{"issue":"6","key":"1763_CR28","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.inffus.2021.05.011","volume":"76","author":"JC-W Lin","year":"2021","unstructured":"Lin JC-W, Djenouri Y, Srivastava G (2021) Efficient closed high-utility pattern fusion model in large-scale databases. Inf Fusion 76(6):122\u2013132","journal-title":"Inf Fusion"},{"key":"1763_CR29","doi-asserted-by":"crossref","unstructured":"Lin JC-W, Djenouri Y, Srivastava G, Fourier-Viger P (2022) Efficient evolutionary computation model of closed high-utility itemset mining. Appl Intell 1\u201313","DOI":"10.1007\/s10489-021-03134-3"},{"issue":"2","key":"1763_CR30","doi-asserted-by":"publisher","first-page":"1466","DOI":"10.1016\/j.eswa.2007.11.061","volume":"36","author":"H-F Li","year":"2009","unstructured":"Li H-F, Lee S-Y (2009) Mining frequent itemsets over data streams using efficient window sliding techniques. Expert Syst Appl 36(2):1466\u20131477. https:\/\/doi.org\/10.1016\/j.eswa.2007.11.061","journal-title":"Expert Syst Appl"},{"issue":"12","key":"1763_CR31","doi-asserted-by":"publisher","first-page":"2834","DOI":"10.7544\/issn1000-1239.2015.20131883","volume":"52","author":"H Meng","year":"2015","unstructured":"Meng H, Zhihai W, Jidong Y (2015) A method to set decay factor based on gaussian function. J Comput Res Dev 52(12):2834\u20132843. https:\/\/doi.org\/10.7544\/issn1000-1239.2015.20131883","journal-title":"J Comput Res Dev"},{"key":"1763_CR32","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.ins.2012.05.007","volume":"215","author":"H Chen","year":"2012","unstructured":"Chen H, Shu L, Xia J, Deng Q (2012) Mining frequent patterns in a varying-size sliding window of online transactional data streams. Inf Sci 215:15\u201336. https:\/\/doi.org\/10.1016\/j.ins.2012.05.007","journal-title":"Inf Sci"},{"issue":"10","key":"1763_CR33","doi-asserted-by":"publisher","first-page":"6968","DOI":"10.1016\/j.eswa.2010.03.023","volume":"37","author":"PS Tsai","year":"2010","unstructured":"Tsai PS (2010) Mining top-k frequent closed itemsets over data streams using the sliding window model. Expert Syst Appl 37(10):6968\u20136973. https:\/\/doi.org\/10.1016\/j.eswa.2010.03.023","journal-title":"Expert Syst Appl"},{"key":"1763_CR34","doi-asserted-by":"crossref","unstructured":"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, Berlin, Heidelberg, pp 689\u2013695. Springer. https:\/\/doi.org\/10.1007\/11430919_79","DOI":"10.1007\/11430919_79"},{"key":"1763_CR35","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/j.ins.2014.01.045","volume":"285","author":"M Zihayat","year":"2014","unstructured":"Zihayat M, An A (2014) Mining top-k high utility patterns over data streams. Inf Sci 285:138\u2013161. https:\/\/doi.org\/10.1016\/j.ins.2014.01.045","journal-title":"Inf Sci"},{"issue":"1","key":"1763_CR36","doi-asserted-by":"publisher","first-page":"103","DOI":"10.3233\/IDA-170874","volume":"21","author":"M Zihayat","year":"2017","unstructured":"Zihayat M, Wu C-W, An A, Tseng VS, Lin C (2017) Efficiently mining high utility sequential patterns in static and streaming data. Intell Data Anal 21(1):103\u2013135. https:\/\/doi.org\/10.3233\/IDA-170874","journal-title":"Intell Data Anal"},{"issue":"1","key":"1763_CR37","doi-asserted-by":"publisher","first-page":"342","DOI":"10.2991\/ijcis.2019.125905650","volume":"12","author":"H Tang","year":"2018","unstructured":"Tang H, Liu Y, Wang L (2018) A new algorithm of mining high utility sequential pattern in streaming data. Int J Comput Intell Syst 12(1):342","journal-title":"Int J Comput Intell Syst"},{"key":"1763_CR38","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2020.106653","volume":"213","author":"H Kim","year":"2021","unstructured":"Kim H, Yun U, Baek Y, Kim H, Nam H, Lin JC-W, Fournier-Viger P (2021) Damped sliding based utility oriented pattern mining over stream data. Knowl Based Syst 213:106653","journal-title":"Knowl Based Syst"},{"issue":"9","key":"1763_CR39","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2020.103735","volume":"94","author":"Y Baek","year":"2020","unstructured":"Baek Y, Yun U, Kim H, Nam H, Lee G, Yoon E, Vo B, Lin JC-W (2020) Erasable pattern mining based on tree structures with damped window over data streams. Eng Appl Artif Intell 94(9):103735","journal-title":"Eng Appl Artif Intell"},{"issue":"11","key":"1763_CR40","doi-asserted-by":"publisher","first-page":"1699","DOI":"10.1002\/int.22269","volume":"35","author":"Y Baek","year":"2020","unstructured":"Baek Y, Yun U, Lin JC-W, Yoon E, Fujita H (2020) Efficiently mining erasable stream patterns for intelligent systems over uncertain data. Int J Intell Syst 35(11):1699\u20131734","journal-title":"Int J Intell Syst"},{"issue":"2","key":"1763_CR41","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3430767","volume":"12","author":"Y Baek","year":"2021","unstructured":"Baek Y, Yun U, Kim H, Nam H, Kim H, Lin JC-W, Vo B, Pedrycz W (2021) Rhups: mining recent high utility patterns with sliding window-based arrival time control over data streams. ACM Trans Intell Syst Technol (TIST) 12(2):1\u201327","journal-title":"ACM Trans Intell Syst Technol (TIST)"},{"key":"1763_CR42","doi-asserted-by":"publisher","DOI":"10.3233\/JIFS-210610","author":"H Cheng","year":"2021","unstructured":"Cheng H, Han M, Zhang N, Wang L, Li X (2021) Etkds: an efficient algorithm of top-k high utility itemsets mining over data streams under sliding window model. J Intell Fuzzy Syst. https:\/\/doi.org\/10.3233\/JIFS-210610","journal-title":"J Intell Fuzzy Syst"},{"issue":"1","key":"1763_CR43","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/TKDE.2006.10","volume":"18","author":"C Lucchese","year":"2005","unstructured":"Lucchese C, Orlando S, Perego R (2005) Fast and memory efficient mining of frequent closed itemsets. IEEE Trans Knowl Data Eng 18(1):21\u201336. https:\/\/doi.org\/10.1109\/TKDE.2006.10","journal-title":"IEEE Trans Knowl Data Eng"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-022-01763-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10115-022-01763-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-022-01763-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,17]],"date-time":"2023-01-17T02:04:38Z","timestamp":1673921078000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10115-022-01763-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,24]]},"references-count":43,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,1]]}},"alternative-id":["1763"],"URL":"https:\/\/doi.org\/10.1007\/s10115-022-01763-9","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9,24]]},"assertion":[{"value":"22 December 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 September 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 September 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 September 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}