{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T13:52:39Z","timestamp":1762955559416,"version":"3.41.0"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2016,6,14]],"date-time":"2016-06-14T00:00:00Z","timestamp":1465862400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,6,14]],"date-time":"2016-06-14T00:00:00Z","timestamp":1465862400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100002885","name":"China Meteorological Administration","doi-asserted-by":"publisher","award":["GYHY201306070"],"award-info":[{"award-number":["GYHY201306070"]}],"id":[{"id":"10.13039\/501100002885","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002949","name":"Government of Jiangsu Province","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002949","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["DP140100087"],"award-info":[{"award-number":["DP140100087"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006602","name":"Air Force Research Laboratory","doi-asserted-by":"publisher","award":["FA2386-15-1-4007"],"award-info":[{"award-number":["FA2386-15-1-4007"]}],"id":[{"id":"10.13039\/100006602","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2016,9]]},"DOI":"10.1007\/s10618-016-0467-9","type":"journal-article","created":{"date-parts":[[2016,6,14]],"date-time":"2016-06-14T09:22:28Z","timestamp":1465896148000},"page":"1086-1111","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":31,"title":["Skopus: Mining top-k sequential patterns under leverage"],"prefix":"10.1007","volume":"30","author":[{"given":"Fran\u00e7ois","family":"Petitjean","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tao","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nikolaj","family":"Tatti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Geoffrey I.","family":"Webb","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,6,14]]},"reference":[{"issue":"1","key":"467_CR1","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s10618-011-0233-y","volume":"25","author":"A Achar","year":"2012","unstructured":"Achar A, Laxman S, Viswanathan R, Sastry P (2012) Discovering injective episodes with general partial orders. Data Min Knowl Discov 25(1):67\u2013108","journal-title":"Data Min Knowl Discov"},{"key":"467_CR2","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/j.ins.2014.09.063","volume":"296","author":"A Achar","year":"2015","unstructured":"Achar A, Sastry P (2015) Statistical significance of episodes with general partial orders. Inf Sci 296:175\u2013200","journal-title":"Inf Sci"},{"doi-asserted-by":"crossref","unstructured":"Aggarwal CC, Han J (eds) (2014) Frequent pattern mining. Springer, Heidelberg","key":"467_CR3","DOI":"10.1007\/978-3-319-07821-2"},{"doi-asserted-by":"crossref","unstructured":"Agrawal R, Imielinski T, Swami A (1993) Mining association rules between sets of items in large databases. In: Proceedings of the 1993 ACM-SIGMOD International Conference on Management of Data, pp 207\u2013216. Washington, DC","key":"467_CR4","DOI":"10.1145\/170036.170072"},{"doi-asserted-by":"crossref","unstructured":"Agrawal R, Srikant R (1995) Mining sequential patterns. In: Proceedings of the Eleventh International Conference on Data Engineering, March 6\u201310, 1995, Taipei, Taiwan, pp 3\u201314. IEEE Computer Society","key":"467_CR5","DOI":"10.1109\/ICDE.1995.380415"},{"doi-asserted-by":"crossref","unstructured":"Bayardo\u00a0Jr, RJ, Agrawal R (1999) Mining the most interesting rules. In: Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 145\u2013154. ACM, New York","key":"467_CR6","DOI":"10.1145\/312129.312219"},{"issue":"5\u20136","key":"467_CR7","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1002\/sam.10057","volume":"2","author":"M Boley","year":"2009","unstructured":"Boley M, Horv\u00e1th T, Wrobel S (2009) Eficient discovery of interesting patterns based on strong closedness. Stat Anal Data Min 2(5\u20136):346\u2013360","journal-title":"Stat Anal Data Min"},{"issue":"1","key":"467_CR8","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1002\/sam.11134","volume":"5","author":"NC Castro","year":"2012","unstructured":"Castro NC, Azevedo PJ (2012) Significant motifs in time series. Stat Anal Data Min 5(1):35\u201353","journal-title":"Stat Anal Data Min"},{"doi-asserted-by":"crossref","unstructured":"Fournier-Viger P, Gomariz A, Gueniche T, Mwamikazi E, Thomas R (2013) TKS: efficient mining of top-k sequential patterns. In: Advanced data mining and applications, 9th international conference, ADMA 2013, Hangzhou, December 14\u201316, 2013, Proceedings, Part I. Lecture Notes in Computer Science, vol 8346, pp 109\u2013120. Springer, Berlin","key":"467_CR9","DOI":"10.1007\/978-3-642-53914-5_10"},{"doi-asserted-by":"crossref","unstructured":"Geng L, Hamilton HJ (2007) Choosing the right lens: finding what is interesting in data mining. In: Quality measures in data mining, pp 3\u201324. Springer, Berlin","key":"467_CR10","DOI":"10.1007\/978-3-540-44918-8_1"},{"doi-asserted-by":"crossref","unstructured":"Gwadera R, Atallah MJ, Szpankowski W (2005) Markov models for identification of significant episodes. In: SIAM international conference on data mining, pp 404\u2013414","key":"467_CR11","DOI":"10.1137\/1.9781611972757.36"},{"issue":"4","key":"467_CR12","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/s10115-004-0174-5","volume":"7","author":"R Gwadera","year":"2005","unstructured":"Gwadera R, Atallah MJ, Szpankowski W (2005) Reliable detection of episodes in event sequences. Knowl Inf Syst 7(4):415\u2013437","journal-title":"Knowl Inf Syst"},{"doi-asserted-by":"crossref","unstructured":"Gwadera R, Crestani F (2010) Ranking sequential patterns with respect to significance. In: Advances in knowledge discovery and data mining, 14th Pacific-Asia Conference, PAKDD 2010, Hyderabad, June 21\u201324, 2010. Proceedings. Part I, Lecture Notes in Computer Science, vol 6118, pp 286\u2013299. Springer, Berlin","key":"467_CR13","DOI":"10.1007\/978-3-642-13657-3_32"},{"doi-asserted-by":"crossref","unstructured":"H\u00e4m\u00e4l\u00e4inen W (2010) Efficient discovery of the top-k optimal dependency rules with Fisher\u2019s exact test of significance. In: ICDM 2010, The 10th IEEE International Conference on Data Mining, Sydney, Australia, 14\u201317 December 2010, pp 196\u2013205. IEEE Computer Society","key":"467_CR14","DOI":"10.1109\/ICDM.2010.143"},{"issue":"1","key":"467_CR15","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10618-006-0059-1","volume":"15","author":"J Han","year":"2007","unstructured":"Han J, Cheng H, Xin D, Yan X (2007) Frequent pattern mining: current status and future directions. Data Min Knowl Discov 15(1):55\u201386","journal-title":"Data Min Knowl Discov"},{"doi-asserted-by":"crossref","unstructured":"Han J, Pei J, Mortazavi-Asl B, Chen Q, Dayal U, Hsu M (2000) Freespan: frequent pattern-projected sequential pattern mining. In: Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining, Boston, MA, August 20\u201323, 2000, pp. 355\u2013359. ACM, New York","key":"467_CR16","DOI":"10.1145\/347090.347167"},{"doi-asserted-by":"crossref","unstructured":"Jaroszewicz S, Simovici DA (2004) Interestingness of frequent itemsets using bayesian networks as background knowledge. In: Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 178\u2013196. ACM, New York","key":"467_CR17","DOI":"10.1145\/1014052.1014074"},{"issue":"1","key":"467_CR18","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1002\/sam.11192","volume":"7","author":"HT Lam","year":"2014","unstructured":"Lam HT, Moerchen F, Fradkin D, Calders T (2014) Mining compressing sequential patterns. Stat Anal Data Min 7(1):34\u201352","journal-title":"Stat Anal Data Min"},{"doi-asserted-by":"crossref","unstructured":"Low-Kam C, Ra\u00efssi C, Kaytoue M, Pei J (2013) Mining statistically significant sequential patterns. In: 2013 IEEE 13th international conference on data mining, Dallas, TX, December 7\u201310, 2013, pp. 488\u2013497. IEEE Computer Society","key":"467_CR19","DOI":"10.1109\/ICDM.2013.124"},{"issue":"1","key":"467_CR20","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/1824795.1824798","volume":"43","author":"NR Mabroukeh","year":"2010","unstructured":"Mabroukeh NR, Ezeife CI (2010) A taxonomy of sequential pattern mining algorithms. ACM Comput Surv 43(1):3","journal-title":"ACM Comput Surv"},{"issue":"4","key":"467_CR21","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1145\/2382577.2382580","volume":"6","author":"M Mampaey","year":"2012","unstructured":"Mampaey M, Vreeken J, Tatti N (2012) Summarizing data succinctly with the most informative itemsets. ACM Trans Knowl Discov Data 6(4):16","journal-title":"ACM Trans Knowl Discov Data"},{"unstructured":"Mannila H, Toivonen H, Verkamo AI (1995) Discovering frequent episodes in sequences. In: Proceedings of the First International Conference on Knowledge Discovery and Data Mining (KDD-95), Montreal, Canada, August 20\u201321, 1995, pp 210\u2013215. AAAI Press","key":"467_CR22"},{"issue":"3","key":"467_CR23","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"},{"doi-asserted-by":"crossref","unstructured":"Masseglia F, Cathala F, Poncelet P (1998) The PSP approach for mining sequential patterns. In: Principles of data mining and knowledge discovery, Second European Symposium, PKDD \u201998, Nantes, France, September 23-26, 1998, Proceedings, Lecture Notes in Computer Science, vol 1510, pp 176\u2013184. Springer, Berlin","key":"467_CR24","DOI":"10.1007\/BFb0094818"},{"issue":"2","key":"467_CR25","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1145\/2431211.2431218","volume":"45","author":"CH Mooney","year":"2013","unstructured":"Mooney CH, Roddick JF (2013) Sequential pattern mining-approaches and algorithms. ACM Comput Surv 45(2):19","journal-title":"ACM Comput Surv"},{"unstructured":"Pei J, Han J, Mortazavi-Asl B, Pinto H, Chen Q, Dayal U, Hsu M (2001) Prefixspan: mining sequential patterns by prefix-projected growth. In: Proceedings of the 17th International Conference on Data Engineering, April 2\u20136, 2001, Heidelberg, Germany, pp. 215\u2013224. IEEE Computer Society","key":"467_CR26"},{"key":"467_CR27","first-page":"229","volume-title":"Knowl Discov Databases","author":"G Piatetsky-Shapiro","year":"1991","unstructured":"Piatetsky-Shapiro G (1991) Discovery, analysis, and presentation of strong rules. In: Piatetsky-Shapiro G, Frawley J (eds) Knowl Discov Databases. AAAI\/MIT Press, Menlo Park, pp 229\u2013248"},{"issue":"1","key":"467_CR28","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/s10618-008-0108-z","volume":"17","author":"C Ra\u00efssi","year":"2008","unstructured":"Ra\u00efssi C, Calders T, Poncelet P (2008) Mining conjunctive sequential patterns. Data Min Knowl Discov 17(1):77\u201393","journal-title":"Data Min Knowl Discov"},{"doi-asserted-by":"crossref","unstructured":"Siebes A, Vreeken J, van Leeuwen M (2006) Item sets that compress. In: Proceedings of the Sixth SIAM international conference on data mining, April 20\u201322, 2006, Bethesda, pp. 395\u2013406. SIAM","key":"467_CR29","DOI":"10.1137\/1.9781611972764.35"},{"doi-asserted-by":"crossref","unstructured":"Tatti N (2009) Significance of episodes based on minimal windows. In: IEEE international conference on data mining, pp 513\u2013522","key":"467_CR30","DOI":"10.1109\/ICDM.2009.23"},{"issue":"4","key":"467_CR31","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":"467_CR32","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":"2","key":"467_CR33","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/s10618-010-0188-4","volume":"21","author":"N Tatti","year":"2010","unstructured":"Tatti N, Mampaey M (2010) Using background knowledge to rank itemsets. Data Min Knowl Discov 21(2):293\u2013309","journal-title":"Data Min Knowl Discov"},{"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 10th ACM SIGKDD international conference on knowledge discovery and data mining, pp 462\u2013470","key":"467_CR34","DOI":"10.1145\/2339530.2339606"},{"issue":"4","key":"467_CR35","doi-asserted-by":"publisher","first-page":"1004","DOI":"10.1007\/s10618-013-0326-x","volume":"28","author":"CV Tew","year":"2014","unstructured":"Tew CV, Giraud-Carrier CG, Tanner KW, Burton SH (2014) Behavior-based clustering and analysis of interestingness measures for association rule mining. Data Min Knowl Discov 28(4):1004\u20131045","journal-title":"Data Min Knowl Discov"},{"unstructured":"The Oxford English Corpus (2015) The Oxford English Corpus: Facts about Language. In: Oxford Dictionaries. Oxford University Press, Oxford. http:\/\/www.oxforddictionaries.com\/words\/the-oec-facts-about-the-language","key":"467_CR36"},{"key":"467_CR37","volume-title":"Appl Comb","author":"A Tucker","year":"2006","unstructured":"Tucker A (2006) Appl Comb. Wiley, New York"},{"doi-asserted-by":"crossref","unstructured":"Tzvetkov P, Yan X, Han J (2003) TSP: mining top-k closed sequential patterns. In: Proceedings of the 3rd IEEE international conference on data mining (ICDM 2003), 19\u201322 December 2003, Melbourne, pp 347\u2013354. IEEE Computer Society","key":"467_CR38","DOI":"10.1109\/ICDM.2003.1250939"},{"issue":"1","key":"467_CR39","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/s10618-010-0202-x","volume":"23","author":"J Vreeken","year":"2011","unstructured":"Vreeken J, van Leeuwen M, Siebes A (2011) Krimp: mining itemsets that compress. Data Min Knowl Discov 23(1):169\u2013214","journal-title":"Data Min Knowl Discov"},{"key":"467_CR40","first-page":"3:1","volume":"4","author":"G Webb","year":"2010","unstructured":"Webb G (2010) Self-sufficient itemsets: an approach to screening potentially interesting associations between items. Trans Knowl Discov Data 4:3:1\u20133:20","journal-title":"Trans Knowl Discov Data"},{"key":"467_CR41","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1613\/jair.227","volume":"3","author":"GI Webb","year":"1995","unstructured":"Webb GI (1995) OPUS: an efficient admissible algorithm for unordered search. J Artif Intell Res 3:431\u2013465","journal-title":"J Artif Intell Res"},{"doi-asserted-by":"crossref","unstructured":"Webb GI (2000) Efficient search for association rules. In: Proceedings of the 6th ACM SIGKDD international conference on knowledge discovery and data mining, pp 99\u2013107. ACM, New York","key":"467_CR42","DOI":"10.1145\/347090.347112"},{"issue":"1","key":"467_CR43","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10994-007-5006-x","volume":"68","author":"GI Webb","year":"2007","unstructured":"Webb GI (2007) Discovering significant patterns. Mach Learn 68(1):1\u201333","journal-title":"Mach Learn"},{"issue":"2\u20133","key":"467_CR44","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s10994-008-5046-x","volume":"71","author":"GI Webb","year":"2008","unstructured":"Webb GI (2008) Layered critical values: a powerful direct-adjustment approach to discovering significant patterns. Mach Learn 71(2\u20133):307\u2013323","journal-title":"Mach Learn"},{"issue":"1","key":"467_CR45","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":"3","key":"467_CR46","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1002\/widm.28","volume":"1","author":"GI Webb","year":"2011","unstructured":"Webb GI (2011) Filtered-top-k association discovery. Wiley Interdisc Rev Data Min Knowl Discov 1(3):183\u2013192","journal-title":"Wiley Interdisc Rev Data Min Knowl Discov"},{"issue":"3","key":"467_CR47","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2601433","volume":"8","author":"GI Webb","year":"2014","unstructured":"Webb GI, Vreeken J (2014) Efficient discovery of the most interesting associations. ACM Trans Knowl Discov Data 8(3):1\u201331","journal-title":"ACM Trans Knowl Discov Data"},{"doi-asserted-by":"crossref","unstructured":"Yan X, Han J, Afshar R (2003) Clospan: mining closed sequential patterns in large databases. In: Proceedings of the Third SIAM international conference on data mining, San Francisco, May 1\u20133, 2003, pp 166\u2013177. SIAM","key":"467_CR48","DOI":"10.1137\/1.9781611972733.15"},{"key":"467_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/978-3-642-40319-4_31","volume-title":"Trends and Applications in Knowledge Discovery and Data Mining","author":"A Zimmermann","year":"2013","unstructured":"Zimmermann A (2013) Objectively evaluating interestingness measures for frequent itemset mining. In: Li J, Cao L, Wang C, Tan K, Liu B, Pei J, Tseng V (eds) Trends and Applications in Knowledge Discovery and Data Mining, vol 7867., Lecture Notes in Computer ScienceSpringer, Berlin Heidelberg, pp 354\u2013366"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-016-0467-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10618-016-0467-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-016-0467-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-016-0467-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,3]],"date-time":"2025-06-03T21:40:16Z","timestamp":1748986816000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10618-016-0467-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,14]]},"references-count":49,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2016,9]]}},"alternative-id":["467"],"URL":"https:\/\/doi.org\/10.1007\/s10618-016-0467-9","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"type":"print","value":"1384-5810"},{"type":"electronic","value":"1573-756X"}],"subject":[],"published":{"date-parts":[[2016,6,14]]},"assertion":[{"value":"14 December 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 May 2016","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 June 2016","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}