{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T13:31:51Z","timestamp":1750858311813},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,7,4]],"date-time":"2015-07-04T00:00:00Z","timestamp":1435968000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2016,5]]},"DOI":"10.1007\/s10115-015-0854-3","type":"journal-article","created":{"date-parts":[[2015,7,3]],"date-time":"2015-07-03T07:55:46Z","timestamp":1435910146000},"page":"405-432","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Discovering compressing serial episodes from event sequences"],"prefix":"10.1007","volume":"47","author":[{"given":"A.","family":"Ibrahim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shivakumar","family":"Sastry","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P. S.","family":"Sastry","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,7,4]]},"reference":[{"key":"854_CR1","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/j.datak.2013.06.005","volume":"87","author":"A Achar","year":"2013","unstructured":"Achar A, Ibrahim A, Sastry PS (2013) Pattern-growth based frequent serial episode discovery. Data Knowl Eng 87:91\u2013108","journal-title":"Data Knowl Eng"},{"issue":"2","key":"854_CR2","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/s10115-011-0408-2","volume":"31","author":"A Achar","year":"2012","unstructured":"Achar A, Laxman S, Sastry PS (2012) A unified view of the apriori-based algorithms for frequent episode discovery. Knowl Inf Syst 31(2):223\u2013250","journal-title":"Knowl Inf Syst"},{"key":"854_CR3","doi-asserted-by":"crossref","unstructured":"Archer B, Shivakumar S, Rowe A, Rajkumar R (2009) Profiling primitives of networked embedded automation. In: IEEE international conference on automation science and engineering, 2009. CASE 2009. IEEE, pp 531\u2013536","DOI":"10.1109\/COASE.2009.5234124"},{"issue":"11","key":"854_CR4","doi-asserted-by":"crossref","first-page":"1490","DOI":"10.1109\/TKDE.2005.183","volume":"17","author":"D Burdick","year":"2005","unstructured":"Burdick D, Calimlim M, Flannick J, Gehrke J, Yiu T (2005) Mafia: a maximal frequent itemset algorithm. IEEE Trans Knowl Data Eng 17(11):1490\u20131504","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"854_CR5","doi-asserted-by":"crossref","unstructured":"Calders T, Goethals B (2002) Mining all non-derivable frequent itemsets. In: Elomaa T, Mannila H, Toivonen H (eds) Principles of data mining and knowledge discovery, vol 2431 of Lecture Notes in Computer Science. Springer, Berlin, pp 74\u201386","DOI":"10.1007\/3-540-45681-3_7"},{"key":"854_CR6","doi-asserted-by":"crossref","unstructured":"Casas-Garriga G (2005) Summarizing sequential data with closed partial orders. In: Proceedings of the 2005 SIAM international conference on data mining, SDM 2005. SIAM, pp 380\u2013391","DOI":"10.1137\/1.9781611972757.34"},{"issue":"3","key":"854_CR7","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/s10115-006-0039-1","volume":"12","author":"V Chandola","year":"2007","unstructured":"Chandola V, Kumar V (2007) Summarization-compressing data into an informative representation. Knowl Inf Syst 12(3):355\u2013378","journal-title":"Knowl Inf Syst"},{"key":"854_CR8","doi-asserted-by":"crossref","unstructured":"Chang C-C, Lin C-J (2011) LIBSVM: a library for support vector machines. ACM Trans Intell Syst Technol 2:27:1\u201327:27. http:\/\/www.csie.ntu.edu.tw\/~cjlin\/libsvm","DOI":"10.1145\/1961189.1961199"},{"key":"854_CR9","doi-asserted-by":"crossref","unstructured":"Geerts F, Goethals B, Mielik\u00e4inen T (2004) Tiling databases. In: Suzuki E, Arikawa S (eds) Discovery science, vol 3245, of Lecture Notes in Computer Science. Springer, Berlin, pp 278\u2013289","DOI":"10.1007\/978-3-540-30214-8_22"},{"key":"854_CR10","doi-asserted-by":"crossref","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, vol 1. The MIT Press, Cambridge"},{"issue":"1","key":"854_CR11","doi-asserted-by":"crossref","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"},{"key":"854_CR12","doi-asserted-by":"crossref","first-page":"2831","DOI":"10.1007\/978-0-387-39940-9_369","volume-title":"Encyclopedia of database systems","author":"J Han","year":"2009","unstructured":"Han J, Ding B (2009) Stream mining. In: Liu L, \u00d6zsu M (eds) Encyclopedia of database systems. Springer, Berlin, pp 2831\u20132834"},{"key":"854_CR13","doi-asserted-by":"crossref","unstructured":"Koper A, Nguyen H (2011) Sequential pattern mining from stream data. In: Tang J, King I, Chen L, Wang J (eds) Advanced data mining and applications, vol 7121, Lecture Notes in Computer Science. Springer, Berlin, pp 278\u2013291","DOI":"10.1007\/978-3-642-25856-5_21"},{"key":"854_CR14","doi-asserted-by":"crossref","unstructured":"Lam HT, Calders T, Yang J, M\u00f6rchen F, Fradkin D (2013) Zips: mining compressing sequential patterns in streams. In: Proceedings of the ACM SIGKDD workshop on interactive data exploration and analytics, IDEA \u201913. ACM, New York, pp 54\u201362","DOI":"10.1145\/2501511.2501520"},{"issue":"1","key":"854_CR15","doi-asserted-by":"crossref","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 7(1):34\u201352","journal-title":"Stat Anal Data Min"},{"key":"854_CR16","doi-asserted-by":"crossref","unstructured":"Lam HT, M\u00f6rchen F, Fradkin D, Calders T (2012) Mining compressing sequential patterns. In: Proceedings of the 2012 SIAM international conference on data mining. SIAM, pp 319\u2013330","DOI":"10.1137\/1.9781611972825.28"},{"key":"854_CR17","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. ACM, pp 410\u2013419","DOI":"10.1145\/1281192.1281238"},{"issue":"3","key":"854_CR18","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1109\/TKDE.2002.1000342","volume":"14","author":"D-I Lin","year":"2002","unstructured":"Lin D-I, Kedem ZM (2002) Pincer-search: an efficient algorithm for discovering the maximum frequent set. IEEE Trans Knowl Data Eng 14(3):553\u2013566","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"3","key":"854_CR19","doi-asserted-by":"crossref","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":"854_CR20","doi-asserted-by":"crossref","unstructured":"Mendes LF, Ding B, Han J (2008) Stream sequential pattern mining with precise error bounds. In: Eighth IEEE international conference on data mining, 2008. ICDM\u201908. IEEE, pp 941\u2013946","DOI":"10.1109\/ICDM.2008.154"},{"key":"854_CR21","doi-asserted-by":"crossref","unstructured":"M\u00e9ger N, Rigotti C (2004) Constraint-based mining of episode rules and optimal window sizes. In: Boulicaut J-F, Esposito F, Giannotti F, Pedreschi D (eds) Knowledge discovery in databases: PKDD 2004, vol 3202, Lecture Notes in Computer Science. Springer, Berlin , pp 313\u2013324","DOI":"10.1007\/978-3-540-30116-5_30"},{"key":"854_CR22","doi-asserted-by":"crossref","unstructured":"Moerchen F, Fradkin D (2010) Robust mining of time intervals with semi-interval partial order patterns. In: Proceedings of the 2010 SIAM international conference on data mining. SIAM, pp 315\u2013326","DOI":"10.1137\/1.9781611972801.28"},{"key":"854_CR23","doi-asserted-by":"crossref","unstructured":"Pasquier N, Bastide Y, Taouil R, Lakhal L (1999) Discovering frequent closed itemsets for association rules. In: Beeri C, Buneman P (eds) Database theory\u2014CDT\u201999\u2019, vol 1540, Lecture Notes in Computer Science. Springer, Berlin, pp 398\u2013416","DOI":"10.1007\/3-540-49257-7_25"},{"key":"854_CR24","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1214\/aos\/1176346150","volume":"11","author":"J Rissanen","year":"1983","unstructured":"Rissanen J (1983) A universal prior for integers and estimation by minimum description length. Ann Stat 11:416\u2013431","journal-title":"Ann Stat"},{"key":"854_CR25","unstructured":"Shivakumar S (2006) Sensor-actuator systems for automation. In: Work in progress session, IEEE real-time systems symposium. IEEE"},{"key":"854_CR26","doi-asserted-by":"crossref","unstructured":"Siebes A, Vreeken J, van Leeuwen M (2006) Item sets that compress. In: Proceedings of the 2006 SIAM international conference on data mining. SIAM, pp 395\u2013406","DOI":"10.1137\/1.9781611972764.35"},{"key":"854_CR27","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. ACM, pp 462\u2013470","DOI":"10.1145\/2339530.2339606"},{"key":"854_CR28","doi-asserted-by":"crossref","unstructured":"Van Leeuwen M, Siebes A (2008) Streamkrimp: detecting change in data streams. In: Machine learning and knowledge discovery in databases. Springer, pp 672\u2013687","DOI":"10.1007\/978-3-540-87479-9_62"},{"issue":"1","key":"854_CR29","doi-asserted-by":"crossref","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":"854_CR30","doi-asserted-by":"crossref","unstructured":"Wang J, Han J (2004) Bide: efficient mining of frequent closed sequences. In: Proceedings of the 20th international conference on data engineering, 2004. IEEE, pp 79\u201390","DOI":"10.1109\/ICDE.2004.1319986"},{"key":"854_CR31","doi-asserted-by":"crossref","unstructured":"Wang J, Han J, Pei J (2003) Closet+: searching for the best strategies for mining frequent closed itemsets. In: Proceedings of the ninth ACM SIGKDD international conference on knowledge discovery and data mining. ACM, pp 236\u2013245","DOI":"10.1145\/956750.956779"},{"issue":"1","key":"854_CR32","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/s10115-005-0216-7","volume":"9","author":"J Wang","year":"2006","unstructured":"Wang J, Karypis G (2006) On efficiently summarizing categorical databases. Knowl Inf Syst 9(1):19\u201337","journal-title":"Knowl Inf Syst"},{"key":"854_CR33","volume-title":"Managing gigabytes: compressing and indexing documents and images","author":"IH Witten","year":"1999","unstructured":"Witten IH, Moffat A, Bell TC (1999) Managing gigabytes: compressing and indexing documents and images, 2nd edn. Morgan and Kaufmann, San Francisco","edition":"2"},{"key":"854_CR34","doi-asserted-by":"crossref","unstructured":"Xiang Y, Jin R, Fuhry D, Dragan FF (2008) Succinct summarization of transactional databases: an overlapped hyperrectangle scheme. In: Proceedings of the 14th ACM SIGKDD international conference on knowledge discovery and data mining. ACM, pp 758\u2013766","DOI":"10.1145\/1401890.1401981"},{"key":"854_CR35","doi-asserted-by":"crossref","unstructured":"Yan X, Han J, Afshar R (2003) Clospan: mining closed sequential patterns in large datasets. In: Proceedings of SIAM international conference on data mining. SIAM, pp 166\u2013177","DOI":"10.1137\/1.9781611972733.15"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-015-0854-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-015-0854-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-015-0854-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,4]],"date-time":"2020-09-04T13:41:07Z","timestamp":1599226867000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-015-0854-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,4]]},"references-count":35,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,5]]}},"alternative-id":["854"],"URL":"https:\/\/doi.org\/10.1007\/s10115-015-0854-3","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,7,4]]}}}