{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:55:35Z","timestamp":1725796535377},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319084060"},{"type":"electronic","value":"9783319084077"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08407-7_8","type":"book-chapter","created":{"date-parts":[[2014,7,5]],"date-time":"2014-07-05T10:25:59Z","timestamp":1404555959000},"page":"117-131","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Mining Frequent Partite Episodes with Partwise Constraints"],"prefix":"10.1007","author":[{"given":"Takashi","family":"Katoh","sequence":"first","affiliation":[]},{"given":"Shin-ichiro","family":"Tago","sequence":"additional","affiliation":[]},{"given":"Tatsuya","family":"Asai","sequence":"additional","affiliation":[]},{"given":"Hiroaki","family":"Morikawa","sequence":"additional","affiliation":[]},{"given":"Junichi","family":"Shigezumi","sequence":"additional","affiliation":[]},{"given":"Hiroya","family":"Inakoshi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,7,6]]},"reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"724","DOI":"10.1007\/11602613_73","volume-title":"Algorithms and Computation","author":"H Arimura","year":"2005","unstructured":"Arimura, H., Uno, T.: A polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol. 3827, pp. 724\u2013737. Springer, Heidelberg (2005)"},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0166-218X(95)00026-N","volume":"65","author":"D Avis","year":"1996","unstructured":"Avis, D., Fukuda, K.: Reverse search for enumeration. Discrete Appl. Math. 65, 21\u201346 (1996)","journal-title":"Discrete Appl. Math."},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/978-3-642-14888-0_26","volume-title":"New Frontiers in Artificial Intelligence","author":"T Katoh","year":"2010","unstructured":"Katoh, T., Arimura, H., Hirata, K.: Mining frequent k-partite episodes from event sequences. In: Nakakoji, K., Murakami, Y., McCready, E. (eds.) JSAI-isAI 2009. LNCS (LNAI), vol. 6284, pp. 331\u2013344. Springer, Heidelberg (2010)"},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1007\/978-3-540-68125-0_55","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"T Katoh","year":"2008","unstructured":"Katoh, T., Hirata, K.: A simple characterization on serially constructible episodes. In: Washio, T., Suzuki, E., Ting, K.M., Inokuchi, A. (eds.) PAKDD 2008. LNCS (LNAI), vol. 5012, pp. 600\u2013607. Springer, Heidelberg (2008)"},{"key":"8_CR5","unstructured":"Ma, X., Pang, H., Tan, K.L.: Finding constrained frequent episodes using minimal occurrences. In: ICDM, pp. 471\u2013474 (2004)"},{"issue":"3","key":"8_CR6","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."},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/978-3-540-30116-5_30","volume-title":"Knowledge Discovery in Databases: PKDD 2004","author":"N M\u00e9ger","year":"2004","unstructured":"M\u00e9ger, N., Rigotti, C.: Constraint-based mining of episode rules and optimal window sizes. In: Boulicaut, J.-F., Esposito, F., Giannotti, F., Pedreschi, D. (eds.) PKDD 2004. LNCS (LNAI), vol. 3202, pp. 313\u2013324. Springer, Heidelberg (2004)"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Ohtani, H., Kida, T., Uno, T., Arimura, H.: Efficient serial episode mining with minimal occurrences. In: ICUIMC, pp. 457\u2013464 (2009)","DOI":"10.1145\/1516241.1516320"},{"issue":"11","key":"8_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TKDE.2004.69","volume":"16","author":"J Pei","year":"2004","unstructured":"Pei, J., Han, J., Mortazavi-Asi, B., Wang, J.: Mining sequential patterns by pattern-growth: the PrefixSpan approach. IEEE Trans. Knowl. Data Eng. 16(11), 1\u201317 (2004)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Pei, J., Han, J.: Can we push more constraints into frequent pattern mining? In: KDD, pp. 350\u2013354 (2000)","DOI":"10.1145\/347090.347166"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Pei, J., Han, J., Wang, W.: Mining sequential patterns with constraints in large databases. In: CIKM, pp. 18\u201325. ACM (2002)","DOI":"10.1145\/584792.584799"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Seipel, D., Neubeck, P., K\u00f6hler, S., Atzmueller, M.: Mining complex event patterns in computer networks. In: Appice, A., Ceci, M., Loglisci, C., Manco, G., Masciari, E., Ras, Z.W. (eds.) NFMCP 2012. LNCS, vol. 7765, pp. 33\u201348. Springer, Heidelberg (2013)","DOI":"10.1007\/978-3-642-37382-4_3"},{"issue":"1","key":"8_CR13","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."},{"key":"8_CR14","unstructured":"Uno, T.: Two general methods to reduce delay and change of enumeration algorithms. Technical report. National Institute of Informatics (2003)"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/978-3-642-13657-3_34","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"W Zhou","year":"2010","unstructured":"Zhou, W., Liu, H., Cheng, H.: Mining closed episodes from event sequences efficiently. In: Zaki, M.J., Yu, J.X., Ravindran, B., Pudi, V. (eds.) PAKDD 2010, Part I. LNCS, vol. 6118, pp. 310\u2013318. Springer, Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","New Frontiers in Mining Complex Patterns"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08407-7_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,14]],"date-time":"2023-02-14T18:22:16Z","timestamp":1676398936000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-08407-7_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319084060","9783319084077"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08407-7_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"6 July 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}