{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T17:10:01Z","timestamp":1784308201805,"version":"3.55.0"},"reference-count":45,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100021171","name":"Basic and Applied Basic Research Foundation of Guangdong Province","doi-asserted-by":"publisher","award":["2024A04J9971"],"award-info":[{"award-number":["2024A04J9971"]}],"id":[{"id":"10.13039\/501100021171","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62237001"],"award-info":[{"award-number":["62237001"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62272196"],"award-info":[{"award-number":["62272196"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Sciences"],"published-print":{"date-parts":[[2026,11]]},"DOI":"10.1016\/j.ins.2026.123770","type":"journal-article","created":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T15:58:50Z","timestamp":1781107130000},"page":"123770","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Targeted mining of non-overlapping high-utility sequential patterns"],"prefix":"10.1016","volume":"755","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-7124-9101","authenticated-orcid":false,"given":"Lingfeng","family":"Wang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5781-8116","authenticated-orcid":false,"given":"Wensheng","family":"Gan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-3253-3228","authenticated-orcid":false,"given":"Zhidong","family":"Lin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-7484-9124","authenticated-orcid":false,"given":"Zhenlian","family":"Qi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2551-2024","authenticated-orcid":false,"given":"Jian","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8972-167X","authenticated-orcid":false,"given":"Ruichu","family":"Cai","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9731-1504","authenticated-orcid":false,"given":"Zhifeng","family":"Hao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.ins.2026.123770_bib0005","series-title":"The Eleventh International Conference on Data Engineering","first-page":"3","article-title":"Mining sequential patterns","author":"Agrawal","year":"1995"},{"key":"10.1016\/j.ins.2026.123770_bib0010","series-title":"ACM SIGMOD International Conference on Management of Data","first-page":"207","article-title":"Mining association rules between sets of items in large databases","author":"Agrawal","year":"1993"},{"key":"10.1016\/j.ins.2026.123770_bib0015","series-title":"The Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","first-page":"429","article-title":"Sequential pattern mining using a bitmap representation","author":"Ayres","year":"2002"},{"key":"10.1016\/j.ins.2026.123770_bib0020","doi-asserted-by":"crossref","first-page":"1424","DOI":"10.1109\/TKDE.2004.77","article-title":"Mining sequential patterns by pattern-growth: the prefixspan approach","volume":"16","author":"Pei","year":"2004","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/j.ins.2026.123770_bib0025","doi-asserted-by":"crossref","first-page":"1683","DOI":"10.1007\/s41060-024-00659-x","article-title":"Sequential pattern mining algorithms and their applications: a technical review","volume":"20","author":"Mazumdar","year":"2024","journal-title":"Int. J. Data Sci. Anal."},{"key":"10.1016\/j.ins.2026.123770_bib0030","doi-asserted-by":"crossref","DOI":"10.1016\/j.ipm.2025.104077","article-title":"TK-RNSP: efficient top-K repetitive negative sequential pattern mining","volume":"62","author":"Lan","year":"2025","journal-title":"Inf. Process. Manag."},{"key":"10.1016\/j.ins.2026.123770_bib0035","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1023\/A:1009748302351","article-title":"Discovery of frequent episodes in event sequences","volume":"1","author":"Mannila","year":"1997","journal-title":"Data Min. Knowl. Discov."},{"key":"10.1016\/j.ins.2026.123770_bib0040","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1023\/A:1007652502315","article-title":"SPADE: an efficient algorithm for mining frequent sequences","volume":"42","author":"Zaki","year":"2001","journal-title":"Mach. Learn."},{"key":"10.1016\/j.ins.2026.123770_bib0045","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2024.111796","article-title":"Mining interesting sequential patterns using a novel balanced utility measure","volume":"294","author":"Duong","year":"2024","journal-title":"Knowl.-based Syst."},{"key":"10.1016\/j.ins.2026.123770_bib0050","doi-asserted-by":"crossref","DOI":"10.1016\/j.ipm.2025.104402","article-title":"HU-RNSP: efficiently mining high-utility repeated negative sequential patterns","volume":"63","author":"Xiao","year":"2026","journal-title":"Inf. Process. Manag."},{"key":"10.1016\/j.ins.2026.123770_bib0055","series-title":"The 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","first-page":"660","article-title":"USpan: an efficient algorithm for mining high utility sequential patterns","author":"Yin","year":"2012"},{"key":"10.1016\/j.ins.2026.123770_bib0060","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2021.107361","article-title":"HANP-miner: high average utility nonoverlapping sequential pattern mining","volume":"229","author":"Wu","year":"2021","journal-title":"Knowl.-based Syst."},{"key":"10.1016\/j.ins.2026.123770_bib0065","doi-asserted-by":"crossref","DOI":"10.1016\/j.ipm.2026.104682","article-title":"MNSPM: merging-based nonoverlapping gap-constrained sequential pattern mining","volume":"63","author":"Zhang","year":"2026","journal-title":"Inf. Process. Manag."},{"key":"10.1016\/j.ins.2026.123770_bib0070","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1007\/s10115-015-0914-8","article-title":"On efficiently mining high utility sequential patterns","volume":"49","author":"Wang","year":"2016","journal-title":"Knowl. Inf. Syst."},{"key":"10.1016\/j.ins.2026.123770_bib0075","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","year":"2022","journal-title":"IEEE Trans. Big Data"},{"key":"10.1016\/j.ins.2026.123770_bib0080","first-page":"1","article-title":"TaSPM: targeted sequential pattern mining","volume":"18","author":"Huang","year":"2024","journal-title":"ACM Trans. Knowl. Discov. Data"},{"key":"10.1016\/j.ins.2026.123770_bib0085","series-title":"2010 IEEE International Conference on Information Reuse & Integration","first-page":"109","article-title":"A nettree for pattern matching with flexible wildcard constraints","author":"Wu","year":"2010"},{"key":"10.1016\/j.ins.2026.123770_bib0090","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1109\/TKDE.2018.2881675","article-title":"Sequence pattern mining with variables","volume":"32","author":"Okolica","year":"2020","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/j.ins.2026.123770_bib0095","series-title":"The 17th International Conference on Data Engineering","first-page":"215","article-title":"PrefixSpan: mining sequential patterns efficiently by prefix-projected pattern growth","author":"Han","year":"2001"},{"key":"10.1016\/j.ins.2026.123770_bib0100","series-title":"International Conference on Extending Database Technology","first-page":"1","article-title":"Mining sequential patterns: generalizations and performance improvements","author":"Srikant","year":"1996"},{"key":"10.1016\/j.ins.2026.123770_bib0105","series-title":"The Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","first-page":"355","article-title":"FreeSpan: frequent pattern-projected sequential pattern mining","author":"Han","year":"2000"},{"key":"10.1016\/j.ins.2026.123770_bib0110","doi-asserted-by":"crossref","first-page":"2597","DOI":"10.1109\/TVCG.2018.2848247","article-title":"Exploratory visual sequence mining based on pattern-growth","volume":"25","author":"Vrotsou","year":"2019","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"10.1016\/j.ins.2026.123770_bib0115","series-title":"Proceedings. 20th International Conference on Data Engineering","first-page":"79","article-title":"BIDE: efficient mining of frequent closed sequences","author":"Wang","year":"2004"},{"key":"10.1016\/j.ins.2026.123770_bib0120","series-title":"The 2003 SIAM International Conference on Data Mining","first-page":"166","article-title":"CloSpan: mining: closed sequential patterns in large datasets","author":"Yan","year":"2003"},{"key":"10.1016\/j.ins.2026.123770_bib0125","series-title":"2005 International Conference on Neural Networks and Brain","first-page":"525","article-title":"Mining maximal sequential patterns","volume":"vol. 1","author":"Guan","year":"2005"},{"key":"10.1016\/j.ins.2026.123770_bib0130","series-title":"International Conference on Advanced Data Mining and Applications","first-page":"109","article-title":"TKS: efficient mining of top-k sequential patterns","author":"Fournier-Viger","year":"2013"},{"key":"10.1016\/j.ins.2026.123770_bib0135","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1007\/s10115-004-0175-4","article-title":"TSP: mining top-k closed sequential patterns","volume":"7","author":"Tzvetkov","year":"2005","journal-title":"Knowl. Inf. Syst."},{"key":"10.1016\/j.ins.2026.123770_bib0140","series-title":"IEEE 25th International Conference on Data Engineering","first-page":"1024","article-title":"Efficient mining of closed repetitive gapped subsequences from a sequence database","author":"Ding","year":"2009"},{"key":"10.1016\/j.ins.2026.123770_bib0145","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2025.126536","article-title":"HUPSP-LAL: efficiently mining utility-driven sequential patterns in uncertain sequences","volume":"270","author":"Li","year":"2025","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.ins.2026.123770_bib0150","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1016\/j.ins.2019.10.033","article-title":"ProUM: projection-based utility mining on sequence data","volume":"513","author":"Gan","year":"2020","journal-title":"Inf. Sci."},{"key":"10.1016\/j.ins.2026.123770_bib0155","doi-asserted-by":"crossref","DOI":"10.1016\/j.ins.2023.118945","article-title":"Mining high-utility sequences with positive and negative values","volume":"637","author":"Zhang","year":"2023","journal-title":"Inf. Sci."},{"key":"10.1016\/j.ins.2026.123770_bib0160","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3446938","article-title":"Utility mining across multi-dimensional sequences","volume":"15","author":"Gan","year":"2021","journal-title":"ACM Trans. Knowl. Discov. Data"},{"key":"10.1016\/j.ins.2026.123770_bib0165","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3362070","article-title":"Utility mining across multi-sequences with individualized thresholds","volume":"1","author":"Gan","year":"2020","journal-title":"ACM\/IMS Trans. Data Sci."},{"key":"10.1016\/j.ins.2026.123770_bib0170","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/s11227-024-06568-x","article-title":"High-utility sequential pattern mining in incremental database","volume":"81","author":"Yan","year":"2025","journal-title":"J. Supercomput."},{"key":"10.1016\/j.ins.2026.123770_bib0175","series-title":"International Conference on Advanced Data Mining and Applications","first-page":"95","article-title":"MEIT: memory efficient itemset tree for targeted association rule mining","author":"Fournier-Viger","year":"2013"},{"key":"10.1016\/j.ins.2026.123770_bib0180","series-title":"IEEE International Conference on Big Data","first-page":"1143","article-title":"Enhancing itemset tree rules and performance","author":"Lewis","year":"2019"},{"key":"10.1016\/j.ins.2026.123770_bib0185","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2025.114803","article-title":"CoTP-Miner: co-occurrence three-way sequential pattern mining","volume":"332","author":"Li","year":"2026","journal-title":"Knowl.-based Syst."},{"key":"10.1016\/j.ins.2026.123770_bib0190","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/S0957-4174(03)00073-3","article-title":"Goal-oriented sequential pattern for network banking churn analysis","volume":"25","author":"Chiang","year":"2003","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.ins.2026.123770_bib0195","doi-asserted-by":"crossref","first-page":"16619","DOI":"10.1109\/TNNLS.2025.3565548","article-title":"Toward targeted mining of RFM patterns","volume":"36","author":"Chen","year":"2025","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"10.1016\/j.ins.2026.123770_bib0200","doi-asserted-by":"crossref","first-page":"904","DOI":"10.1109\/TETCI.2024.3424492","article-title":"Targeted mining precise-positioning episode rules","volume":"9","author":"Zhu","year":"2025","journal-title":"IEEE Trans. Emerg. Top. Comput. Intell."},{"key":"10.1016\/j.ins.2026.123770_bib0205","doi-asserted-by":"crossref","DOI":"10.1145\/3731250","article-title":"TALENT: targeted mining of non-overlapping sequential patterns","volume":"16","author":"Chen","year":"2025","journal-title":"ACM Trans. Manag. Inf. Syst."},{"key":"10.1016\/j.ins.2026.123770_bib0210","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/s10115-006-0016-8","article-title":"Efficient string matching with wildcards and length constraints","volume":"10","author":"Chen","year":"2006","journal-title":"Knowl. Inf. Syst."},{"key":"10.1016\/j.ins.2026.123770_bib0215","doi-asserted-by":"crossref","first-page":"2809","DOI":"10.1109\/TCYB.2017.2750691","article-title":"NOSEP: nonoverlapping sequence pattern mining with gap constraints","volume":"48","author":"Wu","year":"2017","journal-title":"IEEE Trans. Cybern."},{"key":"10.1016\/j.ins.2026.123770_bib0220","first-page":"3389","article-title":"SPMF: a Java open-source pattern mining library","volume":"15","author":"Fournier-Viger","year":"2014","journal-title":"J. Mach. Learn. Res."},{"key":"10.1016\/j.ins.2026.123770_bib0225","doi-asserted-by":"crossref","first-page":"5420","DOI":"10.1109\/TKDE.2025.3579746","article-title":"Mining cross-level high utility itemsets in unstable and negative profit databases","volume":"37","author":"Tung","year":"2025","journal-title":"IEEE Trans. Knowl. Data Eng."}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025526007012?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025526007012?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T17:01:09Z","timestamp":1784307669000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020025526007012"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,11]]},"references-count":45,"alternative-id":["S0020025526007012"],"URL":"https:\/\/doi.org\/10.1016\/j.ins.2026.123770","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[2026,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Targeted mining of non-overlapping high-utility sequential patterns","name":"articletitle","label":"Article Title"},{"value":"Information Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ins.2026.123770","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Inc. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"123770"}}