{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T15:27:07Z","timestamp":1772206027034,"version":"3.50.1"},"reference-count":70,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2022,2,4]],"date-time":"2022-02-04T00:00:00Z","timestamp":1643932800000},"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":["61976240, 52077056, 917446209"],"award-info":[{"award-number":["61976240, 52077056, 917446209"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"National Key Research and Development Program of China","award":["2016YFB1000901"],"award-info":[{"award-number":["2016YFB1000901"]}]},{"name":"Natural Science Foundation of Hebei Province, China","award":["F2020202013 and E2020202033"],"award-info":[{"award-number":["F2020202013 and E2020202033"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Manage. Inf. Syst."],"published-print":{"date-parts":[[2022,9,30]]},"abstract":"<jats:p>Gap constraint sequential pattern mining (SPM), as a kind of repetitive SPM, can avoid mining too many useless patterns. However, this method is difficult for users to set a suitable gap without prior knowledge and each character is considered to have the same effects. To tackle these issues, this article addresses a self-adaptive One-off Weak-gap Strong Pattern (OWSP) mining, which has three characteristics. First, it determines the gap constraint adaptively according to the sequence. Second, all characters are divided into two groups: strong and weak characters, and the pattern is composed of strong characters, while weak characters are allowed in the gaps. Third, each character can be used at most once in the process of support (the frequency of pattern) calculation. To handle this problem, this article presents OWSP-Miner, which equips with two key steps: support calculation and candidate pattern generation. A reverse-order filling strategy is employed to calculate the support of a candidate pattern, which reduces the time complexity. OWSP-Miner generates candidate patterns using pattern join strategy, which effectively reduces the candidate patterns. For clarification, time series is employed in the experiments and the results show that OWSP-Miner is not only more efficient but also is easier to mine valuable patterns. In the experiment of stock application, we also employ OWSP-Miner to mine OWSPs and the results show that OWSPs mining is more meaningful in real life. The algorithms and data can be downloaded at https:\/\/github.com\/wuc567\/Pattern-Mining\/tree\/master\/OWSP-Miner.<\/jats:p>","DOI":"10.1145\/3476247","type":"journal-article","created":{"date-parts":[[2022,2,4]],"date-time":"2022-02-04T10:48:53Z","timestamp":1643971733000},"page":"1-23","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":24,"title":["OWSP-Miner: Self-adaptive One-off Weak-gap Strong Pattern Mining"],"prefix":"10.1145","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5314-3468","authenticated-orcid":false,"given":"Youxi","family":"Wu","sequence":"first","affiliation":[{"name":"School of Artificial Intelligence, Hebei University of Technology, China and Hebei Key Laboratory of Big Data Computing, Tianjin, China"}]},{"given":"Xiaohui","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Artificial Intelligence, Hebei University of Technology, Tianjin, China"}]},{"given":"Yan","family":"Li","sequence":"additional","affiliation":[{"name":"School of Economics and Management, Hebei University of Technology, Tianjin, China"}]},{"given":"Lei","family":"Guo","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Reliability and Intelligence of Electrical Equipment, Hebei University of Technology, Tianjin, China"}]},{"given":"Zhao","family":"Li","sequence":"additional","affiliation":[{"name":"Alibaba Group, Zhejiang, China"}]},{"given":"Ji","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Sciences, The University of Southern Queensland, Toowoomba, Australia"}]},{"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 (Hefei University of Technology), Ministry of Education, China and Mininglamp Technology, Beijing, China"}]}],"member":"320","published-online":{"date-parts":[[2022,2,4]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.5555\/2627435.2750353"},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/3439771"},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-014-0398-2"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/3399671"},{"key":"e_1_3_2_6_2","volume-title":"IEEE Trans. Cybernet.","author":"Wu Youxi","year":"2021","unstructured":"Youxi Wu, Yuehua Wang, Yan Li, Xingquan Zhu, and Xindong Wu. 2021. Top-k self-adaptive contrast sequential pattern mining. IEEE Trans. Cybernet.DOI:10.1109\/TCYB.2021.3082114"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2019.105241"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/3041218"},{"issue":"5","key":"e_1_3_2_9_2","article-title":"Evolutionary algorithm for optimization of energy consumption at GCC compile time based on frequent pattern mining.","volume":"30","author":"Ni Youcong","year":"2019","unstructured":"Youcong Ni, Rui Wu, Xin Du, Peng Ye, Wangbiao Li, and Ruliang Xiao. 2019. Evolutionary algorithm for optimization of energy consumption at GCC compile time based on frequent pattern mining. J. Softw. 30, 5 (2019), 1269\u20131287.","journal-title":"J. Softw."},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.compbiomed.2013.02.006"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2013.109"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1109\/TR.2018.2873427"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1145\/3106164"},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2019.112950"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783306"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2018.2869907"},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2018.2886199"},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1007\/s41019-019-0094-8"},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2759110"},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2020.09.044"},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2019.05.010"},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2016.12.023"},{"key":"e_1_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-62416-7_11"},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2017.12.029"},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-020-01743-y"},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-019-01385-8"},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2017.2750691"},{"key":"e_1_3_2_28_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-020-01778-1"},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1177\/0165551515603286"},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2019.07.018"},{"key":"e_1_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-019-01333-6"},{"key":"e_1_3_2_32_2","doi-asserted-by":"publisher","DOI":"10.1145\/3386250"},{"key":"e_1_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-013-0443-7"},{"key":"e_1_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.3233\/IDA-163231"},{"key":"e_1_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2019.03.022"},{"key":"e_1_3_2_36_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2016.09.013"},{"key":"e_1_3_2_37_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.04.013"},{"key":"e_1_3_2_38_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2016.2593953"},{"key":"e_1_3_2_39_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.115449"},{"key":"e_1_3_2_40_2","doi-asserted-by":"publisher","DOI":"10.3233\/IDA-173435"},{"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","doi-asserted-by":"publisher","DOI":"10.1002\/sam.11192"},{"key":"e_1_3_2_43_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-014-0612-3"},{"issue":"1","key":"e_1_3_2_44_2","article-title":"Strict pattern matching under non-overlapping condition.","volume":"60","author":"Wu Youxi","year":"2017","unstructured":"Youxi Wu, Cong Shen, He Jiang, and Xindong Wu. 2017. Strict pattern matching under non-overlapping condition. Sci. China Info. Sci. 60, 1 (2017), 012101.","journal-title":"Sci. China Info. Sci."},{"key":"e_1_3_2_45_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2003.1209017"},{"key":"e_1_3_2_46_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2014.06.018"},{"key":"e_1_3_2_47_2","doi-asserted-by":"publisher","DOI":"10.1145\/2396761.2396773"},{"key":"e_1_3_2_48_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2019.2896267"},{"key":"e_1_3_2_49_2","article-title":"ProUM: Projection-based utility mining on sequence data.","author":"Gan Wensheng","year":"2019","unstructured":"Wensheng Gan, Jerry Chun-Wei Lin, Jiexiong Zhang, Han-Chieh Chao, Hamido Fujita, and Philip S. Yu. 2019. ProUM: Projection-based utility mining on sequence data. Info. Sci. 513 (2019), 222\u2013240.","journal-title":"Info. Sci."},{"key":"e_1_3_2_50_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2019.112967"},{"issue":"3","key":"e_1_3_2_51_2","article-title":"Stock Trend prediction by using K-Means and AprioriAll algorithm for sequential chart pattern mining.","volume":"30","author":"Wu Kuoping","year":"2014","unstructured":"Kuoping Wu, Yungpiao Wu, and Hahn-Ming Lee. 2014. Stock Trend prediction by using K-Means and AprioriAll algorithm for sequential chart pattern mining. J. Info. Sci. Eng. 30, 3 (2014), 669\u2013686.","journal-title":"J. Info. Sci. Eng."},{"key":"e_1_3_2_52_2","doi-asserted-by":"publisher","DOI":"10.1109\/DSC.2016.49"},{"issue":"7","key":"e_1_3_2_53_2","article-title":"On approximate pattern matching with thresholds.","volume":"123","author":"Zhang Peng","year":"2017","unstructured":"Peng Zhang and Mikhail J. Atallah. 2017. On approximate pattern matching with thresholds. Info. Process. Lett. 123, 7 (2017), 21\u201326.","journal-title":"Info. Process. Lett."},{"key":"e_1_3_2_54_2","doi-asserted-by":"publisher","DOI":"10.5555\/3225638.3225800"},{"key":"e_1_3_2_55_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2007.03.018"},{"key":"e_1_3_2_56_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-014-0630-1"},{"key":"e_1_3_2_57_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-39937-9_7"},{"issue":"3","key":"e_1_3_2_58_2","article-title":"Mining distinguishing subsequence patterns with nonoverlapping condition.","volume":"22","author":"Wu Youxi","year":"2019","unstructured":"Youxi Wu, Yuehua Wang, Jingyu Liu, Ming Yu, Jing Liu, and Yan Li. 2019. Mining distinguishing subsequence patterns with nonoverlapping condition. Cluster Comput. 22, 3 (2019), 5905\u20135917.","journal-title":"Cluster Comput."},{"key":"e_1_3_2_59_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-55699-4_15"},{"key":"e_1_3_2_60_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2017.11.005"},{"key":"e_1_3_2_61_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2009.06.064"},{"key":"e_1_3_2_62_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2020.105812"},{"key":"e_1_3_2_63_2","doi-asserted-by":"publisher","DOI":"10.1145\/2133360.2133362"},{"key":"e_1_3_2_64_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-013-0499-4"},{"key":"e_1_3_2_65_2","doi-asserted-by":"publisher","DOI":"10.5555\/1625275.1625748"},{"key":"e_1_3_2_66_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-019-01616-z"},{"key":"e_1_3_2_67_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.104"},{"key":"e_1_3_2_68_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-012-0394-4"},{"key":"e_1_3_2_69_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-006-0016-8"},{"issue":"11","key":"e_1_3_2_70_2","article-title":"Efficient algorithm for solving strict pattern matching under nonoverlapping condition.","volume":"32","author":"Wu Youxi","year":"2021","unstructured":"Youxi Wu, Xi Liu, Wenjie Yan, Lei Guo, and Xindong Wu. 2021. Efficient algorithm for solving strict pattern matching under nonoverlapping condition. J. Softw. 32, 11 (2021), 3331\u20133350.","journal-title":"J. Softw."},{"key":"e_1_3_2_71_2","doi-asserted-by":"publisher","DOI":"10.1109\/HICSS.2014.231"}],"container-title":["ACM Transactions on Management Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3476247","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3476247","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T17:49:16Z","timestamp":1750268956000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3476247"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,4]]},"references-count":70,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,9,30]]}},"alternative-id":["10.1145\/3476247"],"URL":"https:\/\/doi.org\/10.1145\/3476247","relation":{},"ISSN":["2158-656X","2158-6578"],"issn-type":[{"value":"2158-656X","type":"print"},{"value":"2158-6578","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,2,4]]},"assertion":[{"value":"2020-11-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-07-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-02-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}