{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T15:20:35Z","timestamp":1777735235529,"version":"3.51.4"},"reference-count":52,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2023,8,10]],"date-time":"2023-08-10T00:00:00Z","timestamp":1691625600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62002136 and 62272196"],"award-info":[{"award-number":["62002136 and 62272196"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003453","name":"Natural Science Foundation of Guangdong Province","doi-asserted-by":"crossref","award":["2020A1515010970 and 2022A1515011861"],"award-info":[{"award-number":["2020A1515010970 and 2022A1515011861"]}],"id":[{"id":"10.13039\/501100003453","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Shenzhen Research Council","award":["JCYJ 20200109113427092 and GXWD 20220811170253002"],"award-info":[{"award-number":["JCYJ 20200109113427092 and GXWD 20220811170253002"]}]},{"name":"NSF","award":["III-1763325, III-1909323, and SaTC-1930941"],"award-info":[{"award-number":["III-1763325, III-1909323, and SaTC-1930941"]}]},{"name":"Guangdong Provincial Key Laboratory of Novel Security Intelligence Technologies","award":["2022B1212010005"],"award-info":[{"award-number":["2022B1212010005"]}]},{"name":"Engineering Research Center of Trustworthy AI, Ministry of Education"},{"name":"Guangdong Key Laboratory of Data Security and Privacy Preserving"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2024,1,31]]},"abstract":"<jats:p>High-utility sequential pattern mining (HUSPM) has emerged as an important topic due to its wide application and considerable popularity. However, due to the combinatorial explosion of the search space when the HUSPM problem encounters a low-utility threshold or large-scale data, it may be time-consuming and memory-costly to address the HUSPM problem. Several algorithms have been proposed for addressing this problem, but they still cost a lot in terms of running time and memory usage. In this article, to further solve this problem efficiently, we design a compact structure called sequence projection (seqPro) and propose an efficient algorithm, namely, discovering high-utility sequential patterns with the seqPro structure (HUSP-SP). HUSP-SP utilizes the compact seq-array to store the necessary information in a sequence database. The seqPro structure is designed to efficiently calculate candidate patterns\u2019 utilities and upper-bound values. Furthermore, a new upper bound on utility, namely, tighter reduced sequence utility and two pruning strategies in search space, are utilized to improve the mining performance of HUSP-SP. Experimental results on both synthetic and real-life datasets show that HUSP-SP can significantly outperform the state-of-the-art algorithms in terms of running time, memory usage, search space pruning efficiency, and scalability.<\/jats:p>","DOI":"10.1145\/3597935","type":"journal-article","created":{"date-parts":[[2023,5,22]],"date-time":"2023-05-22T12:22:08Z","timestamp":1684758128000},"page":"1-21","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["HUSP-SP: Faster Utility Mining on Sequence Data"],"prefix":"10.1145","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2207-0953","authenticated-orcid":false,"given":"Chunkai","family":"Zhang","sequence":"first","affiliation":[{"name":"Harbin Institute of Technology (Shenzhen), China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-9316-4332","authenticated-orcid":false,"given":"Yuting","family":"Yang","sequence":"additional","affiliation":[{"name":"Harbin Institute of Technology (Shenzhen), China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3534-9547","authenticated-orcid":false,"given":"Zilin","family":"Du","sequence":"additional","affiliation":[{"name":"Harbin Institute of Technology (Shenzhen), China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5781-8116","authenticated-orcid":false,"given":"Wensheng","family":"Gan","sequence":"additional","affiliation":[{"name":"Jinan University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3491-5968","authenticated-orcid":false,"given":"Philip S.","family":"Yu","sequence":"additional","affiliation":[{"name":"University of Illinois at Chicago, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,8,10]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"crossref","unstructured":"R. Agrawal and R. Srikant. 1994. Quest synthetic data generator. Retrieved from http:\/\/www.Almaden.ibm.com\/cs\/quest\/syndata.html.","DOI":"10.1145\/191839.191972"},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.5555\/645480.655281"},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.5555\/645920.672836"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/SNPD.2010.21"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.4218\/etrij.10.1510.0066"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2009.46"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2420557"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1145\/299432.299445"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/253260.253325"},{"key":"e_1_3_2_11_2","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1109\/ICDM.2003.1250893","volume-title":"Proceedings of the 3th IEEE International Conference on Data Mining","author":"Chan Raymond","year":"2003","unstructured":"Raymond Chan, Qiang Yang, and Yi-Dong Shen. 2003. Mining high-utility itemsets. In Proceedings of the 3th IEEE International Conference on Data Mining. IEEE, 19\u201319."},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1109\/69.553155"},{"issue":"2","key":"e_1_3_2_13_2","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/s11704-016-6245-4","article-title":"CLS-Miner: Efficient and effective closed high-utility itemset mining","volume":"13","author":"Dam Thu-Lan","year":"2019","unstructured":"Thu-Lan Dam, Kenli Li, Philippe Fournier-Viger, and Quang-Huy Duong. 2019. CLS-Miner: Efficient and effective closed high-utility itemset mining. Front. Comput. Sci. 13, 2 (2019), 357\u2013381.","journal-title":"Front. Comput. Sci."},{"key":"e_1_3_2_14_2","first-page":"34","volume-title":"Proceedings of the 27th International Conference on Database Systems for Advanced Applications Workshops","author":"Fournier-Viger Philippe","year":"2022","unstructured":"Philippe Fournier-Viger, Wensheng Gan, Youxi Wu, Mourad Nouioua, Wei Song, Tin Truong, and Hai Duong. 2022. Pattern mining: Current challenges and opportunities. In Proceedings of the 27th International Conference on Database Systems for Advanced Applications Workshops. Springer, 34\u201349."},{"issue":"1","key":"e_1_3_2_15_2","first-page":"54","article-title":"A survey of sequential pattern mining","volume":"1","author":"Fournier-Viger Philippe","year":"2017","unstructured":"Philippe Fournier-Viger, Jerry Chun-Wei Lin, Rage Uday Kiran, Yun Sing Koh, and Rincy Thomas. 2017. A survey of sequential pattern mining. Data Sci. Pattern Recogn. 1, 1 (2017), 54\u201377.","journal-title":"Data Sci. Pattern Recogn."},{"key":"e_1_3_2_16_2","first-page":"83","volume-title":"Proceedings of the International Symposium on Methodologies for Intelligent Systems","author":"Fournier-Viger Philippe","year":"2014","unstructured":"Philippe Fournier-Viger, Cheng-Wei Wu, Souleymane Zida, and Vincent S. Tseng. 2014. FHM: Faster high-utility itemset mining using estimated utility co-occurrence pruning. In Proceedings of the International Symposium on Methodologies for Intelligent Systems. Springer, 83\u201392."},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1109\/TFUZZ.2021.3089284"},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2019.07.005"},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2018.8622405"},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1109\/BigData47090.2019.9006152"},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1002\/widm.1242"},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2019.2942594"},{"key":"e_1_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1145\/3314107"},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2019.10.033"},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2020.2970176"},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1145\/3446938"},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1145\/3362070"},{"key":"e_1_3_2_28_2","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1109\/ICDE.2001.914830","volume-title":"Proceedings of the 17th International Conference on Data Engineering","author":"Han Jiawei","year":"2001","unstructured":"Jiawei Han, Jian Pei, Behzad Mortazavi-Asl, Helen Pinto, Qiming Chen, Umeshwar Dayal, and Meichun Hsu. 2001. PrefixSpan: Mining sequential patterns efficiently by prefix-projected pattern growth. In Proceedings of the 17th International Conference on Data Engineering. Citeseer, 215\u2013224."},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1023\/B:DAMI.0000005258.31418.83"},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.1145\/1148170.1148215"},{"key":"e_1_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2015.12.019"},{"key":"e_1_3_2_32_2","first-page":"215","volume-title":"Proceedings of the Asia-Pacific Web (APWeb) and Web-Age Information Management (WAIM) Joint Conference on Web and Big Data","author":"Lin Jerry Chun-Wei","year":"2017","unstructured":"Jerry Chun-Wei Lin, Jiexiong Zhang, and Philippe Fournier-Viger. 2017. High-utility sequential pattern mining with multiple minimum utility thresholds. In Proceedings of the Asia-Pacific Web (APWeb) and Web-Age Information Management (WAIM) Joint Conference on Web and Big Data. Springer, 215\u2013229."},{"key":"e_1_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1145\/2396761.2396773"},{"key":"e_1_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.1007\/11430919_79"},{"key":"e_1_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2012.05.035"},{"key":"e_1_3_2_36_2","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2020.3026826"},{"key":"e_1_3_2_37_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2019.05.010"},{"key":"e_1_3_2_38_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-04921-8_4"},{"key":"e_1_3_2_39_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2012.59"},{"key":"e_1_3_2_40_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2458860"},{"key":"e_1_3_2_41_2","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835839"},{"key":"e_1_3_2_42_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-018-1161-6"},{"key":"e_1_3_2_43_2","doi-asserted-by":"publisher","DOI":"10.1145\/3178114"},{"key":"e_1_3_2_44_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-015-0914-8"},{"key":"e_1_3_2_45_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.115449"},{"issue":"10","key":"e_1_3_2_46_2","doi-asserted-by":"crossref","first-page":"1750035","DOI":"10.1142\/S0218001417500355","article-title":"Mining high-utility sequential patterns with negative item values","volume":"31","author":"Xu Tiantian","year":"2017","unstructured":"Tiantian Xu, Xiangjun Dong, Jianliang Xu, and Xue Dong. 2017. Mining high-utility sequential patterns with negative item values. Int. J. Pattern Recogn. Artific. Intell. 31, 10 (2017), 1750035.","journal-title":"Int. J. Pattern Recogn. Artific. Intell."},{"key":"e_1_3_2_47_2","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339636"},{"key":"e_1_3_2_48_2","first-page":"1259","volume-title":"Proceedings of the 13th International Conference on Data Mining","author":"Yin Junfu","year":"2013","unstructured":"Junfu Yin, Zhigang Zheng, Longbing Cao, Yin Song, and Wei Wei. 2013. Efficiently mining top- \\(k\\) high-utility sequential patterns. In Proceedings of the 13th International Conference on Data Mining. IEEE, 1259\u20131264."},{"issue":"2","key":"e_1_3_2_49_2","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1109\/TBDATA.2022.3175428","article-title":"TUSQ: Targeted high-utility sequence querying","volume":"9","author":"Zhang Chunkai","year":"2023","unstructured":"Chunkai Zhang, Quanjian Dai, Zilin Du, Wensheng Gan, Jian Weng, and Philip S. Yu. 2023. TUSQ: Targeted high-utility sequence querying. IEEE Trans. Big Data 9, 2 (2023), 512\u2013527.","journal-title":"IEEE Trans. Big Data"},{"key":"e_1_3_2_50_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2021.04.035"},{"issue":"2","key":"e_1_3_2_51_2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3457570","article-title":"On-shelf utility mining of sequence data","volume":"16","author":"Zhang Chunkai","year":"2021","unstructured":"Chunkai Zhang, Zilin Du, Yuting Yang, Wensheng Gan, and Philip S. Yu. 2021. On-shelf utility mining of sequence data. ACM Trans. Knowl. Discov. Data 16, 2 (2021), 1\u201331.","journal-title":"ACM Trans. Knowl. Discov. Data"},{"key":"e_1_3_2_52_2","first-page":"530","volume-title":"Proceedings of the Mexican International Conference on Artificial Intelligence","author":"Zida Souleymane","year":"2015","unstructured":"Souleymane Zida, Philippe Fournier-Viger, Jerry Chun Wei Lin, Cheng Wei Wu, and Vincent S. Tseng. 2015. EFIM: A highly efficient algorithm for high-utility itemset mining. In Proceedings of the Mexican International Conference on Artificial Intelligence. Springer, 530\u2013546."},{"key":"e_1_3_2_53_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-016-5617-1"}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3597935","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3597935","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:37:59Z","timestamp":1750178279000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3597935"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,10]]},"references-count":52,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,1,31]]}},"alternative-id":["10.1145\/3597935"],"URL":"https:\/\/doi.org\/10.1145\/3597935","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"value":"1556-4681","type":"print"},{"value":"1556-472X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,8,10]]},"assertion":[{"value":"2021-12-31","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-02-13","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-08-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}