{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T16:44:46Z","timestamp":1765039486701,"version":"3.37.3"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T00:00:00Z","timestamp":1555027200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100012331","name":"VLAIO","doi-asserted-by":"crossref","award":["HYMOP"],"award-info":[{"award-number":["HYMOP"]}],"id":[{"id":"10.13039\/100012331","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1007\/s10618-019-00628-0","type":"journal-article","created":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T11:04:07Z","timestamp":1555067047000},"page":"1125-1182","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Efficiently mining cohesion-based patterns and rules in event sequences"],"prefix":"10.1007","volume":"33","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1539-0892","authenticated-orcid":false,"given":"Boris","family":"Cule","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8717-0552","authenticated-orcid":false,"given":"Len","family":"Feremans","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9327-9554","authenticated-orcid":false,"given":"Bart","family":"Goethals","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,4,12]]},"reference":[{"key":"628_CR1","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules. In: International conference on very large data bases, pp 487\u2013499"},{"issue":"1","key":"628_CR2","first-page":"1","volume":"19","author":"KW Church","year":"1993","unstructured":"Church KW, Mercer RL (1993) Introduction to the special issue on computational linguistics using large corpora. Comput Linguist 19(1):1\u201324","journal-title":"Comput Linguist"},{"key":"628_CR3","doi-asserted-by":"crossref","unstructured":"Cule B, Goethals B (2010) Mining association rules in long sequences. In: Pacific-Asia conference on knowledge discovery and data mining","DOI":"10.1007\/978-3-642-13657-3_33"},{"key":"628_CR4","doi-asserted-by":"crossref","unstructured":"Cule B, Goethals B, Robardet C (2009) A new constraint for mining sets in sequences. In: Proceedings of the 2009 SIAM international conference on data mining","DOI":"10.1137\/1.9781611972795.28"},{"issue":"2","key":"628_CR5","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1002\/sam.11199","volume":"7","author":"B Cule","year":"2014","unstructured":"Cule B, Tatti N, Goethals B (2014) Marbles: Mining association rules buried in long event sequences. Stat Anal Data Min ASA Data Sci J 7(2):93\u2013110","journal-title":"Stat Anal Data Min ASA Data Sci J"},{"key":"628_CR6","doi-asserted-by":"crossref","unstructured":"Cule B, Feremans L, Goethals B (2016) Efficient discovery of sets of co-occurring items in event sequences. In: European conference on machine learning and principles and practice of knowledge discovery in databases, pp 361\u2013377. Springer","DOI":"10.1007\/978-3-319-46128-1_23"},{"key":"628_CR7","doi-asserted-by":"crossref","unstructured":"Feremans L, Cule B, Goethals B (2018) Mining top-k quantile-based cohesive sequential patterns. In Proceedings of the 2018 SIAM international conference on data mining, pp 90\u201398. SIAM","DOI":"10.1137\/1.9781611975321.11"},{"key":"628_CR8","doi-asserted-by":"crossref","unstructured":"Fowkes J, Sutton C (2016) A subsequence interleaving model for sequential pattern mining. In: Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining, pp 835\u2013844. ACM","DOI":"10.1145\/2939672.2939787"},{"key":"628_CR9","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/4643.001.0001","volume-title":"The minimum description length principle","author":"PD Gr\u00fcnwald","year":"2007","unstructured":"Gr\u00fcnwald PD (2007) The minimum description length principle. MIT press, Cambridge"},{"issue":"1","key":"628_CR10","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: a frequent-pattern tree approach. Data Min Knowl Discov 8(1):53\u201387","journal-title":"Data Min Knowl Discov"},{"issue":"1","key":"628_CR11","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1017\/S1351324900000048","volume":"1","author":"JS Justeson","year":"1995","unstructured":"Justeson JS, Katz SM (1995) Technical terminology: some linguistic properties and an algorithm for identification in text. Natl Lang Eng 1(1):9\u201327","journal-title":"Natl Lang Eng"},{"issue":"1","key":"628_CR12","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1002\/sam.11192","volume":"7","author":"HT Lam","year":"2014","unstructured":"Lam HT, M\u00f6rchen F, Fradkin D, Calders T (2014) Mining compressing sequential patterns. Stat Anal Data Min ASA Data Sci J 7(1):34\u201352","journal-title":"Stat Anal Data Min ASA Data Sci J"},{"key":"628_CR13","doi-asserted-by":"crossref","unstructured":"Laxman S, Sastry PS, Unnikrishnan KP (2007) A fast algorithm for finding frequent episodes in event streams. In: Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining","DOI":"10.1145\/1281192.1281238"},{"issue":"3","key":"628_CR14","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1023\/A:1009748302351","volume":"1","author":"H Mannila","year":"1997","unstructured":"Mannila H, Toivonen H, Verkamo AI (1997) Discovery of frequent episodes in event sequences. Data Min Knowl Discov 1(3):259\u2013289","journal-title":"Data Min Knowl Discov"},{"key":"628_CR15","volume-title":"Foundations of statistical natural language processing","author":"CD Manning","year":"1999","unstructured":"Manning CD, Sch\u00fctze H (1999) Foundations of statistical natural language processing. MIT press, Cambridge"},{"key":"628_CR16","doi-asserted-by":"crossref","unstructured":"M\u00e9ger N, Rigotti C (2004) Constraint-based mining of episode rules and optimal window sizes. In: European conference on machine learning and principles and practice of knowledge discovery in databases","DOI":"10.1007\/978-3-540-30116-5_30"},{"issue":"11","key":"628_CR17","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 Helen, Chen Qiming, Dayal Umeshwar, Hsu Mei-Chun (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":"2","key":"628_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. J Intell Inf Syst 28(2):133\u2013160","journal-title":"J Intell Inf Syst"},{"issue":"5","key":"628_CR19","doi-asserted-by":"publisher","first-page":"1086","DOI":"10.1007\/s10618-016-0467-9","volume":"30","author":"F Petitjean","year":"2016","unstructured":"Petitjean F, Li T, Tatti N, Webb GI (2016) Skopus: mining top-k sequential patterns under leverage. Data Min Knowl Discov 30(5):1086\u20131111","journal-title":"Data Min Knowl Discov"},{"key":"628_CR20","doi-asserted-by":"crossref","unstructured":"Srikant R, Agrawal R (1996) Mining sequential patterns: Generalizations and performance improvements. In: International conference on extending database technology, pp 1\u201317. Springer","DOI":"10.1007\/BFb0014140"},{"issue":"4","key":"628_CR21","doi-asserted-by":"publisher","first-page":"1046","DOI":"10.1007\/s10618-013-0327-9","volume":"28","author":"N Tatti","year":"2014","unstructured":"Tatti N (2014) Discovering episodes with compact minimal windows. Data Min Knowl Discov 28(4):1046\u20131077","journal-title":"Data Min Knowl Discov"},{"issue":"5","key":"628_CR22","doi-asserted-by":"publisher","first-page":"1312","DOI":"10.1007\/s10618-015-0419-9","volume":"29","author":"N Tatti","year":"2015","unstructured":"Tatti N (2015) Ranking episodes using a partition model. Data Min Knowl Discov 29(5):1312\u20131342","journal-title":"Data Min Knowl Discov"},{"issue":"1","key":"628_CR23","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/s10618-011-0232-z","volume":"25","author":"N Tatti","year":"2012","unstructured":"Tatti N, Cule B (2012) Mining closed strict episodes. Data Min Knowl Discov 25(1):34\u201366","journal-title":"Data Min Knowl Discov"},{"key":"628_CR24","doi-asserted-by":"crossref","unstructured":"Tatti N, Vreeken J (2012) The long and the short of it: summarising event sequences with serial episodes. In: Proceedings of the 18th ACM SIGKDD international conference on knowledge discovery and data mining, pp 462\u2013470. ACM","DOI":"10.1145\/2339530.2339606"},{"key":"628_CR25","doi-asserted-by":"crossref","unstructured":"Wang J, Han J (2004) Bide: efficient mining of frequent closed sequences. In: IEEE international conference on data engineering, pp 79\u201390","DOI":"10.1109\/ICDE.2004.1319986"},{"issue":"1","key":"628_CR26","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/1644873.1644876","volume":"4","author":"GI Webb","year":"2010","unstructured":"Webb GI (2010) Self-sufficient itemsets: an approach to screening potentially interesting associations between items. ACM Trans Knowl Discov Data 4(1):3","journal-title":"ACM Trans Knowl Discov Data"},{"issue":"1\u20132","key":"628_CR27","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(1\u20132):31\u201360","journal-title":"Mach Learn"},{"issue":"3","key":"628_CR28","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1109\/69.846291","volume":"12","author":"MJ Zaki","year":"2000","unstructured":"Zaki MJ (2000) Scalable algorithms for association mining. IEEE Trans Knowl Data Eng 12(3):372\u2013390","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"5","key":"628_CR29","doi-asserted-by":"publisher","first-page":"761","DOI":"10.3233\/IDA-140668","volume":"18","author":"A Zimmermann","year":"2014","unstructured":"Zimmermann A (2014) Understanding episode mining techniques: Benchmarking on diverse, realistic, artificial data. Intell Data Anal 18(5):761\u2013791","journal-title":"Intell Data Anal"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-019-00628-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10618-019-00628-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-019-00628-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T23:17:19Z","timestamp":1586560639000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10618-019-00628-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4,12]]},"references-count":29,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,7]]}},"alternative-id":["628"],"URL":"https:\/\/doi.org\/10.1007\/s10618-019-00628-0","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"type":"print","value":"1384-5810"},{"type":"electronic","value":"1573-756X"}],"subject":[],"published":{"date-parts":[[2019,4,12]]},"assertion":[{"value":"28 June 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 April 2019","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}