{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,11]],"date-time":"2025-06-11T04:11:26Z","timestamp":1749615086643,"version":"3.41.0"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319461274"},{"type":"electronic","value":"9783319461281"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-46128-1_23","type":"book-chapter","created":{"date-parts":[[2016,9,3]],"date-time":"2016-09-03T05:34:23Z","timestamp":1472880863000},"page":"361-377","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Efficient Discovery of Sets of Co-occurring Items in Event Sequences"],"prefix":"10.1007","author":[{"given":"Boris","family":"Cule","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Len","family":"Feremans","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bart","family":"Goethals","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,9,4]]},"reference":[{"key":"23_CR1","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: International Conference on Very Large Data Bases, pp. 487\u2013499 (1994)"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Srikant, R.: Mining sequential patterns. In: International Conference on Data Engineering, pp. 3\u201314 (1995)","DOI":"10.1109\/ICDE.1995.380415"},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Cule, B., Goethals, B., Robardet, C.: A new constraint for mining sets in sequences. In: SIAM International Conference on Data Mining, pp. 317\u2013328 (2009)","DOI":"10.1137\/1.9781611972795.28"},{"issue":"2","key":"23_CR4","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.: Marbles: mining association rules buried in long event sequences. Stat. Anal. Data Min. 7(2), 93\u2013110 (2014)","journal-title":"Stat. Anal. Data Min."},{"issue":"1","key":"23_CR5","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.: Mining frequent patterns without candidate generation: a frequent-pattern tree approach. Data Min. Knowl. Disc. 8(1), 53\u201387 (2004)","journal-title":"Data Min. Knowl. Disc."},{"key":"23_CR6","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/978-3-319-11812-3_10","volume-title":"Discovery Science","author":"Tayena Hendrickx","year":"2014","unstructured":"Hendrickx, T., Cule, B., Goethals, B.: Mining cohesive itemsets in graphs. In: International Conference on Discovery Science, pp. 111\u2013122 (2014)"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"Laxman, S., Sastry, P.S., Unnikrishnan, K.: A fast algorithm for finding frequent episodes in event streams. In: ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 410\u2013419 (2007)","DOI":"10.1145\/1281192.1281238"},{"issue":"3","key":"23_CR8","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, A.I.: Discovery of frequent episodes in event sequences. Data Min. Knowl. Disc. 1(3), 259\u2013289 (1997)","journal-title":"Data Min. Knowl. Disc."},{"issue":"11","key":"23_CR9","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.C.: Mining sequential patterns by pattern-growth: the prefixspan approach. IEEE Trans. Knowl. Data Eng. 16(11), 1424\u20131440 (2004)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"4","key":"23_CR10","doi-asserted-by":"publisher","first-page":"1046","DOI":"10.1007\/s10618-013-0327-9","volume":"28","author":"N Tatti","year":"2014","unstructured":"Tatti, N.: Discovering episodes with compact minimal windows. Data Min. Knowl. Disc. 28(4), 1046\u20131077 (2014)","journal-title":"Data Min. Knowl. Disc."},{"issue":"1","key":"23_CR11","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.: Mining closed strict episodes. Data Min. Knowl. Disc. 25(1), 34\u201366 (2012)","journal-title":"Data Min. Knowl. Disc."},{"issue":"1\u20132","key":"23_CR12","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1023\/A:1007652502315","volume":"42","author":"MJ Zaki","year":"2001","unstructured":"Zaki, M.J.: SPADE: an efficient algorithm for mining frequent sequences. Mach. Learn. 42(1\u20132), 31\u201360 (2001)","journal-title":"Mach. Learn."}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-46128-1_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T16:40:48Z","timestamp":1749573648000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-46128-1_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319461274","9783319461281"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-46128-1_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"4 September 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ECML PKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Joint European Conference on Machine Learning and Knowledge Discovery in Databases","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Riva del Garda","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 September 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecml2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}