{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,30]],"date-time":"2026-03-30T18:18:25Z","timestamp":1774894705525,"version":"3.50.1"},"reference-count":70,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2021,9,14]],"date-time":"2021-09-14T00:00:00Z","timestamp":1631577600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,9,14]],"date-time":"2021-09-14T00:00:00Z","timestamp":1631577600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2022,4]]},"DOI":"10.1007\/s10489-021-02763-y","type":"journal-article","created":{"date-parts":[[2021,9,14]],"date-time":"2021-09-14T07:02:51Z","timestamp":1631602971000},"page":"6646-6661","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["Self-adaptive nonoverlapping sequential pattern mining"],"prefix":"10.1007","volume":"52","author":[{"given":"Yuehua","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5314-3468","authenticated-orcid":false,"given":"Youxi","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yan","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fang","family":"Yao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philippe","family":"Fournier-Viger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xindong","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,14]]},"reference":[{"issue":"1","key":"2763_CR1","first-page":"3389","volume":"15","author":"P Fournier-Viger","year":"2014","unstructured":"Fournier-Viger P, Gomariz A, Gueniche T, Soltani A, Wu C-W, Tseng VS (2014) SPMF: A java open-source pattern mining library. J Mach Learn Res 15(1):3389\u20133393","journal-title":"J Mach Learn Res"},{"key":"2763_CR2","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.future.2020.04.027","volume":"111","author":"J Kim","year":"2020","unstructured":"Kim J, Yun U, Yoon E, Lin JC-W, Fournier-Viger P (2020) One scan based high average-utility pattern mining in static and dynamic databases. Futur Gener Comput Syst 111:143\u2013158","journal-title":"Futur Gener Comput Syst"},{"issue":"1","key":"2763_CR3","first-page":"54","volume":"1","author":"P Fournier-Viger","year":"2017","unstructured":"Fournier-Viger P, Lin JC-W, Kiran RU, Koh YS, Thomas R (2017) A survey of sequential pattern mining. Data Sci Pattern Recogn 1(1):54\u201377","journal-title":"Data Sci Pattern Recogn"},{"issue":"1","key":"2763_CR4","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1023\/B:DAMI.0000005258.31418.83","volume":"8","author":"J Han","year":"2004","unstructured":"Han J, Pei J, Yin Y, Mao R (2004) Mining frequent patterns without candidate generation. Data Min Knowl Discov 8(1):53\u201387","journal-title":"Data Min Knowl Discov"},{"issue":"1","key":"2763_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10115-018-1282-y","volume":"58","author":"M Wu","year":"2019","unstructured":"Wu M, Wu X (2019) On big wisdom. Knowl Inf Syst 58(1):1\u20138","journal-title":"Knowl Inf Syst"},{"key":"2763_CR6","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.knosys.2016.10.011","volume":"115","author":"F Xie","year":"2017","unstructured":"Xie F, Wu X, Zhu X (2017) Efficient sequential pattern mining with wildcards for keyphrase extraction. Knowl Based Syst 115:27\u201339","journal-title":"Knowl Based Syst"},{"key":"2763_CR7","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.ins.2019.04.050","volume":"494","author":"U Yun","year":"2019","unstructured":"Yun U, Lee G, Yoon E (2019) Advanced approach of sliding window based erasable pattern mining with list structure of industrial fields. Inf Sci 494:37\u201359","journal-title":"Inf Sci"},{"issue":"11","key":"2763_CR8","doi-asserted-by":"publisher","first-page":"3788","DOI":"10.1007\/s10489-020-01743-y","volume":"50","author":"JC-W Lin","year":"2020","unstructured":"Lin JC-W, Pirouz M, Djenouri Y, Cheng C-F, Ahmed U (2020) Incrementally updating the high average-utility patterns with pre-large concept. Appl Intell 50(11):3788\u20133807","journal-title":"Appl Intell"},{"key":"2763_CR9","doi-asserted-by":"crossref","unstructured":"Lin JC-W, Shao Y, Djenouri Y, Yun U (2021) ASRNN: A recurrent neural network with an attention model for sequence labeling. Knowl Based Syst 212(5):106548","DOI":"10.1016\/j.knosys.2020.106548"},{"key":"2763_CR10","doi-asserted-by":"publisher","unstructured":"Srivastava G, Lin J C -W, Pirouz M, Li Y, Yu U (2020) A pre-large weighted-fusion system of sensed high-utility patterns. IEEE Sensors Journal. https:\/\/doi.org\/10.1109\/JSEN.2020.2991045","DOI":"10.1109\/JSEN.2020.2991045"},{"key":"2763_CR11","first-page":"3","volume":"1995","author":"R Srikant","year":"1995","unstructured":"Srikant R, Agrawal R (1995) Mining sequential patterns. Proc 11th Int Conf Data Eng 1995:3\u201314","journal-title":"Proc 11th Int Conf Data Eng"},{"key":"2763_CR12","doi-asserted-by":"crossref","unstructured":"Truong T, Duong H, Le B, Fournier-Viger P, Yun U (2019) Efficient high average-utility itemset mining using novel vertical weak upper-bounds. Knowl Based Syst 183(1):104847","DOI":"10.1016\/j.knosys.2019.07.018"},{"key":"2763_CR13","doi-asserted-by":"publisher","first-page":"5905","DOI":"10.1007\/s10586-017-1671-0","volume":"22","author":"Y Wu","year":"2019","unstructured":"Wu Y, Wang Y, Liu J, Yu M, Liu J, Li Y (2019) Mining distinguishing subsequence patterns with nonoverlapping condition. Clust Comput 22:5905\u20135917","journal-title":"Clust Comput"},{"key":"2763_CR14","doi-asserted-by":"crossref","unstructured":"Wu Y, Zhu C, Li Y, Guo L, Wu X (2020) NetNCSP: Nonoverlapping closed sequential pattern mining. Knowl Based Syst 196(105812)","DOI":"10.1016\/j.knosys.2020.105812"},{"key":"2763_CR15","first-page":"194","volume":"2005","author":"X Ji","year":"2005","unstructured":"Ji X, Bailey J, Dong G (2005) Mining minimal distinguishing subsequence patterns with gap constraints. Proc 5th IEEE Int Conf Data Min (ICDM) 2005:194\u2013201","journal-title":"Proc 5th IEEE Int Conf Data Min (ICDM)"},{"issue":"3","key":"2763_CR16","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1007\/s10489-014-0612-3","volume":"42","author":"Y Wu","year":"2015","unstructured":"Wu Y, Fu S, Jiang H, Wu X (2015) Strict approximate pattern matching with general gaps. Appl Intell 42(3):566\u2013580","journal-title":"Appl Intell"},{"key":"2763_CR17","doi-asserted-by":"crossref","unstructured":"Dong X, Gong Y, Cao L (2020) e-RNSP: An efficient method for mining repetition negative sequential patterns. IEEE Trans Cybern 50(5):2084\u20132096","DOI":"10.1109\/TCYB.2018.2869907"},{"issue":"9","key":"2763_CR18","doi-asserted-by":"publisher","first-page":"2764","DOI":"10.1109\/TNNLS.2018.2886199","volume":"30","author":"X Dong","year":"2019","unstructured":"Dong X, Qiu P, L\u00fc J, Cao L (2019) Mining top-k useful negative sequential patterns via learning. IEEE Trans Neural Netw Learn Syst 30(9):2764\u20132778","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"2763_CR19","doi-asserted-by":"crossref","unstructured":"Wu Y, Shen C, Jiang H, Wu X (2017) Strict pattern matching under non-overlapping condition. Sci China Inf Sci 60(1):012101","DOI":"10.1007\/s11432-015-0935-3"},{"key":"2763_CR20","doi-asserted-by":"crossref","unstructured":"Gan W, Lin JC-W, Fournier-Viger P, Chao H-C, Yu PS (2019) A survey of parallel sequential pattern mining. ACM Trans Knowl Discov Data 13(3):25:1\u201325, 34","DOI":"10.1145\/3314107"},{"key":"2763_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ins.2020.03.030","volume":"529","author":"H Nam","year":"2020","unstructured":"Nam H, Yun U, Yoon E, Lin J C -W (2020) Efficient approach of recent high utility stream pattern mining with indexed list structure and pruning strategy considering arrival times of transactions. Inf Sci 529:1\u201327","journal-title":"Inf Sci"},{"key":"2763_CR22","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.future.2020.03.039","volume":"109","author":"Z Lv","year":"2020","unstructured":"Lv Z, Qiao L (2020) Analysis of healthcare big data. Futur Gener Comput Syst 109:103\u2013110","journal-title":"Futur Gener Comput Syst"},{"issue":"4","key":"2763_CR23","doi-asserted-by":"publisher","first-page":"1306","DOI":"10.1109\/TKDE.2019.2942594","volume":"33","author":"W Gan","year":"2021","unstructured":"Gan W, Lin JC-W, Fournier-Viger P, Chao H-C, Tseng VS, Yu PS (2021) A survey of utility-oriented pattern mining. IEEE Trans Knowl Data Eng 33(4):1306\u20131327","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"2","key":"2763_CR24","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1145\/1267066.1267068","volume":"1","author":"M Zhang","year":"2007","unstructured":"Zhang M, Kao B, Cheung DW, Yip KY (2007) Mining periodic patterns with gap requirement from sequences. ACM Trans Knowl Discov Data 1(2):7","journal-title":"ACM Trans Knowl Discov Data"},{"key":"2763_CR25","first-page":"1024","volume":"2009","author":"B Ding","year":"2009","unstructured":"Ding B, Lo D, Han J, Khoo S (2009) Efficient mining of closed repetitive gapped subsequences from a sequence database. IEEE 25th Int Conf Data Eng 2009:1024\u20131035","journal-title":"IEEE 25th Int Conf Data Eng"},{"issue":"10","key":"2763_CR26","doi-asserted-by":"publisher","first-page":"2809","DOI":"10.1109\/TCYB.2017.2750691","volume":"48","author":"Y Wu","year":"2018","unstructured":"Wu Y, Tong Y, Zhu X, Wu X (2018) NOSEP: Nonoverlapping Sequence pattern mining with gap constraints. IEEE Trans Cybern 48(10):2809\u20132822","journal-title":"IEEE Trans Cybern"},{"issue":"6","key":"2763_CR27","doi-asserted-by":"publisher","first-page":"1832","DOI":"10.1007\/s10489-019-01616-z","volume":"50","author":"Q Shi","year":"2020","unstructured":"Shi Q, Shan J, Yan W, Wu Y, Wu X (2020) NetNPG: Nonoverlapping pattern matching with general gap constraints. Appl Intell 50(6):1832\u20131845","journal-title":"Appl Intell"},{"key":"2763_CR28","doi-asserted-by":"publisher","unstructured":"Wu Y, Liu X, Yan W, Guo L, Wu X (2021) Efficient solving algorithm for strict pattern matching under nonoverlapping condition. Journal of Software. https:\/\/doi.org\/10.13328\/j.cnki.jos.006054","DOI":"10.13328\/j.cnki.jos.006054"},{"key":"2763_CR29","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1016\/j.ins.2018.04.013","volume":"507","author":"F Min","year":"2020","unstructured":"Min F, Zhang Z, Zhai W, Shen R (2020) Frequent pattern discovery with tri-partition alphabets. Inf Sci 507:715\u2013732","journal-title":"Inf Sci"},{"issue":"3","key":"2763_CR30","doi-asserted-by":"publisher","first-page":"1331","DOI":"10.1007\/s10115-019-01333-6","volume":"61","author":"J-W Huang","year":"2019","unstructured":"Huang J-W, Jaysawal B, Chen K-Y, Wu Y-B (2019) Mining frequent and top-K high utility time interval-based events with duration patterns. Knowl Inf Syst 61(3):1331\u20131359","journal-title":"Knowl Inf Syst"},{"key":"2763_CR31","first-page":"1490","volume":"2019","author":"A Renz-Wieland","year":"2019","unstructured":"Renz-Wieland A, Bertsch M, Gemull R (2019) Scalable frequent sequence mining with flexible subsequence constraints. IEEE 35th Int Conf Data Eng 2019:1490\u20131501","journal-title":"IEEE 35th Int Conf Data Eng"},{"key":"2763_CR32","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/j.ins.2021.01.060","volume":"568","author":"T Truong","year":"2021","unstructured":"Truong T, Duong H, Le B, Fournier-Viger P, Yun U, Fujita H (2021) Efficient algorithms for mining frequent high utility sequences with constraints. Inf Sci 568:239\u2013264","journal-title":"Inf Sci"},{"issue":"1","key":"2763_CR33","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1109\/TKDE.2018.2881675","volume":"32","author":"J Okolica","year":"2020","unstructured":"Okolica J, Peterson G, Mills R, Grimaila M (2020) Sequence pattern mining with variables. IEEE Trans Knowl Data Eng 32(1):177\u2013187","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"2763_CR34","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/j.ins.2019.03.050","volume":"489","author":"P Fournier-Viger","year":"2019","unstructured":"Fournier-Viger P, Li Z, Lin JC-W, Kiran RU, Fujita H (2019) Efficient algorithms to identify periodic patterns in multiple sequences. Inf Sci 489:205\u2013226","journal-title":"Inf Sci"},{"issue":"5","key":"2763_CR35","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1016\/j.compbiomed.2013.02.006","volume":"43","author":"X Wu","year":"2013","unstructured":"Wu X, Zhu X, He Y, Zhao P, Arslan AN (2013) PMBC: Pattern Mining from biological sequences with wildcard constraints. Comput Biol Med 43(5):481\u2013492","journal-title":"Comput Biol Med"},{"issue":"1","key":"2763_CR36","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1109\/TKDE.2013.109","volume":"26","author":"X Wu","year":"2014","unstructured":"Wu X, Zhu X, Wu GQ, Ding W (2014) Data mining with big data. IEEE Trans Knowl Data Eng 26(1):97\u2013107","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"2763_CR37","doi-asserted-by":"crossref","unstructured":"Fournier-Viger P, Li J, Lin JC-W, Truong T, Kiran RU (2020) Mining cost-effective patterns in event logs. Knowl Based Syst 191(105241)","DOI":"10.1016\/j.knosys.2019.105241"},{"issue":"9","key":"2763_CR38","doi-asserted-by":"publisher","first-page":"2240","DOI":"10.1109\/TPAMI.2019.2908373","volume":"42","author":"K Yu","year":"2020","unstructured":"Yu K, Liu L, Li J, Ding W, Le T (2020) Multi-source causal feature selection. IEEE Trans Pattern Anal Mach Intell 42(9):2240\u20132256","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"2763_CR39","doi-asserted-by":"crossref","unstructured":"Li C, Yang Q, Wang J, Li M (2012) Efficient mining of gap-constrained subsequences and its various applications. ACM Trans Knowl Discov Data (TKDD) 6(1):2:1\u20132:39","DOI":"10.1145\/2133360.2133362"},{"key":"2763_CR40","doi-asserted-by":"publisher","first-page":"23839","DOI":"10.1109\/ACCESS.2018.2827167","volume":"6","author":"T Xu","year":"2018","unstructured":"Xu T, Li T, Dong X (2018) Efficient high utility negative sequential patterns mining in smart campus. IEEE Access 6:23839\u201323847","journal-title":"IEEE Access"},{"key":"2763_CR41","doi-asserted-by":"crossref","unstructured":"Zhang L, Luo P, Tang L, Chen E, Liu Q, Wang M, Xiong H (2015) Occupancy-based frequent pattern mining. ACM Trans Knowl Discov Data 10(2):14:1\u201314:33","DOI":"10.1145\/2753765"},{"key":"2763_CR42","doi-asserted-by":"crossref","unstructured":"Gan W, Lin JC-W, Zhang J, Yu PS (2020) Utility mining across multi-sequences with individualized thresholds. ACM\/IMS Trans Data Sci 1(2):18:1\u201318:29","DOI":"10.1145\/3362070"},{"key":"2763_CR43","doi-asserted-by":"publisher","unstructured":"Srivastava G, Lin JC-W, Jolfaei A, Li Y, Djenouri Y (2020) Uncertain-driven analytics of sequence data in IoCV environments. IEEE Transactions on Intelligent Transportation Systems. https:\/\/doi.org\/10.1109\/TITS.2020.3012387","DOI":"10.1109\/TITS.2020.3012387"},{"issue":"3","key":"2763_CR44","first-page":"51","volume":"16","author":"Y Wu","year":"2021","unstructured":"Wu Y, Luo L, Li Y, Guo L, Fournier-Viger P, Zhu X, Wu X (2021) NTP-Miner: Nonoverlapping three-way sequential pattern mining. ACM Trans Knowl Discov Data 16(3):51","journal-title":"ACM Trans Knowl Discov Data"},{"key":"2763_CR45","doi-asserted-by":"publisher","unstructured":"Cheng S, Wu Y, Li Y, Yao F, Min F (2021) TWD-SFNN: Three-way decisions with a single hidden layer feedforward neural network. Information Sciences. https:\/\/doi.org\/10.1016\/j.ins.2021.07.091","DOI":"10.1016\/j.ins.2021.07.091"},{"key":"2763_CR46","doi-asserted-by":"publisher","unstructured":"Wu Y, Geng M, Li Y, Guo L, Li Z, Fournier-Viger P, Zhu X, Wu X (2021) HANP-Miner: High average utility nonoverlapping sequential pattern mining. Knowledge-Based Systems. https:\/\/doi.org\/10.1016\/j.knosys.2021.107361","DOI":"10.1016\/j.knosys.2021.107361"},{"key":"2763_CR47","doi-asserted-by":"publisher","unstructured":"Srivastava G, Lin JC-W, Zhang X, Li Y (2020) Large-scale high-utility sequential pattern analytics in Internet of things. IEEE Internet of Things Journal. https:\/\/doi.org\/10.1109\/JIOT.2020.3026826","DOI":"10.1109\/JIOT.2020.3026826"},{"issue":"8","key":"2763_CR48","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.ins.2020.07.043","volume":"543","author":"H Kim","year":"2021","unstructured":"Kim H, Yun U, Baek Y, Kim J, Vo B, Yoon E, Fujita H (2021) Efficient list based mining of high average utility patterns with maximum average pruning strategies. Inf Sci 543(8):85\u2013105","journal-title":"Inf Sci"},{"issue":"15","key":"2763_CR49","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/j.knosys.2017.12.029","volume":"144","author":"U Yun","year":"2018","unstructured":"Yun U, Kim D, Yoon E, Fujita H (2018) Damped window based high average utility pattern mining over data streams. Knowl-Based Syst 144(15):188\u2013205","journal-title":"Knowl-Based Syst"},{"key":"2763_CR50","doi-asserted-by":"publisher","unstructured":"Wu Y, Wang Y, Li Y, Zhu X, Wu X (2021) Top-k self-adaptive contrast sequential pattern mining. IEEE Transactions on Cybernetics. https:\/\/doi.org\/10.1109\/TCYB.2021.3082114","DOI":"10.1109\/TCYB.2021.3082114"},{"key":"2763_CR51","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s41019-019-0094-8","volume":"4","author":"X Chen","year":"2019","unstructured":"Chen X, Rao Y, Xie H, Wang FL, Zhao Y, Yin J (2019) Sentiment classification using negative and intensive sentiment supplement information. Data Sci Eng 4:109\u2013118","journal-title":"Data Sci Eng"},{"issue":"3","key":"2763_CR52","doi-asserted-by":"publisher","first-page":"1195","DOI":"10.1109\/TCYB.2019.2896267","volume":"50","author":"W Gan","year":"2020","unstructured":"Gan W, Lin JC-W, Fournier-Viger P, Chao H-C, Yu PS (2020) HUOPM: High-Utility occupancy pattern mining. IEEE Trans Cybern 50(3):1195\u20131208","journal-title":"IEEE Trans Cybern"},{"key":"2763_CR53","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1016\/j.ins.2019.10.033","volume":"513","author":"W Gan","year":"2020","unstructured":"Gan W, Lin JC-W, Zhang J, Chao H-C, Fujita H, Yu PS (2020) ProUM: Projection-based utility mining on sequence data. Inf Sci 513:222\u2013240","journal-title":"Inf Sci"},{"issue":"11","key":"2763_CR54","doi-asserted-by":"publisher","first-page":"4094","DOI":"10.1007\/s10489-020-01778-1","volume":"50","author":"Y Wu","year":"2020","unstructured":"Wu Y, Fan J, Li Y, Guo L, Wu X (2020) NetDAP: (\u03b4, \u03b3)-approximate pattern matching with length constraints. Appl Intell 50(11):4094\u20134116","journal-title":"Appl Intell"},{"key":"2763_CR55","doi-asserted-by":"crossref","unstructured":"Wang H, Duan L, Zuo J, Wang W, Li Z, Tang C (2016) Efficient mining of distinguishing sequential patterns without a predefined gap constraint. Chin J Comput 39(10):19791991","DOI":"10.1007\/978-3-319-18120-2_3"},{"key":"2763_CR56","doi-asserted-by":"publisher","unstructured":"Wu Y, Lei R, Li Y, Guo L, Wu X (2021) HAOP-Miner: Self-adaptive high-average utility one-off sequential pattern mining. Expert Systems with Applications. https:\/\/doi.org\/10.1016\/j.eswa.2021.115449","DOI":"10.1016\/j.eswa.2021.115449"},{"issue":"12","key":"2763_CR57","doi-asserted-by":"publisher","first-page":"4694","DOI":"10.1007\/s10489-018-1227-x","volume":"48","author":"D-T Dinh","year":"2018","unstructured":"Dinh D-T, Le B, Fournier-Viger P, Huynh V-N (2018) An efficient algorithm for mining periodic high-utility sequential patterns. Appl Intell 48(12):4694\u20134714","journal-title":"Appl Intell"},{"issue":"3","key":"2763_CR58","doi-asserted-by":"publisher","first-page":"1199","DOI":"10.1007\/s10115-019-01385-8","volume":"62","author":"JC-W Lin","year":"2020","unstructured":"Lin JC-W, Li T, Pirouz M, Zhang J, Fournier-Viger P (2020) High average-utility sequential pattern mining based on uncertain databases. Knowl Inf Syst 62(3):1199\u20131228","journal-title":"Knowl Inf Syst"},{"issue":"8","key":"2763_CR59","doi-asserted-by":"publisher","first-page":"1042","DOI":"10.1109\/TKDE.2007.1043","volume":"19","author":"J Wang","year":"2007","unstructured":"Wang J, Han J, Li C (2007) Frequent closed sequence mining without candidate maintenance. IEEE Trans Knowl Data Eng 19(8):1042\u20131056","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"2763_CR60","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.future.2019.09.024","volume":"103","author":"U Yun","year":"2020","unstructured":"Yun U, Nam H, Kim J, Kim H, Pedrycz W (2020) Efficient transaction deleting approach of pre-large based high utility pattern mining in dynamic databases. Futur Gener Comput Syst 103:58\u201378","journal-title":"Futur Gener Comput Syst"},{"issue":"2","key":"2763_CR61","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/s10844-006-0006-z","volume":"28","author":"J Pei","year":"2007","unstructured":"Pei J, Han J, Wang W (2007) Constraint-based sequential pattern mining: the pattern-growth methods. J Intell Inf Syst 28(2):133\u2013160","journal-title":"J Intell Inf Syst"},{"key":"2763_CR62","first-page":"138","volume":"2010","author":"F Min","year":"2010","unstructured":"Min F, Wu Y, Wu X (2010) The Apriori property of sequence pattern mining with wildcard gaps. IEEE Int Conf Bioinform Biomed Workshop 2010:138\u2013143","journal-title":"IEEE Int Conf Bioinform Biomed Workshop"},{"issue":"1","key":"2763_CR63","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s10489-012-0394-4","volume":"39","author":"D Guo","year":"2013","unstructured":"Guo D, Hu X, Xie F, Wu X (2013) Pattern matching with wildcards and gap-length constraints based on a centrality-degree graph. Appl Intell 39(1):57\u201374","journal-title":"Appl Intell"},{"key":"2763_CR64","doi-asserted-by":"publisher","unstructured":"Wu X, Wang X, Li Y, Guo L, Li Z, Zhang J, Wu X (2021) OWSP-Miner: Self-adaptive one-off weak-gap strong pattern mining. ACM Transactions on Management Information Systems. https:\/\/doi.org\/10.1145\/3476247","DOI":"10.1145\/3476247"},{"issue":"1","key":"2763_CR65","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1002\/sam.11192","volume":"7","author":"T Hoang","year":"2014","unstructured":"Hoang T, M\u00f6rchen F, Fradkin D, Calders T (2014) Mining compressing sequential patterns. Stat Anal Data Min 7(1):34\u201352","journal-title":"Stat Anal Data Min"},{"key":"2763_CR66","first-page":"363","volume":"29","author":"H Liu","year":"2018","unstructured":"Liu H, Liu Z, Huang H, Wu X (2018) Sequential pattern matching with general gap and one-off condition. J Softw 29:363\u2013382","journal-title":"J Softw"},{"key":"2763_CR67","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1023\/A:1007652502315","volume":"42","author":"MJ Zaki","year":"2001","unstructured":"Zaki MJ (2001) SPADE: An efficient algorithm for mining frequent sequences. Mach Learn 42:31\u201360","journal-title":"Mach Learn"},{"issue":"11","key":"2763_CR68","doi-asserted-by":"publisher","first-page":"1424","DOI":"10.1109\/TKDE.2004.77","volume":"16","author":"J Pei","year":"2004","unstructured":"Pei J, Han J, Mortazavi-Asl B, Wang J, Pinto H, Chen Q, Dayal U, Hsu M (2004) Mining sequential patterns by pattern-growth: The prefixspan approach. IEEE Trans Knowl Data Eng 16(11):1424\u20131440","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"1","key":"2763_CR69","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1186\/1471-2105-8-396","volume":"8","author":"T Wittkop","year":"2007","unstructured":"Wittkop T, Baumbach J, Lobo F, Rahmann S (2007) Large scale clustering of protein sequences with FORCE-a layout based heuristic for weighted cluster editing. BMC Bioinform 8(1):396","journal-title":"BMC Bioinform"},{"key":"2763_CR70","doi-asserted-by":"crossref","unstructured":"Heimerl F, Lohmann S, Lange S, Ertl T (2014) Word cloud explorer: Text analytics based on word clouds. 2014 47th Hawaii Int Conf Syst Sci 2014:1833\u20131842","DOI":"10.1109\/HICSS.2014.231"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-021-02763-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-021-02763-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-021-02763-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,13]],"date-time":"2022-04-13T05:15:03Z","timestamp":1649826903000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-021-02763-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,14]]},"references-count":70,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["2763"],"URL":"https:\/\/doi.org\/10.1007\/s10489-021-02763-y","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,9,14]]},"assertion":[{"value":"9 August 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 September 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}