{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T00:35:19Z","timestamp":1770165319116,"version":"3.49.0"},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,1,4]],"date-time":"2026-01-04T00:00:00Z","timestamp":1767484800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2026,2,3]],"date-time":"2026-02-03T00:00:00Z","timestamp":1770076800000},"content-version":"vor","delay-in-days":30,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Big Data"],"DOI":"10.1186\/s40537-025-01352-x","type":"journal-article","created":{"date-parts":[[2026,1,4]],"date-time":"2026-01-04T06:47:04Z","timestamp":1767509224000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Intelligent average utility pattern analysis using pre-large concept in dynamic stream data"],"prefix":"10.1186","volume":"13","author":[{"given":"Doyoung","family":"Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seongbin","family":"Park","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junyoung","family":"Park","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hanju","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seungwan","family":"Park","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Myungha","family":"Cho","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Unil","family":"Yun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,1,4]]},"reference":[{"issue":"3","key":"1352_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3724125","volume":"16","author":"Z Hu","year":"2025","unstructured":"Hu Z, You J, Yang Z, Li X, Xie H, Li Q, et al. A multi-hop graph reasoning network for knowledge-based VQA. ACM Trans Intell Syst Technol. 2025;16(3):1\u201323. https:\/\/doi.org\/10.1145\/3724125.","journal-title":"ACM Trans Intell Syst Technol"},{"issue":"3","key":"1352_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3709002","volume":"16","author":"Y Liu","year":"2025","unstructured":"Liu Y, Yao Q, Li Y. Modeling n-ary relational knowledge bases with tensor decomposition. ACM Trans Intell Syst Technol. 2025;16(3):1\u201329. https:\/\/doi.org\/10.1145\/3709002.","journal-title":"ACM Trans Intell Syst Technol"},{"issue":"5","key":"1352_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3735512","volume":"16","author":"HR Xuan","year":"2025","unstructured":"Xuan HR, Li BH, Wu WL, Liu Y, Yin HZ. Knowledge enhancement and temporal aware for multi-behavior contrastive recommendation. ACM Trans Intell Syst Technol. 2025;16(5):1\u201323. https:\/\/doi.org\/10.1145\/3735512.","journal-title":"ACM Trans Intell Syst Technol"},{"issue":"2","key":"1352_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3712703","volume":"16","author":"TH Le","year":"2025","unstructured":"Le TH, Huang SC, Hoang QV, Lokaj Z, Lu ZH. Amalgamating knowledge for object detection in rainy weather conditions. ACM Trans Intell Syst Technol. 2025;16(2):1\u201320. https:\/\/doi.org\/10.1145\/3712703.","journal-title":"ACM Trans Intell Syst Technol"},{"key":"1352_CR5","doi-asserted-by":"publisher","DOI":"10.1145\/3735645","author":"Y Zhou","year":"2025","unstructured":"Zhou Y, Wang Z, Jiang Y, Ma B, Wang R, Liu Y, et al. AEKG4APT: an AI-enhanced knowledge graph for advanced persistent threats with large language model analysis. ACM Trans Intell Syst Technol. 2025. https:\/\/doi.org\/10.1145\/3735645.","journal-title":"ACM Trans Intell Syst Technol"},{"issue":"5","key":"1352_CR6","doi-asserted-by":"publisher","first-page":"2993","DOI":"10.1109\/TCYB.2021.3125196","volume":"53","author":"Z Zhang","year":"2023","unstructured":"Zhang Z, Huang J. Fast frequent patterns mining by multiple sampling with tight guarantee under bayesian statistics. IEEE Trans Cybern. 2023;53(5):2993\u20133006.","journal-title":"IEEE Trans Cybern"},{"issue":"6","key":"1352_CR7","doi-asserted-by":"publisher","first-page":"6106","DOI":"10.1007\/s10489-021-02520-1","volume":"52","author":"T Truong","year":"2022","unstructured":"Truong T, Duong H, Le B, Fournier-Viger P, Yun U. Frequent high minimum average utility sequence mining with constraints in dynamic databases using efficient pruning strategies. Appl Intell. 2022;52(6):6106\u201328.","journal-title":"Appl Intell"},{"issue":"6","key":"1352_CR8","doi-asserted-by":"publisher","first-page":"2372","DOI":"10.1109\/TKDE.2023.3321749","volume":"36","author":"Y Wu","year":"2024","unstructured":"Wu Y, Meng Y, Li Y, Guo L, Zhu X, Fournier-Viger P, et al. COPP-Miner: top-k contrast order-preserving pattern mining for time series classification. IEEE Trans Knowl Data Eng. 2024;36(6):2372\u201387.","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"10","key":"1352_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-024-4496-9","volume":"68","author":"Y Wu","year":"2025","unstructured":"Wu Y, Tian S, Li Y, Liu J, Li J, Wang W, et al. OIP-Miner: one-off incremental sequential pattern mining with forgetting factor. Sci China Inf Sci. 2025;68(10):209101. https:\/\/doi.org\/10.1007\/s11432-024-4496-9.","journal-title":"Sci China Inf Sci"},{"issue":"7","key":"1352_CR10","doi-asserted-by":"publisher","first-page":"7136","DOI":"10.1007\/s10489-021-02505-0","volume":"52","author":"T Truong","year":"2022","unstructured":"Truong T, Duong H, Le B, Fournier-Viger P, Yun U. Mining interesting sequences with low average cost and high average utility. Appl Intell. 2022;52(7):7136\u201357.","journal-title":"Appl Intell"},{"key":"1352_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.115449","volume":"184","author":"Y Wu","year":"2021","unstructured":"Wu Y, Lei R, Li Y, Guo L, Wu X. HAOP-Miner: self-adaptive high-average utility one-off sequential pattern mining. Expert Syst Appl. 2021;184:115449.","journal-title":"Expert Syst Appl"},{"issue":"1","key":"1352_CR12","first-page":"66","volume":"16","author":"MJK Kumar","year":"2024","unstructured":"Kumar MJK, Rana D. HARUIM: high average recent utility itemset mining. Int J Data Min Model Manage. 2024;16(1):66\u2013100.","journal-title":"Int J Data Min Model Manage"},{"issue":"5","key":"1352_CR13","first-page":"6099","volume":"53","author":"G Li","year":"2023","unstructured":"Li G, Shang T, Zhang Y. Efficient mining high average-utility itemsets with effective pruning strategies and novel list structure. Appl Intell. 2023;53(5):6099\u2013118.","journal-title":"Appl Intell"},{"key":"1352_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2020.103933","volume":"96","author":"KK Sethi","year":"2020","unstructured":"Sethi KK, Ramesh D. High average-utility itemset mining with multiple minimum utility threshold: a generalized approach. Eng Appl Artif Intell. 2020;96:103933.","journal-title":"Eng Appl Artif Intell"},{"key":"1352_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2023.110733","volume":"276","author":"TDD Nguyen","year":"2023","unstructured":"Nguyen TDD, Tung NT, Pham T, Nguyen LTT. Parallel approaches to extract multi-level high utility itemsets from hierarchical transaction databases. Knowl Based Syst. 2023;276:110733.","journal-title":"Knowl Based Syst"},{"key":"1352_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.121489","volume":"237","author":"NT Tung","year":"2024","unstructured":"Tung NT, Nguyen TDD, Nguyen LTT, Vo B. An efficient method for mining high-utility itemsets from unstable negative profit databases. Expert Syst Appl. 2024;237:121489.","journal-title":"Expert Syst Appl"},{"issue":"5","key":"1352_CR17","first-page":"595","volume":"13","author":"B Vo","year":"2016","unstructured":"Vo B, Le T-P, Hong T-P, Le B, Jung JJ. An efficient approach for mining frequent item sets with transaction deletion operation. Int Arab J Inf Technol. 2016;13(5):595\u2013602.","journal-title":"Int Arab J Inf Technol"},{"issue":"1","key":"1352_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3702645","volume":"19","author":"BP Jaysawal","year":"2025","unstructured":"Jaysawal BP, Huang J-W. SOHUPDS+: an efficient one-phase algorithm for mining high utility patterns over a data stream. ACM Trans Knowl Discovery Data. 2025;19(1):1\u201316. https:\/\/doi.org\/10.1145\/3702645.","journal-title":"ACM Trans Knowl Discovery Data"},{"issue":"1","key":"1352_CR19","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 TDD, Trinh C, Snasel V, Nguyen L. New approaches for mining high utility itemsets with multiple utility thresholds. Appl Intell. 2024;54(1):767\u201390.","journal-title":"Appl Intell"},{"key":"1352_CR20","doi-asserted-by":"crossref","unstructured":"Tseng VS, Wu C-W, Shie B-E, Yu PS. 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 (KDD \u201910), pp. 253\u2013262, 2010.","DOI":"10.1145\/1835804.1835839"},{"key":"1352_CR21","doi-asserted-by":"publisher","first-page":"55726","DOI":"10.1109\/ACCESS.2021.3071777","volume":"9","author":"W Thurachon","year":"2021","unstructured":"Thurachon W, Kreesuradej W. Incremental association rule mining with a fast incremental updating frequent pattern growth algorithm. IEEE Access. 2021;9:55726\u201341.","journal-title":"IEEE Access"},{"key":"1352_CR22","doi-asserted-by":"crossref","unstructured":"Liu M, Qu J. Mining high utility itemsets without candidate generation, In Proceedings of the 21st ACM International Conference on Information and Knowledge Management (CIKM \u201912), pp. 55\u201364, 2012.","DOI":"10.1145\/2396761.2396773"},{"key":"1352_CR23","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/j.knosys.2017.03.016","volume":"124","author":"U Yun","year":"2017","unstructured":"Yun U, Ryang H, Lee G, Fujita H. An efficient algorithm for mining high utility patterns from incremental databases with one database scan. Knowl Based Syst. 2017;124:188\u2013206.","journal-title":"Knowl Based Syst"},{"key":"1352_CR24","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/j.future.2018.12.029","volume":"95","author":"U Yun","year":"2019","unstructured":"Yun U, Nam H, Lee G, Yoon E. Efficient approach for incremental high utility pattern mining with indexed list structure. Future Gener Comput Syst. 2019;95:221\u201339.","journal-title":"Future Gener Comput Syst"},{"key":"1352_CR25","doi-asserted-by":"publisher","first-page":"77605","DOI":"10.1109\/ACCESS.2024.3406562","volume":"12","author":"C Lee","year":"2024","unstructured":"Lee C, Kim H, Cho M, Kim H, Vo B, Lin JC-W, et al. Incremental top-k high utility pattern mining and analyzing over the entire accumulated dynamic database. IEEE Access. 2024;12:77605\u201320.","journal-title":"IEEE Access"},{"key":"1352_CR26","doi-asserted-by":"publisher","first-page":"111060","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 JC-W, et al. Efficient approach for mining high-utility patterns on incremental databases with dynamic profits. Knowl Based Syst. 2023;282:111060.","journal-title":"Knowl Based Syst"},{"key":"1352_CR27","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2025.112902","volume":"172","author":"U Yun","year":"2025","unstructured":"Yun U, Kim H, Kim H, Park S. Efficient fuzzy-based high utility pattern computing and analyzing approach with temporal properties. Appl Soft Comput. 2025;172:112902. https:\/\/doi.org\/10.1016\/j.asoc.2025.112902.","journal-title":"Appl Soft Comput"},{"key":"1352_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ins.2020.03.030","volume":"529","author":"H Nam","year":"2020","unstructured":"Nam H, Yun U, Yoon E, Lin JC-W. Efficient approach of recent high utility stream pattern mining with indexed list structure and pruning strategy considering arrival times of transactions. Inf Sci. 2020;529:1\u201327.","journal-title":"Inf Sci"},{"issue":"2","key":"1352_CR29","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, et al. Rhups: mining recent high utility patterns with sliding window\u2013based arrival time control over data streams. ACM Trans Intell Syst Technol. 2021;12(2):1\u201327. https:\/\/doi.org\/10.1145\/3430767.","journal-title":"ACM Trans Intell Syst Technol"},{"key":"1352_CR30","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, et al. Damped sliding based utility oriented pattern mining over stream data. Knowl Based Syst. 2021;213:106653.","journal-title":"Knowl Based Syst"},{"issue":"2","key":"1352_CR31","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/j.aei.2016.04.002","volume":"30","author":"JC-W Lin","year":"2016","unstructured":"Lin JC-W, Li T, Fournier-Viger P, Hong T-P, Zhan J, Voznak M. An efficient algorithm to mine high average-utility itemsets. Adv Eng Inform. 2016;30(2):233\u201343.","journal-title":"Adv Eng Inform"},{"issue":"7","key":"1352_CR32","doi-asserted-by":"publisher","first-page":"8259","DOI":"10.1016\/j.eswa.2011.01.006","volume":"38","author":"T-P Hong","year":"2011","unstructured":"Hong T-P, Lee C-H, Wang S-L. Effective utility mining with the measure of average utility. Expert Syst Appl. 2011;38(7):8259\u201365.","journal-title":"Expert Syst Appl"},{"key":"1352_CR33","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1016\/j.future.2016.10.027","volume":"68","author":"U Yun","year":"2017","unstructured":"Yun U, Kim D. Mining of high average-utility itemsets using novel list structure and pruning strategy. Future Gener Comput Syst. 2017;68:346\u201360.","journal-title":"Future Gener Comput Syst"},{"key":"1352_CR34","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.ins.2020.07.043","volume":"543","author":"H Kim","year":"2021","unstructured":"Kim H, Yun U, Baek Y, Kim J, Vo B, Yoon E, Fujita H. Efficient list based mining of high average utility patterns with maximum average pruning strategies. Inf Sci. 2021;543:85\u2013105.","journal-title":"Inf Sci"},{"key":"1352_CR35","doi-asserted-by":"publisher","first-page":"18655","DOI":"10.1109\/ACCESS.2018.2820740","volume":"6","author":"JM-T Wu","year":"2018","unstructured":"Wu JM-T, Lin JC-W, Pirouz M, Fournier-Viger P. TUB-HAUPM: tighter upper bound for mining high Average-Utility patterns. IEEE Access. 2018;6:18655\u201369.","journal-title":"IEEE Access"},{"issue":"1","key":"1352_CR36","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/s10489-016-0890-z","volume":"47","author":"D Kim","year":"2017","unstructured":"Kim D, Yun U. Efficient algorithm for mining high average-utility itemsets in incremental transaction databases. Appl Intell. 2017;47(1):114\u201331.","journal-title":"Appl Intell"},{"key":"1352_CR37","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.future.2020.04.027","volume":"111","author":"J Kim","year":"2020","unstructured":"Kim J, Yun U, Yoon E, Lin JC-W, Fournier-Viger P. One scan based high average-utility pattern mining in static and dynamic databases. Future Gener Comput Syst. 2020;111:143\u201358.","journal-title":"Future Gener Comput Syst"},{"key":"1352_CR38","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2022.109702","volume":"256","author":"C Lee","year":"2022","unstructured":"Lee C, Ryu T, Kim H, Kim H, Vo B, Lin JC-W, et al. Efficient approach of sliding window-based high average-utility pattern mining with list structures. Knowledge-Based Syst. 2022;256:109702.","journal-title":"Knowledge-Based Syst"},{"key":"1352_CR39","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 JC-W, Fujita H, et al. Efficient approach of high average utility pattern mining with indexed list-based structure in dynamic environments. Inf Sci. 2024;657:119924.","journal-title":"Inf Sci"},{"issue":"5","key":"1352_CR40","first-page":"5831","volume":"38","author":"JM-T Wu","year":"2020","unstructured":"Wu JM-T, Teng Q, Lin JC-W, Yun U, Chen H-C. Updating high average-utility itemsets with pre-large concept. J Intell Fuzzy Syst. 2020;38(5):5831\u201340.","journal-title":"J Intell Fuzzy Syst"},{"issue":"11","key":"1352_CR41","doi-asserted-by":"publisher","first-page":"3788","DOI":"10.1007\/s10489-020-01743-y","volume":"50","author":"JC-W Lin","year":"2020","unstructured":"Lin JC-W, Pirouz M, Djenouri Y, Cheng C-F, Ahmed U. Incrementally updating the high average-utility patterns with pre-large concept. Appl Intell. 2020;50(11):3788\u2013807.","journal-title":"Appl Intell"},{"issue":"15","key":"1352_CR42","doi-asserted-by":"publisher","first-page":"17012","DOI":"10.1007\/s10489-021-02539-4","volume":"52","author":"JM-T Wu","year":"2022","unstructured":"Wu JM-T, Teng Q, Tayeb S, Lin JC-W. Dynamic maintenance model for high average-utility pattern mining with deletion operation. Appl Intell. 2022;52(15):17012\u201325.","journal-title":"Appl Intell"},{"key":"1352_CR43","doi-asserted-by":"publisher","first-page":"884","DOI":"10.1007\/978-3-030-55789-8_75","volume-title":"Trends in Artificial Intelligence Theory and Applications. Artificial Intelligence Practices","author":"JM-T Wu","year":"2020","unstructured":"Wu JM-T, Teng Q, Lin JC-W, Fournier-Viger P, Cheng C-F. Maintenance of Prelarge High Average-Utility Patterns in Incremental Databases. In: Trends in Artificial Intelligence Theory and Applications. Artificial Intelligence Practices. 2020. p. 884\u201395."},{"issue":"2","key":"1352_CR44","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/s10489-013-0467-z","volume":"40","author":"C-W Lin","year":"2014","unstructured":"Lin C-W, Hong T-P, Lan G-C, Wong J-W, Lin W-Y. Incrementally mining high utility patterns based on pre-large concept. Appl Intell. 2014;40(2):343\u201357.","journal-title":"Appl Intell"},{"key":"1352_CR45","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.engappai.2018.03.020","volume":"72","author":"J Lee","year":"2017","unstructured":"Lee J, Yun U, Lee G, Yoon E. Efficient incremental high utility pattern mining based on pre-large concept. Eng Appl Artif Intell. 2017;72:111\u201323.","journal-title":"Eng Appl Artif Intell"},{"key":"1352_CR46","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.future.2019.09.024","volume":"103","author":"U Yun","year":"2020","unstructured":"Yun U, Nam H, Kim J, Kim H, Baek Y, Lee J, et al. Efficient transaction deleting approach of pre-large based high utility pattern mining in dynamic databases. Future Gener Comput Syst. 2020;103:58\u201378.","journal-title":"Future Gener Comput Syst"},{"issue":"1","key":"1352_CR47","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.aei.2014.08.003","volume":"29","author":"C-W Lin","year":"2015","unstructured":"Lin C-W, Hong T-P, Lan G-C, Wong J-W, Lin W-Y. Efficient updating of discovered high-utility itemsets for transaction deletion in dynamic databases. Adv Eng Inform. 2015;29(1):16\u201327.","journal-title":"Adv Eng Inform"},{"issue":"24","key":"1352_CR48","doi-asserted-by":"publisher","first-page":"17333","DOI":"10.1109\/JIOT.2021.3080284","volume":"8","author":"U Yun","year":"2021","unstructured":"Yun U, Kim H, Ryu T, Baek Y, Nam H, Lee J, et al. Prelarge-based utility-oriented data analytics for transaction modifications in internet of things. IEEE Internet Things J. 2021;8(24):17333\u201344.","journal-title":"IEEE Internet Things J"},{"key":"1352_CR49","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2023.110478","volume":"268","author":"H Kim","year":"2023","unstructured":"Kim H, Lee C, Ryu T, Kim H, Kim S, Vo B, et al. Pre-large based high utility pattern mining for transaction insertions in incremental database. Knowledge-Based Syst. 2023;268:110478.","journal-title":"Knowledge-Based Syst"},{"issue":"13","key":"1352_CR50","doi-asserted-by":"publisher","first-page":"24470","DOI":"10.1109\/Jiot.2025.3555278","volume":"12","author":"D Kim","year":"2025","unstructured":"Kim D, Park S, Kim H, Lee C, Kim H, Cho M, et al. Pre-eminent utility driven data analytics based on prelarge patterns for dynamic transaction deletion in IoT environments. IEEE Internet Things J. 2025;12(13):24470\u201389. https:\/\/doi.org\/10.1109\/Jiot.2025.3555278.","journal-title":"IEEE Internet Things J"},{"key":"1352_CR51","doi-asserted-by":"publisher","DOI":"10.1109\/Tbdata.2025.3556615","author":"U Yun","year":"2025","unstructured":"Yun U, Kim H, Cho M, Ryu T, Park S, Kim D, et al. Utility-driven data analytics algorithm for transaction modifications using pre-large concept with single database scan. IEEE Trans Big Data. 2025. https:\/\/doi.org\/10.1109\/Tbdata.2025.3556615.","journal-title":"IEEE Trans Big Data"},{"key":"1352_CR52","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/s11227-024-06568-x","volume":"81","author":"H Yan","year":"2025","unstructured":"Yan H, Li F, Hsieh M-C, Wu JM-T. High-utility sequential pattern mining in incremental database. J Supercomputing. 2024;81:81.","journal-title":"J Supercomputing"},{"key":"1352_CR53","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2025.129544","volume":"298","author":"I Rahimi","year":"2026","unstructured":"Rahimi I. A decision support system for open-pit mining optimisation with dynamic uncertainty and GPU-based parallel repair approach. Expert Syst Appl. 2026;298:129544. https:\/\/doi.org\/10.1016\/j.eswa.2025.129544.","journal-title":"Expert Syst Appl"}],"container-title":["Journal of Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s40537-025-01352-x","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s40537-025-01352-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s40537-025-01352-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,3]],"date-time":"2026-02-03T11:41:47Z","timestamp":1770118907000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1186\/s40537-025-01352-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,4]]},"references-count":53,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,12]]}},"alternative-id":["1352"],"URL":"https:\/\/doi.org\/10.1186\/s40537-025-01352-x","relation":{},"ISSN":["2196-1115"],"issn-type":[{"value":"2196-1115","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,4]]},"assertion":[{"value":"22 July 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 December 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 January 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":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Ethics and consent to participate"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to publi<!--Emphasis Type='Bold' removed-->cation"}},{"value":"The authors declare no competing interests.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"13"}}