{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T23:16:28Z","timestamp":1768691788166,"version":"3.49.0"},"reference-count":51,"publisher":"Association for Computing Machinery (ACM)","issue":"1","funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62372154, 52477232, 62120106008"],"award-info":[{"award-number":["62372154, 52477232, 62120106008"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"National Key Research and Development Program of China","award":["2024YFB3311901"],"award-info":[{"award-number":["2024YFB3311901"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Intell. Syst. Technol."],"published-print":{"date-parts":[[2026,2,28]]},"abstract":"<jats:p>\n                    As a crucial aspect of data mining, high average utility sequential pattern mining (SPM) aims to discover low frequency and high average utility patterns (subsequences) in sequence data. Most existing high average utility SPM methods overlook the repetitive occurrences of patterns in each sequence, resulting in some important patterns being ignored. To address this issue, we focus on the problem of mining high average utility nonoverlapping patterns (HUPs) from sequential database, and propose an HUP-Miner algorithm. To reduce the need for repeated scanning of the original database, we use a position dictionary to record the occurrence information of each item. To reduce the number of candidate patterns generated, we adopt a pattern join strategy and explore four pruning strategies. To efficiently calculate the average utility of a pattern, we propose an SPC algorithm that utilizes the occurrence positions of sub-patterns. When compared with 12 competitive algorithms, the experimental results on 14 databases show that HUP-Miner gives superior results. Furthermore, we use information gain as the utility for each item, and find that the HUPs discovered in this way can generate better performance via a clustering analysis. All of the algorithms and databases used here are available from\n                    <jats:ext-link xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" ext-link-type=\"uri\" xlink:href=\"https:\/\/github.com\/wuc567\/Pattern-Mining\/tree\/master\/HUP-Miner\">https:\/\/github.com\/wuc567\/Pattern-Mining\/tree\/master\/HUP-Miner<\/jats:ext-link>\n                    .\n                  <\/jats:p>","DOI":"10.1145\/3773899","type":"journal-article","created":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T16:03:20Z","timestamp":1761667400000},"page":"1-24","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Mining High Average Utility Nonoverlapping Patterns from Sequential Database"],"prefix":"10.1145","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-6806-4553","authenticated-orcid":false,"given":"Meng","family":"Geng","sequence":"first","affiliation":[{"name":"School of Artificial Intelligence, Hebei University of Technology, Tianjin, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5314-3468","authenticated-orcid":false,"given":"Youxi","family":"Wu","sequence":"additional","affiliation":[{"name":"School of Artificial Intelligence, Hebei University of Technology, Tianjin, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1126-9772","authenticated-orcid":false,"given":"Yan","family":"Li","sequence":"additional","affiliation":[{"name":"School of Economics and Management, Hebei University of Technology, Tianjin, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0232-1444","authenticated-orcid":false,"given":"Jing","family":"Liu","sequence":"additional","affiliation":[{"name":"School of Artificial Intelligence, Hebei University of Technology, Tianjin, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3427-8222","authenticated-orcid":false,"given":"Lei","family":"Guo","sequence":"additional","affiliation":[{"name":"Key Laboratory of Reliability and Intelligence of Electrical Equipment, Hebei University of Technology, Tianjin, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4129-9611","authenticated-orcid":false,"given":"Xingquan","family":"Zhu","sequence":"additional","affiliation":[{"name":"Department of Computer and Electrical Engineering and Computer Science, Florida Atlantic University, Boca Raton, Florida, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2396-1704","authenticated-orcid":false,"given":"Xindong","family":"Wu","sequence":"additional","affiliation":[{"name":"Key Laboratory of Knowledge Engineering with Big Data (the Ministry of Education of China), Hefei University of Technology, Hefei, China"}]}],"member":"320","published-online":{"date-parts":[[2026,1,17]]},"reference":[{"key":"e_1_3_1_2_2","doi-asserted-by":"crossref","unstructured":"Ramesh C. Agarwal Charu C. Aggarwal and V. V. V. Prasad. 2001. A tree projection algorithm for generation of frequent item sets. Journal of Parallel and Distributed Computing 61 3 (2001) 350\u2013371.","DOI":"10.1006\/jpdc.2000.1693"},{"key":"e_1_3_1_3_2","doi-asserted-by":"crossref","unstructured":"Md Mahbub Alam Luis Torgo and Albert Bifet. 2022. A survey on spatio-temporal data analytics systems. ACM Computing Surveys 54 10s (2022) 1\u201338.","DOI":"10.1145\/3507904"},{"key":"e_1_3_1_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2773493"},{"issue":"4","key":"e_1_3_1_5_2","first-page":"36","article-title":"Large-scale frequent episode mining from complex event sequences with hierarchies","volume":"10","author":"Ao Xiang","year":"2019","unstructured":"Xiang Ao, Haoran Shi, Jin Wang, Luo Zuo, Hongwei Li, and Qing He. 2019. Large-scale frequent episode mining from complex event sequences with hierarchies. ACM Transactions on Intelligent Systems and Technology 10, 4 (2019), 36.","journal-title":"ACM Transactions on Intelligent Systems and Technology"},{"issue":"2","key":"e_1_3_1_6_2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3430767","article-title":"RHUPS: Mining recent high utility patterns with sliding window\u2013based arrival time control over data streams","volume":"12","author":"Baek Yoonji","year":"2021","unstructured":"Yoonji Baek, Unil Yun, Heonho Kim, Hyoju Nam, Hyunsoo Kim, Jerry Chun-Wei Lin, Bay Vo, and Witold Pedrycz. 2021. RHUPS: Mining recent high utility patterns with sliding window\u2013based arrival time control over data streams. ACM Transactions on Intelligent Systems and Technology 12, 2 (2021), 1\u201327.","journal-title":"ACM Transactions on Intelligent Systems and Technology"},{"key":"e_1_3_1_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2020.10.001"},{"key":"e_1_3_1_8_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2023.110166"},{"key":"e_1_3_1_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCSS.2022.3233408"},{"key":"e_1_3_1_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2018.2869907"},{"key":"e_1_3_1_11_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2019.105241"},{"key":"e_1_3_1_12_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2020.2970176"},{"key":"e_1_3_1_13_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.3041732"},{"issue":"9","key":"e_1_3_1_14_2","doi-asserted-by":"crossref","first-page":"4874","DOI":"10.1109\/TKDE.2023.3334300","article-title":"RNP-Miner: Repetitive nonoverlapping sequential pattern mining","volume":"36","author":"Geng Meng","year":"2023","unstructured":"Meng Geng, Youxi Wu, Yan Li, Jing Liu, Philippe Fournier-Viger, Xingquan Zhu, and Xindong Wu. 2023. RNP-Miner: Repetitive nonoverlapping sequential pattern mining. IEEE Transactions on Knowledge and Data Engineering 36, 9 (2023), 4874\u20134889.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"e_1_3_1_15_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-022-01763-9"},{"issue":"5","key":"e_1_3_1_16_2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3639827","article-title":"TaSPM: Targeted sequential pattern mining","volume":"18","author":"Huang Gengsen","year":"2023","unstructured":"Gengsen Huang, Wensheng Gan, and Philip S. Yu. 2023. TaSPM: Targeted sequential pattern mining. ACM Transactions on Knowledge Discovery from Data 18, 5 (2023), 1\u201318.","journal-title":"ACM Transactions on Knowledge Discovery from Data"},{"key":"e_1_3_1_17_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2023.105939"},{"key":"e_1_3_1_18_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2023.119924"},{"key":"e_1_3_1_19_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2024.3381178"},{"key":"e_1_3_1_20_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2023.3241213"},{"issue":"4","key":"e_1_3_1_21_2","first-page":"37","article-title":"MoveMine: Mining moving object data for discovery of animal movement patterns","volume":"2","author":"Li Zhenhui","year":"2011","unstructured":"Zhenhui Li, Jiawei Han, Ming Ji, Lu-An Tang, Yintao Yu, Bolin Ding, Jae-Gil Lee, and Roland Kays. 2011. MoveMine: Mining moving object data for discovery of animal movement patterns. ACM Transactions on Intelligent Systems and Technology 2, 4 (2011), 37.","journal-title":"ACM Transactions on Intelligent Systems and Technology"},{"key":"e_1_3_1_22_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107422"},{"key":"e_1_3_1_23_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-019-01385-8"},{"issue":"1","key":"e_1_3_1_24_2","first-page":"1","article-title":"Second-order confidence network for early classification of time series","volume":"15","author":"Lv Junwei","year":"2023","unstructured":"Junwei Lv, Yuqi Chu, Jun Hu, Peipei Li, and Xuegang Hu. 2023. Second-order confidence network for early classification of time series. ACM Transactions on Intelligent Systems and Technology 15, 1 (2023), 1\u201328.","journal-title":"ACM Transactions on Intelligent Systems and Technology"},{"key":"e_1_3_1_25_2","doi-asserted-by":"crossref","unstructured":"Nizar R. Mabroukeh and Christie I. Ezeife. 2010. A taxonomy of sequential pattern mining algorithms. ACM Computing Surveys 43 1 (2010) 1\u201341.","DOI":"10.1145\/1824795.1824798"},{"key":"e_1_3_1_26_2","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2022.3229092"},{"key":"e_1_3_1_27_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-016-0931-2"},{"key":"e_1_3_1_28_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2019.05.013"},{"issue":"7","key":"e_1_3_1_29_2","doi-asserted-by":"crossref","first-page":"1881","DOI":"10.1109\/TPDS.2016.2637914","article-title":"Distributed mining of contrast patterns","volume":"28","author":"Savage David","year":"2016","unstructured":"David Savage, Xiuzhen Zhang, Pauline Chou, Xinghou Yu, and Qingmai Wang. 2016. Distributed mining of contrast patterns. IEEE Transactions on Parallel and Distributed Systems 28, 7 (2016), 1881\u20131890.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"e_1_3_1_30_2","doi-asserted-by":"publisher","DOI":"10.5555\/645337.650382"},{"issue":"1","key":"e_1_3_1_31_2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3617378","article-title":"A clique-querying mining framework for discovering high utility co-location patterns without generating candidates","volume":"18","author":"Wang Lizhen","year":"2023","unstructured":"Lizhen Wang, Vanha Tran, and Thanhcong Do. 2023. A clique-querying mining framework for discovering high utility co-location patterns without generating candidates. ACM Transactions on Knowledge Discovery from Data 18, 1 (2023), 1\u201342.","journal-title":"ACM Transactions on Knowledge Discovery from Data"},{"key":"e_1_3_1_32_2","doi-asserted-by":"publisher","DOI":"10.1145\/3399671"},{"key":"e_1_3_1_33_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-021-02763-y"},{"key":"e_1_3_1_34_2","doi-asserted-by":"publisher","DOI":"10.1145\/3485848"},{"key":"e_1_3_1_35_2","doi-asserted-by":"publisher","DOI":"10.1145\/3549940"},{"key":"e_1_3_1_36_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2021.107361"},{"issue":"5","key":"e_1_3_1_37_2","first-page":"3288","article-title":"OPP-Miner: Order-preserving sequential pattern mining for time series","volume":"53","author":"Wu Youxi","year":"2022","unstructured":"Youxi Wu, Qian Hu, Yan Li, Lei Guo, Xingquan Zhu, and Xindong Wu. 2022. OPP-Miner: Order-preserving sequential pattern mining for time series. IEEE Transactions on Cybernetics 53, 5 (2022), 3288\u20133300.","journal-title":"IEEE Transactions on Cybernetics"},{"key":"e_1_3_1_38_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.115449"},{"key":"e_1_3_1_39_2","doi-asserted-by":"publisher","DOI":"10.1145\/3480245"},{"key":"e_1_3_1_40_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2023.3321749"},{"key":"e_1_3_1_41_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-015-0935-3"},{"key":"e_1_3_1_42_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2017.2750691"},{"key":"e_1_3_1_43_2","doi-asserted-by":"publisher","DOI":"10.1145\/3476247"},{"key":"e_1_3_1_44_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2021.3082114"},{"key":"e_1_3_1_45_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2021.12.064"},{"key":"e_1_3_1_46_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2020.105812"},{"issue":"12","key":"e_1_3_1_47_2","doi-asserted-by":"crossref","first-page":"5979","DOI":"10.1109\/TKDE.2021.3060119","article-title":"SCPM-CR: A novel method for spatial co-location pattern mining with coupling relation consideration","volume":"34","author":"Yang Peizhong","year":"2021","unstructured":"Peizhong Yang, Lizhen Wang, Xiaoxuan Wang, and Lihua Zhou. 2021. SCPM-CR: A novel method for spatial co-location pattern mining with coupling relation consideration. IEEE Transactions on Knowledge and Data Engineering 34, 12 (2021), 5979\u20135992.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"e_1_3_1_48_2","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2022.3175428"},{"key":"e_1_3_1_49_2","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2022.3178182"},{"issue":"3","key":"e_1_3_1_50_2","doi-asserted-by":"crossref","first-page":"1734","DOI":"10.1109\/TCBB.2020.3041559","article-title":"Mining similar aspects for gene similarity explanation based on gene information network","volume":"19","author":"Zhang Yidan","year":"2020","unstructured":"Yidan Zhang, Lei Duan, Huiru Zheng, Jesse Li Ling, Ruiqi Qin, Zihao Chen, Chengxin He, and Tingting Wang. 2020. Mining similar aspects for gene similarity explanation based on gene information network. IEEE\/ACM Transactions on Computational Biology and Bioinformatics 19, 3 (2020), 1734\u20131746.","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics"},{"key":"e_1_3_1_51_2","doi-asserted-by":"publisher","DOI":"10.1007\/s12559-021-09871-4"},{"key":"e_1_3_1_52_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2541149"}],"container-title":["ACM Transactions on Intelligent Systems and Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3773899","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T11:56:22Z","timestamp":1768650982000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3773899"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,17]]},"references-count":51,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,2,28]]}},"alternative-id":["10.1145\/3773899"],"URL":"https:\/\/doi.org\/10.1145\/3773899","relation":{},"ISSN":["2157-6904","2157-6912"],"issn-type":[{"value":"2157-6904","type":"print"},{"value":"2157-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,17]]},"assertion":[{"value":"2024-09-24","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-10-10","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-01-17","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}