{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T13:40:38Z","timestamp":1780494038656,"version":"3.54.1"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2025,7,15]],"date-time":"2025-07-15T00:00:00Z","timestamp":1752537600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,7,15]],"date-time":"2025-07-15T00:00:00Z","timestamp":1752537600000},"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":["Appl Intell"],"published-print":{"date-parts":[[2025,8]]},"DOI":"10.1007\/s10489-025-06729-2","type":"journal-article","created":{"date-parts":[[2025,7,15]],"date-time":"2025-07-15T12:20:09Z","timestamp":1752582009000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Efficient high utility itemsets mining over data streams with compact utility list structure"],"prefix":"10.1007","volume":"55","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4877-5975","authenticated-orcid":false,"given":"Gufeng","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-5208-5716","authenticated-orcid":false,"given":"Jialong","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-6766-1654","authenticated-orcid":false,"given":"Weiyi","family":"Fang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-3904-3299","authenticated-orcid":false,"given":"Jiawei","family":"Xiang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tao","family":"Shang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,7,15]]},"reference":[{"key":"6729_CR1","first-page":"487","volume-title":"Proceedings 20th international conference","author":"R Agrawal","year":"1994","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules. Proceedings 20th international conference. Very Large Data Bases, VLDB, pp 487\u2013499"},{"issue":"12","key":"6729_CR2","doi-asserted-by":"publisher","first-page":"1708","DOI":"10.1109\/TKDE.2009.46","volume":"21","author":"CF Ahmed","year":"2009","unstructured":"Ahmed CF, Tanbeer SK, Jeong B et al (2009) Efficient tree structures for high utility pattern mining in incremental databases. IEEE Trans Knowl Data Eng 21(12):1708\u20131721","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"6729_CR3","doi-asserted-by":"crossref","unstructured":"Baek Y, Yun U, Kim H et al (2021) Rhups: Mining recent high utility patterns with sliding window\u2013based arrival time control over data streams. ACM Trans Intell Syst Technol (TIST) 12(2):1\u201327","DOI":"10.1145\/3430767"},{"key":"6729_CR4","doi-asserted-by":"crossref","unstructured":"Bouasker S, Ben\u00a0Yahia S (2015) Key correlation mining by simultaneous monotone and anti-monotone constraints checking. In: Proceedings of the 30th annual ACM symposium on applied computing, pp 851\u2013856","DOI":"10.1145\/2695664.2695802"},{"issue":"4","key":"6729_CR5","doi-asserted-by":"publisher","first-page":"521","DOI":"10.5762\/KAIS.2016.17.4.521","volume":"17","author":"JH Chang","year":"2016","unstructured":"Chang JH (2016) Finding high utility old itemsets in web-click streams. J Korea Academia-Industrial Cooperation Soc 17(4):521\u2013528","journal-title":"J Korea Academia-Industrial Cooperation Soc"},{"issue":"7","key":"6729_CR6","doi-asserted-by":"publisher","first-page":"1105","DOI":"10.1016\/j.jss.2007.07.026","volume":"81","author":"CJ Chu","year":"2008","unstructured":"Chu CJ, Tseng VS, Liang T (2008) An efficient algorithm for mining temporal high utility itemsets from data streams. J Syst Softw 81(7):1105\u20131117","journal-title":"J Syst Softw"},{"key":"6729_CR7","doi-asserted-by":"publisher","first-page":"1240","DOI":"10.1007\/s10489-017-0939-7","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:1240\u20131255","journal-title":"Appl Intell"},{"key":"6729_CR8","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/j.ins.2018.04.008","volume":"453","author":"Y Djenouri","year":"2018","unstructured":"Djenouri Y, Belhadi A, Fournier-Viger P et al (2018) Fast and effective cluster-based information retrieval using frequent closed itemsets. Inf Sci 453:154\u2013167","journal-title":"Inf Sci"},{"key":"6729_CR9","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 et al (2018) Efficient high utility itemset mining using buffered utility-lists. Appl Intell 48:1859\u20131877","journal-title":"Appl Intell"},{"key":"6729_CR10","doi-asserted-by":"crossref","unstructured":"Fournier-Viger P, Wu CW, Zida S et\u00a0al (2014) Fhm: Faster high-utility itemset mining using estimated utility co-occurrence pruning. In: Andreasen T, Christiansen H, Cubero JC et\u00a0al (eds) Foundations of intelligent systems. springer international publishing, pp 83\u201392","DOI":"10.1007\/978-3-319-08326-1_9"},{"key":"6729_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-030-04921-8","volume-title":"A survey of high utility itemset mining","author":"P Fournier-Viger","year":"2019","unstructured":"Fournier-Viger P, Chun-Wei Lin J, Truong-Chi T et al (2019) A survey of high utility itemset mining. Theory, algorithms and applications, High-utility pattern mining, pp 1\u201345"},{"key":"6729_CR12","doi-asserted-by":"crossref","unstructured":"Han J, Pei J, Yin Y (2000) Mining frequent patterns without candidate generation. ACM SIGMOD Record 29(2):1\u201312","DOI":"10.1145\/335191.335372"},{"key":"6729_CR13","volume-title":"Data mining: concepts and techniques","author":"J Han","year":"2011","unstructured":"Han J, Pei J, Kamber M (2011) Data mining: concepts and techniques. Elsevier"},{"issue":"22","key":"6729_CR14","doi-asserted-by":"publisher","first-page":"27072","DOI":"10.1007\/s10489-023-04925-6","volume":"53","author":"M Han","year":"2023","unstructured":"Han M, Li M, Chen Z et al (2023) High utility pattern mining algorithm over data streams using ext-list. Appl Intell 53(22):27072\u201327095","journal-title":"Appl Intell"},{"key":"6729_CR15","doi-asserted-by":"crossref","unstructured":"Jaysawal BP, Huang JW (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","DOI":"10.1145\/3341105.3373928"},{"key":"6729_CR16","doi-asserted-by":"crossref","unstructured":"Jaysawal BP, Huang JW (2024) Sohupds+: An efficient one-phase algorithm for mining high utility patterns over a data stream. ACM Trans Knowl Discov Data 19(1)","DOI":"10.1145\/3702645"},{"issue":"5","key":"6729_CR17","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","journal-title":"Expert Syst Appl"},{"key":"6729_CR18","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":"6729_CR19","doi-asserted-by":"crossref","unstructured":"Krishnamoorthy S (2024) Interpretable classifier models for decision support using high utility gain patterns. IEEE Access","DOI":"10.2139\/ssrn.4785680"},{"key":"6729_CR20","doi-asserted-by":"crossref","unstructured":"Li HF, Huang HY, Chen YC et\u00a0al (2008) Fast and memory efficient mining of high utility itemsets in data streams. In: 2008 eighth IEEE international conference on data mining. IEEE, pp 881\u2013886","DOI":"10.1109\/ICDM.2008.107"},{"issue":"2","key":"6729_CR21","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.aei.2016.02.003","volume":"30","author":"JCW Lin","year":"2016","unstructured":"Lin JCW, Gan W, Fournier-Viger P et al (2016) Fast algorithms for mining high-utility itemsets with various discount strategies. Adv Eng Inform 30(2):109\u2013126","journal-title":"Adv Eng Inform"},{"key":"6729_CR22","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","DOI":"10.1145\/2396761.2396773"},{"key":"6729_CR23","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1007\/11430919_79","volume-title":"Pacific-Asia conference on knowledge discovery and data mining","author":"Y Liu","year":"2005","unstructured":"Liu Y, Wk Liao, Choudhary A (2005) A two-phase algorithm for fast discovery of high utility itemsets. Pacific-Asia conference on knowledge discovery and data mining. Springer, Berlin Heidelberg, pp 689\u2013695"},{"key":"6729_CR24","doi-asserted-by":"crossref","unstructured":"Mittal R, Mondal A, Reddy PK et\u00a0al (2024) A model for retrieving high-utility itemsets with complementary and substitute goods. In: Pacific-Asia conference on knowledge discovery and data mining, Springer, pp 340\u2013352","DOI":"10.1007\/978-981-97-2242-6_27"},{"key":"6729_CR25","doi-asserted-by":"crossref","unstructured":"Padmavathi K, Saleti S, Tottempudi SS (2023) Analyzing the health data: An application of high utility itemset mining. In: 2023 International conference on advances in computation, communication and information technology (ICAICCIT), IEEE, pp 153\u2013158","DOI":"10.1109\/ICAICCIT60255.2023.10466177"},{"key":"6729_CR26","doi-asserted-by":"crossref","unstructured":"Peng AY, Koh YS, Riddle P (2017) mhuiminer: A fast high utility itemset mining algorithm for sparse datasets. In: Advances in knowledge discovery and data mining: 21st pacific-asia conference, PAKDD 2017, Jeju, South Korea, May 23-26, 2017, Proceedings, Part II 21. Springer, pp 196\u2013207","DOI":"10.1007\/978-3-319-57529-2_16"},{"key":"6729_CR27","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:214\u2013231","journal-title":"Expert Syst Appl"},{"key":"6729_CR28","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1016\/j.ins.2014.03.074","volume":"278","author":"SJ Shin","year":"2014","unstructured":"Shin SJ, Lee DS, Lee WSJIS (2014) Cp-tree: An adaptive synopsis structure for compressing frequent itemsets over online data streams. Inf Sci 278:559\u2013576","journal-title":"Inf Sci"},{"key":"6729_CR29","doi-asserted-by":"crossref","unstructured":"Szathmary L, Napoli A, Valtchev P (2007) Towards rare itemset mining. In: 19th IEEE International conference on tools with artificial intelligence (ICTAI 2007), vol\u00a01. IEEE, pp 305\u2013312","DOI":"10.1109\/ICTAI.2007.30"},{"key":"6729_CR30","doi-asserted-by":"crossref","unstructured":"Tseng VS, Wu CW, Shie BE et\u00a0al (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","DOI":"10.1145\/1835804.1835839"},{"issue":"8","key":"6729_CR31","doi-asserted-by":"publisher","first-page":"1772","DOI":"10.1109\/TKDE.2012.59","volume":"25","author":"VS Tseng","year":"2013","unstructured":"Tseng VS, Shie B, Wu C et al (2013) 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":"6729_CR32","unstructured":"Uno T, Kiyomi M, Arimura H (2004) Lcm ver. 2: Efficient mining algorithms for frequent\/closed\/maximal itemsets. In: Fimi"},{"key":"6729_CR33","unstructured":"Virk K (2021) Improving e-commerce recommendations using high utility sequential patterns of historical purchase and click stream data. Master\u2019s thesis, University of Windsor (Canada)"},{"key":"6729_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 et al (2022) Ubp-miner: An efficient bit based high utility itemset mining algorithm. Knowl-Based Syst 248:108865","journal-title":"Knowl-Based Syst"},{"key":"6729_CR35","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 et al (2024) Efficient high utility itemset mining without the join operation. Inf Sci 681:121218","journal-title":"Inf Sci"},{"key":"6729_CR36","doi-asserted-by":"crossref","unstructured":"Yen SJ, Lee YS, Wu CW et\u00a0al (2009) An efficient algorithm for maintaining frequent closed itemsets over data stream. In: International conference on industrial, engineering and other applications of applied intelligent systemsk. Springer, pp 767\u2013776","DOI":"10.1007\/978-3-642-02568-6_78"},{"key":"6729_CR37","doi-asserted-by":"crossref","unstructured":"Yue L (2024) E-commerce return data based on frequent itemset mining and time series symbolization clustering. J Comput Methods Sci Eng 14727978241309189","DOI":"10.1177\/14727978241309189"},{"issue":"9","key":"6729_CR38","doi-asserted-by":"publisher","first-page":"7239","DOI":"10.1109\/TIE.2017.2682782","volume":"64","author":"U Yun","year":"2017","unstructured":"Yun U, Lee G, Yoon E (2017) Efficient high utility pattern mining for establishing manufacturing plans with sliding window control. IEEE Trans Ind Electron 64(9):7239\u20137249","journal-title":"IEEE Trans Ind Electron"},{"key":"6729_CR39","doi-asserted-by":"crossref","unstructured":"Zida S, Fournier-Viger P, Lin JCW et\u00a0al (2015) Efim: a highly efficient algorithm for high-utility itemset mining. In: Mexican international conference on artificial intelligence. Springer, pp 530\u2013546","DOI":"10.1007\/978-3-319-27060-9_44"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-025-06729-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-025-06729-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-025-06729-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T15:57:08Z","timestamp":1758297428000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-025-06729-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,15]]},"references-count":39,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2025,8]]}},"alternative-id":["6729"],"URL":"https:\/\/doi.org\/10.1007\/s10489-025-06729-2","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,7,15]]},"assertion":[{"value":"15 June 2025","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 July 2025","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"872"}}