{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T15:27:09Z","timestamp":1772206029717,"version":"3.50.1"},"reference-count":45,"publisher":"Association for Computing Machinery (ACM)","issue":"4","funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62272196"],"award-info":[{"award-number":["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":["2022A1515011861"],"award-info":[{"award-number":["2022A1515011861"]}],"id":[{"id":"10.13039\/501100003453","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Guangzhou Basic and Applied Basic Research Foundation","award":["2024A04J9971"],"award-info":[{"award-number":["2024A04J9971"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Manage. Inf. Syst."],"published-print":{"date-parts":[[2025,12,31]]},"abstract":"<jats:p>\n                    With the widespread application of sequential pattern mining (SPM) algorithms, sequential patterns that allow gap constraints are valuable for discovering knowledge from biological data such as DNA and protein sequences and some non-biological data. This approach achieves a balance between contiguous constraint SPM and traditional SPM, enabling the discovery of a wider range of patterns while accommodating user-defined gaps as needed. Among all kinds of gap-constrained mining, non-overlapping SPM, which involves discovering interesting patterns where occurrences do not overlap with each other, satisfies the anti-monotonic property (the Apriori property, i.e., the support of a pattern is not larger than that of its sub-patterns). However, existing algorithms do not search for target sequential patterns, resulting in unnecessary and redundant pattern generation. Targeted pattern mining is a technique employed to discover itemsets or sequential patterns that are directly related to items of interest to the user. In this article, we define and formalize the problem of targeted non-overlapping SPM and propose an algorithm named TALENT (\n                    <jats:underline>TA<\/jats:underline>\n                    rgeted mining of Sequentia\n                    <jats:underline>L<\/jats:underline>\n                    Patt\n                    <jats:underline>E<\/jats:underline>\n                    r\n                    <jats:underline>N<\/jats:underline>\n                    with Cons\n                    <jats:underline>T<\/jats:underline>\n                    raints). Two search methods, including breadth-first and depth-first searching, are designed to address the generation of patterns. Furthermore, several pruning strategies are presented to reduce the reading of sequences and items in the data and terminate redundant pattern extensions. Finally, we conduct extensive experiments to compare the TALENT algorithm with the existing algorithms for mining non-overlapping sequential patterns. The experimental results demonstrate that TALENT has excellent mining efficiency and can deal efficiently with different query settings. In the best-case scenario, TALENT exhibits a three-order-of-magnitude reduction in time and a memory decrease to 20% of the original consumption compared to the baseline algorithm, NOSEP\n                    <jats:inline-formula content-type=\"math\/tex\">\n                      <jats:tex-math notation=\"LaTeX\" version=\"MathJax\">\\(\\rm _{Ta}\\)<\/jats:tex-math>\n                    <\/jats:inline-formula>\n                    .\n                  <\/jats:p>\n                  <jats:p\/>","DOI":"10.1145\/3731250","type":"journal-article","created":{"date-parts":[[2025,5,22]],"date-time":"2025-05-22T07:15:39Z","timestamp":1747898139000},"page":"1-34","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["TALENT: Targeted Mining of Non-overlapping Sequential Patterns"],"prefix":"10.1145","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5951-0051","authenticated-orcid":false,"given":"Zefeng","family":"Chen","sequence":"first","affiliation":[{"name":"College of Cyber Security, Jinan University","place":["Guangzhou, 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":"College of Cyber Security, Jinan University","place":["Guangzhou, China"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9780-8185","authenticated-orcid":false,"given":"Gengsen","family":"Huang","sequence":"additional","affiliation":[{"name":"College of Cyber Security, Jinan University","place":["Guangzhou, China"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-7484-9124","authenticated-orcid":false,"given":"Zhenlian","family":"Qi","sequence":"additional","affiliation":[{"name":"School of Information Engineering, Guangdong Eco-Engineering Polytechnic","place":["Guangzhou, China"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1126-9772","authenticated-orcid":false,"given":"Yan","family":"Li","sequence":"additional","affiliation":[{"name":"Hebei University of Technology","place":["Tianjin, 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":"Department of Computer Science, University of Illinois at Chicago","place":["Chicago, United States"]}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,11,14]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775109"},{"key":"e_1_3_2_3_2","first-page":"35","volume-title":"Proceedings of the 4th IEEE International Conference on Data Mining","author":"Bonchi Francesco","year":"2004","unstructured":"Francesco Bonchi and Claudio Lucchese. 2004. On closed constrained frequent pattern mining. In Proceedings of the 4th IEEE International Conference on Data Mining. IEEE, 35\u201342."},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2016.03.001"},{"issue":"5","key":"e_1_3_2_5_2","doi-asserted-by":"crossref","first-page":"1703","DOI":"10.2298\/FIL1805703C","article-title":"Top-k sequence pattern mining with non-overlapping condition","volume":"32","author":"Chai Xin","year":"2018","unstructured":"Xin Chai, Dan Yang, Jingyu Liu, Yan Li, and Youxi Wu. 2018. Top-k sequence pattern mining with non-overlapping condition. Filomat 32, 5 (2018), 1703\u20131710.","journal-title":"Filomat"},{"issue":"10","key":"e_1_3_2_6_2","first-page":"12","article-title":"Target oriented sequential pattern mining using recency and monetary constraints","volume":"45","author":"Chand Chetna","year":"2012","unstructured":"Chetna Chand, Amit Thakkar, and Amit Ganatra. 2012. Target oriented sequential pattern mining using recency and monetary constraints. International Journal of Computer Applications 45, 10 (2012), 12\u201318.","journal-title":"International Journal of Computer Applications"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2024.121028"},{"key":"e_1_3_2_8_2","unstructured":"Zefeng Chen Wensheng Gan Gengsen Huang Yan Li and Zhenlian Qi. 2023. Towards top-k non-overlapping sequential patterns. arXiv:2304.11947. Retrieved from https:\/\/arxiv.org\/abs\/2304.11947"},{"issue":"6","key":"e_1_3_2_9_2","doi-asserted-by":"crossref","first-page":"111314","DOI":"10.1016\/j.knosys.2023.111314","article-title":"Towards utility-driven contiguous sequential patterns in uncertain multi-sequences","volume":"284","author":"Chen Zefeng","year":"2024","unstructured":"Zefeng Chen, Wensheng Gan, Gengsen Huang, Yanxin Zheng, and S. Yu Philip. 2024. Towards utility-driven contiguous sequential patterns in uncertain multi-sequences. Knowledge-based Systems 284, 6 (2024), 111314.","journal-title":"Knowledge-based Systems"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0957-4174(03)00073-3"},{"issue":"6","key":"e_1_3_2_11_2","doi-asserted-by":"crossref","first-page":"1130","DOI":"10.1109\/TKDE.2019.2897311","article-title":"Mining behavioral sequence constraints for classification","volume":"32","author":"Smedt Johannes De","year":"2019","unstructured":"Johannes De Smedt, Galina Deeva, and Jochen De Weerdt. 2019. Mining behavioral sequence constraints for classification. IEEE Transactions on Knowledge and Data Engineering 32, 6 (2019), 1130\u20131142.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2011.69"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-11217-1_3"},{"key":"e_1_3_2_14_2","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1007\/978-3-319-06608-0_4","volume-title":"Proceedings of the Pacific-Asia Conference on Knowledge Discovery and Data Mining","author":"Fournier-Viger Philippe","year":"2014","unstructured":"Philippe Fournier-Viger, Antonio Gomariz, Manuel Campos, and Rincy Thomas. 2014. Fast vertical mining of sequential patterns using co-occurrence information. In Proceedings of the Pacific-Asia Conference on Knowledge Discovery and Data Mining. Springer, 40\u201352."},{"issue":"1","key":"e_1_3_2_15_2","first-page":"3389","article-title":"SPMF: A java open-source pattern mining library.","volume":"15","author":"Fournier-Viger Philippe","year":"2014","unstructured":"Philippe Fournier-Viger, Antonio Gomariz, Ted Gueniche, Azadeh Soltani, Cheng-Wei Wu, and Vincent S. Tseng. 2014. SPMF: A java open-source pattern mining library. Journal of Machine Learning Research 15, 1 (2014), 3389\u20133393.","journal-title":"Journal of Machine Learning Research"},{"issue":"1","key":"e_1_3_2_16_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 Science and Pattern Recognition 1, 1 (2017), 54\u201377.","journal-title":"Data Science and Pattern Recognition"},{"key":"e_1_3_2_17_2","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/978-3-642-53917-6_9","volume-title":"Proceedings of the International Conference on Advanced Data Mining and Applications","author":"Fournier-Viger Philippe","year":"2013","unstructured":"Philippe Fournier-Viger, Esp\u00e9rance Mwamikazi, Ted Gueniche, and Usef Faghihi. 2013. MEIT: Memory efficient itemset tree for targeted association rule mining. In Proceedings of the International Conference on Advanced Data Mining and Applications. Springer, 95\u2013106."},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2019.2942594"},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/3314107"},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-012-0394-4"},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-006-0059-1"},{"key":"e_1_3_2_22_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_23_2","doi-asserted-by":"publisher","DOI":"10.1145\/3639827"},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2021.107946"},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2003.1245290"},{"key":"e_1_3_2_26_2","first-page":"1143","volume-title":"Proceedings of the IEEE International Conference on Big Data","author":"Lewis Jay","year":"2019","unstructured":"Jay Lewis, Ryan G. Benton, David Bourrie, and Jennifer Lavergne. 2019. Enhancing itemset tree rules and performance. In Proceedings of the IEEE International Conference on Big Data. IEEE, 1143\u20131150."},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1145\/2133360.2133362"},{"key":"e_1_3_2_28_2","first-page":"9861","article-title":"NetNMSP: Nonoverlapping maximal sequential pattern mining","author":"Li Yan","year":"2022","unstructured":"Yan Li, Shuai Zhang, Lei Guo, Jing Liu, Youxi Wu, and Xindong Wu. 2022. NetNMSP: Nonoverlapping maximal sequential pattern mining. Applied Intelligence 52 (2022), 9861\u20139884.","journal-title":"Applied Intelligence"},{"key":"e_1_3_2_29_2","first-page":"123","article-title":"The role of methylation in the CpG island of the ARHI promoter region in cancers","author":"Liu Xiaozhuan","year":"2020","unstructured":"Xiaozhuan Liu, Tingting Zhang, Yanjun Li, Yuwei Zhang, Hui Zhang, Xiangdong Wang, and Li Li. 2020. The role of methylation in the CpG island of the ARHI promoter region in cancers. Single-cell Sequencing and Methylation 1255 (2020), 123\u2013132.","journal-title":"Single-cell Sequencing and Methylation"},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.1109\/TAI.2022.3171530"},{"key":"e_1_3_2_31_2","first-page":"316","volume-title":"Proceedings of the International Symposium on Methodologies for Intelligent Systems","author":"Salvemini Eliana","year":"2011","unstructured":"Eliana Salvemini, Fabio Fumarola, Donato Malerba, and Jiawei Han. 2011. Fast sequence mining based on sparse id-lists. In Proceedings of the International Symposium on Methodologies for Intelligent Systems. Springer, 316\u2013325."},{"key":"e_1_3_2_32_2","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0014140"},{"key":"e_1_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-017-2720-6"},{"key":"e_1_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2017.02.049"},{"key":"e_1_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-018-1161-6"},{"issue":"5","key":"e_1_3_2_36_2","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1016\/j.compbiomed.2013.02.006","article-title":"PMBC: Pattern mining from biological sequences with wildcard constraints","volume":"43","author":"Wu Xindong","year":"2013","unstructured":"Xindong Wu, Xingquan Zhu, Yu He, and Abdullah N. Arslan. 2013. PMBC: Pattern mining from biological sequences with wildcard constraints. Computers in Biology and Medicine 43, 5 (2013), 481\u2013492.","journal-title":"Computers in Biology and Medicine"},{"key":"e_1_3_2_37_2","doi-asserted-by":"publisher","DOI":"10.1145\/3480245"},{"key":"e_1_3_2_38_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2017.2750691"},{"key":"e_1_3_2_39_2","first-page":"109","volume-title":"Proceedings of the IEEE International Conference on Information Reuse and Integration","author":"Wu Youxi","year":"2010","unstructured":"Youxi Wu, Xindong Wu, Fan Min, and Yan Li. 2010. A nettree for pattern matching with flexible wildcard constraints. In Proceedings of the IEEE International Conference on Information Reuse and Integration. IEEE, 109\u2013114."},{"key":"e_1_3_2_40_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2020.105812"},{"key":"e_1_3_2_41_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2016.10.011"},{"key":"e_1_3_2_42_2","first-page":"1020","volume-title":"Proceedings of the International Conference on Database Systems for Advanced Applications","author":"Yang Zhenglu","year":"2007","unstructured":"Zhenglu Yang, Yitong Wang, and Masaru Kitsuregawa. 2007. LAPIN: Effective sequential pattern mining algorithms by last position induction for dense databases. In Proceedings of the International Conference on Database Systems for Advanced Applications. Springer, 1020\u20131023."},{"key":"e_1_3_2_43_2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007652502315"},{"key":"e_1_3_2_44_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2021.04.035"},{"key":"e_1_3_2_45_2","first-page":"503","volume-title":"Proceedings of the IEEE 29th International Conference on Parallel and Distributed Systems","author":"Zheng Yanxin","year":"2023","unstructured":"Yanxin Zheng, Wensheng Gan, Zefeng Chen, Pinlyu Zhou, and Xiangxiao Diao. 2023. Fast RFM analysis in sequence data. In Proceedings of the IEEE 29th International Conference on Parallel and Distributed Systems. IEEE, 503\u2013510."},{"key":"e_1_3_2_46_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.211"}],"container-title":["ACM Transactions on Management Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3731250","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,14]],"date-time":"2025-11-14T13:07:48Z","timestamp":1763125668000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3731250"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,14]]},"references-count":45,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,12,31]]}},"alternative-id":["10.1145\/3731250"],"URL":"https:\/\/doi.org\/10.1145\/3731250","relation":{},"ISSN":["2158-656X","2158-6578"],"issn-type":[{"value":"2158-656X","type":"print"},{"value":"2158-6578","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,14]]},"assertion":[{"value":"2023-04-02","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-04-08","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-11-14","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}