{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,23]],"date-time":"2024-09-23T05:40:20Z","timestamp":1727070020808},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2024,6,11]],"date-time":"2024-06-11T00:00:00Z","timestamp":1718064000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,6,11]],"date-time":"2024-06-11T00:00:00Z","timestamp":1718064000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Dalat University, Vietnam"},{"name":"FPT University, Danang, Vietnam"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2024,10]]},"DOI":"10.1007\/s10115-024-02148-w","type":"journal-article","created":{"date-parts":[[2024,6,11]],"date-time":"2024-06-11T17:02:16Z","timestamp":1718125336000},"page":"6151-6186","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["MFS-SubSC: an efficient algorithm for mining frequent sequences with sub-sequence constraint"],"prefix":"10.1007","volume":"66","author":[{"given":"Hai","family":"Duong","sequence":"first","affiliation":[]},{"given":"Anh","family":"Tran","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,6,11]]},"reference":[{"key":"2148_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal R, Imieli\u0144ski T, Swami A (1993) Mining association in large databases. In: Proceedings of the 1993 ACM SIGMOD international conference on Management of data. pp 207\u2013216","DOI":"10.1145\/170036.170072"},{"key":"2148_CR2","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/s10115-011-0386-4","volume":"30","author":"P Senkul","year":"2012","unstructured":"Senkul P, Salin S (2012) Improving pattern quality in web usage mining by using semantic information. Knowl Inf Syst 30:527\u2013541","journal-title":"Knowl Inf Syst"},{"key":"2148_CR3","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1007\/s10115-012-0602-x","volume":"38","author":"VCC Liao","year":"2014","unstructured":"Liao VCC, Chen MS (2014) DFSP: a depth-first spelling algorithm for sequential pattern mining of biological sequences. Knowl Inf Syst 38:623\u2013639","journal-title":"Knowl Inf Syst"},{"key":"2148_CR4","doi-asserted-by":"publisher","first-page":"855","DOI":"10.1109\/TCBB.2015.2495132","volume":"13","author":"J Zhang","year":"2016","unstructured":"Zhang J, Wang Y, Zhang C, Shi Y (2016) Mining contiguous sequential generators in biological sequences. IEEE\/ACM Trans Comput Biol Bioinform 13:855\u2013867","journal-title":"IEEE\/ACM Trans Comput Biol Bioinform"},{"key":"2148_CR5","doi-asserted-by":"publisher","first-page":"2949","DOI":"10.1109\/TCSS.2022.3233408","volume":"10","author":"Y Djenouri","year":"2023","unstructured":"Djenouri Y, Belhadi A, Srivastava G, Chun-Wei Lin J (2023) Advanced pattern-mining system for fake news analysis. IEEE Trans Comput Soc Syst 10:2949\u20132958","journal-title":"IEEE Trans Comput Soc Syst"},{"key":"2148_CR6","doi-asserted-by":"publisher","first-page":"2459","DOI":"10.1109\/TCBB.2020.2980234","volume":"18","author":"YH Ke","year":"2021","unstructured":"Ke YH, Huang JW, Lin WC, Jaysawal BP (2021) Finding possible promoter binding sites in DNA sequences by sequential patterns mining with specific numbers of gaps. IEEE\/ACM Trans Comput Biol Bioinform 18:2459\u20132470","journal-title":"IEEE\/ACM Trans Comput Biol Bioinform"},{"key":"2148_CR7","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1109\/TLT.2013.27","volume":"6","author":"P Fournier-Viger","year":"2013","unstructured":"Fournier-Viger P, Nkambou R, Nguifo EM et al (2013) A multiparadigm intelligent tutoring system for robotic arm training. IEEE Trans Learn Technol 6:364\u2013377","journal-title":"IEEE Trans Learn Technol"},{"key":"2148_CR8","doi-asserted-by":"publisher","first-page":"16458","DOI":"10.1007\/s10489-021-03122-7","volume":"52","author":"W Song","year":"2022","unstructured":"Song W, Ye W, Fournier-Viger P (2022) Mining sequential patterns with flexible constraints from MOOC data. Appl Intell 52:16458\u201316474","journal-title":"Appl Intell"},{"key":"2148_CR9","doi-asserted-by":"crossref","unstructured":"Srikant R, Agrawal R (1996) Mining sequential patterns: generalizations and performance improvements. In: Proceedings of the 5th international conference on extending database technology: advances in database technology, EDBT \u201996. ACM. pp 3\u201317","DOI":"10.1007\/BFb0014140"},{"key":"2148_CR10","unstructured":"Pei J, Han J, Mortazavi-Asl B et al (2001) PrefixSpan: mining sequential patterns by prefix-projected growth. In: Proceedings of the 17th international conference on data engineering. pp 215\u2013224"},{"key":"2148_CR11","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"},{"key":"2148_CR12","doi-asserted-by":"crossref","unstructured":"Ayres J, Flannick J, Gehrke J, Yiu T (2002) Sequential pattern mining using a bitmap representation. In: Proceedings of the eighth ACM SIGKDD international conference on knowledge discovery and data mining, KDD \u201902. pp 429\u2013435","DOI":"10.1145\/775107.775109"},{"key":"2148_CR13","doi-asserted-by":"crossref","unstructured":"Fournier-Viger P, Gomariz A, Campos M (2014) Fast vertical mining of sequential patterns using co-occurrence information. In: Proceedings of 18th Pacific-Asia conference on knowledge discovery and data mining, PAKDD \u20192014. pp 40\u201352","DOI":"10.1007\/978-3-319-06608-0_4"},{"key":"2148_CR14","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s10115-017-1032-6","volume":"53","author":"B Le","year":"2017","unstructured":"Le B, Duong H, Truong T, Fournier-Viger P (2017) FCloSM, FGenSM: two efficient algorithms for mining frequent closed and generator sequences using the local pruning strategy. Knowl Inf Syst 53:71\u2013107","journal-title":"Knowl Inf Syst"},{"key":"2148_CR15","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/j.engappai.2017.09.024","volume":"67","author":"H Duong","year":"2018","unstructured":"Duong H, Truong T, Le B (2018) Efficient algorithms for simultaneously mining concise representations of sequential patterns based on extended pruning conditions. Eng Appl Artif Intell 67:197\u2013210","journal-title":"Eng Appl Artif Intell"},{"key":"2148_CR16","doi-asserted-by":"crossref","unstructured":"Fournier-Viger P, Gomariz A, \u0160ebek M, Hlosta M (2014) VGEN: fast vertical mining of sequential generator patterns. In: Proceedings of 16th International conference on data warehousing and knowledge discovery, DWKD\u201914. pp 476\u2013488","DOI":"10.1007\/978-3-319-10160-6_42"},{"key":"2148_CR17","doi-asserted-by":"crossref","unstructured":"Gomariz A, Campos M, Marin R, Goethals B (2013) ClaSP: an efficient algorithm for mining frequent closed sequences. In: Proceedings of 17th Pacific-Asia conference PAKDD \u201913. pp 50\u201361","DOI":"10.1007\/978-3-642-37453-1_5"},{"key":"2148_CR18","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. Intell Inf Syst 28:133\u2013160","journal-title":"Intell Inf Syst"},{"key":"2148_CR19","doi-asserted-by":"publisher","first-page":"7208","DOI":"10.1007\/s10489-020-02153-w","volume":"51","author":"T Van","year":"2021","unstructured":"Van T, Le B (2021) Mining sequential rules with itemset constraints. Appl Intell 51:7208\u20137220","journal-title":"Appl Intell"},{"key":"2148_CR20","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/s10115-018-1161-6","volume":"57","author":"T Van","year":"2018","unstructured":"Van T, Vo B, Le B (2018) Mining sequential patterns with itemset constraints. Knowl Inf Syst 57:311\u2013330","journal-title":"Knowl Inf Syst"},{"key":"2148_CR21","doi-asserted-by":"publisher","first-page":"3902","DOI":"10.1007\/s10489-018-1182-6","volume":"48","author":"T Van","year":"2018","unstructured":"Van T, Yoshitaka A, Le B (2018) Mining web access patterns with super-pattern constraint. Appl Intell 48:3902\u20133914","journal-title":"Appl Intell"},{"key":"2148_CR22","doi-asserted-by":"publisher","first-page":"19827","DOI":"10.1007\/s10489-023-04514-7","volume":"53","author":"A Nguyen","year":"2023","unstructured":"Nguyen A, Nguyen NT, Nguyen LTT, Vo B (2023) Mining inter-sequence patterns with Itemset constraints. Appl Intell 53:19827\u201319842","journal-title":"Appl Intell"},{"key":"2148_CR23","doi-asserted-by":"publisher","first-page":"1130","DOI":"10.1109\/TKDE.2019.2897311","volume":"32","author":"J De Smedt","year":"2020","unstructured":"De Smedt J, Deeva G, De Weerdt J (2020) Mining behavioral sequence constraints for classification. IEEE Trans Knowl Data Eng 32:1130\u20131142","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"2148_CR24","doi-asserted-by":"crossref","unstructured":"Duong H, Truong T, Le B, Fournier-Viger P (2019) An explicit relationship between sequential patterns and their concise representations. In: Lecture notes in computer science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). pp 341\u2013361","DOI":"10.1007\/978-3-030-37188-3_20"},{"key":"2148_CR25","doi-asserted-by":"publisher","first-page":"2191","DOI":"10.1007\/s10115-019-01418-2","volume":"62","author":"H Duong","year":"2020","unstructured":"Duong H, Truong T, Tran A, Le B (2020) Fast generation of sequential patterns with item constraints from concise representations. Knowl Inf Syst 62:2191\u20132223","journal-title":"Knowl Inf Syst"},{"key":"2148_CR26","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 et al (2021) Efficient algorithms for mining frequent high utility sequences with constraints. Inf Sci 568:239\u2013264","journal-title":"Inf Sci"},{"key":"2148_CR27","doi-asserted-by":"crossref","unstructured":"Fournier-Viger P, Wu CW, Tseng VS (2013) Mining maximal sequential patterns without candidate maintenance. In: Lecture notes in computer science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer, pp 169\u2013180","DOI":"10.1007\/978-3-642-53914-5_15"},{"key":"2148_CR28","doi-asserted-by":"crossref","unstructured":"Yin Z, Gan W, Huang G et al (2022) Constraint-based sequential rule mining. In: Proceedings - 2022 IEEE 9th international conference on data science and advanced analytics, DSAA 2022. pp 1\u201310","DOI":"10.1109\/DSAA54385.2022.10032452"},{"key":"2148_CR29","doi-asserted-by":"publisher","first-page":"1327","DOI":"10.1007\/s10489-017-1123-9","volume":"48","author":"T Le","year":"2018","unstructured":"Le T, Nguyen A, Huynh B et al (2018) Mining constrained inter-sequence patterns: a novel approach to cope with item constraints. Appl Intell 48:1327\u20131343","journal-title":"Appl Intell"},{"key":"2148_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.knosys.2015.06.014","volume":"89","author":"J Zhang","year":"2015","unstructured":"Zhang J, Wang Y, Yang D (2015) CCSpan: mining closed contiguous sequential patterns. Knowl Based Syst 89:1\u201313","journal-title":"Knowl Based Syst"},{"key":"2148_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3321486","volume":"44","author":"K Beedkar","year":"2019","unstructured":"Beedkar K, Gemulla R, Martens W (2019) A unified framework for frequent sequence mining with subsequence constraints. ACM Trans Database Syst 44:1\u201342","journal-title":"ACM Trans Database Syst"},{"key":"2148_CR32","doi-asserted-by":"crossref","unstructured":"Renz-Wieland A, Bertsch M, Gemulla R (2019) Scalable frequent sequence mining with flexible subsequence constraints. In: Proceedings of international conference on data engineering. pp 1490\u20131501","DOI":"10.1109\/ICDE.2019.00134"},{"key":"2148_CR33","first-page":"1","volume":"13","author":"Y Wu","year":"2022","unstructured":"Wu Y, Wang X, Li Y et al (2022) OWSP-miner: self-adaptive one-off weak-gap strong pattern mining. ACM Trans Manag Inf Syst 13:1\u201323","journal-title":"ACM Trans Manag Inf Syst"},{"key":"2148_CR34","doi-asserted-by":"crossref","unstructured":"Alatrista-Salas H, Guevara-Cogorno A, Maehara Y, Nunez-del-Prado M (2020) Efficiently mining gapped and window constraint frequent sequential patterns. In: Lecture notes in computer science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). pp 240\u2013251","DOI":"10.1007\/978-3-030-57524-3_20"},{"key":"2148_CR35","first-page":"1","volume":"17","author":"Y Wu","year":"2023","unstructured":"Wu Y, Chen M, Li Y et al (2023) ONP-miner: one-off negative sequential pattern mining. ACM Trans Knowl Discov Data 17:1\u201324","journal-title":"ACM Trans Knowl Discov Data"},{"key":"2148_CR36","doi-asserted-by":"publisher","first-page":"4348","DOI":"10.1007\/s10489-019-01492-7","volume":"49","author":"R Wu","year":"2019","unstructured":"Wu R, Li Q, Chen X (2019) Mining contrast sequential pattern based on subsequence time distribution variation with discreteness constraints. Appl Intell 49:4348\u20134360","journal-title":"Appl Intell"},{"key":"2148_CR37","first-page":"1","volume":"16","author":"Y Wu","year":"2021","unstructured":"Wu Y, Luo L, Li Y et al (2021) NTP-miner: nonoverlapping three-way sequential pattern mining. ACM Trans Knowl Discov Data 16:1\u201321","journal-title":"ACM Trans Knowl Discov Data"},{"key":"2148_CR38","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3281632","volume":"13","author":"BP Jaysawal","year":"2019","unstructured":"Jaysawal BP, Huang J-W (2019) PSP-AMS: progressive mining of sequential patterns across multiple streams. ACM Trans Knowl Discov Data 13:1\u201323","journal-title":"ACM Trans Knowl Discov Data"},{"key":"2148_CR39","doi-asserted-by":"publisher","first-page":"6106","DOI":"10.1007\/s10489-021-02520-1","volume":"52","author":"T Truong","year":"2022","unstructured":"Truong T, Duong H, Le B et al (2022) Frequent high minimum average utility sequence mining with constraints in dynamic databases using efficient pruning strategies. Appl Intell 52:6106\u20136128","journal-title":"Appl Intell"},{"key":"2148_CR40","first-page":"3569","volume":"15","author":"P Fournier-Viger","year":"2014","unstructured":"Fournier-Viger P, Gomariz A, Soltani A et al (2014) SPMF: a java open-source pattern mining library. J Mach Learn Res 15:3569\u20133573","journal-title":"J Mach Learn Res"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-024-02148-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10115-024-02148-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-024-02148-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,23]],"date-time":"2024-09-23T05:06:25Z","timestamp":1727067985000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10115-024-02148-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,11]]},"references-count":40,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2024,10]]}},"alternative-id":["2148"],"URL":"https:\/\/doi.org\/10.1007\/s10115-024-02148-w","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"type":"print","value":"0219-1377"},{"type":"electronic","value":"0219-3116"}],"subject":[],"published":{"date-parts":[[2024,6,11]]},"assertion":[{"value":"2 July 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 May 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 May 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 June 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"All authors certify that they have no affiliations with or involvement in any organization or entity with any financial interest or non-financial interest in the subject matter or materials discussed in this manuscript. The authors have no conflict of interest. This research was carried using public data. No experiments were conducted with humans or animals.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}