{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:09:37Z","timestamp":1725530977059},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642013065"},{"type":"electronic","value":"9783642013072"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-01307-2_18","type":"book-chapter","created":{"date-parts":[[2009,4,18]],"date-time":"2009-04-18T13:47:58Z","timestamp":1240062478000},"page":"172-183","source":"Crossref","is-referenced-by-count":3,"title":["A Polynomial-Delay Polynomial-Space Algorithm for Extracting Frequent Diamond Episodes from Event Sequences"],"prefix":"10.1007","author":[{"given":"Takashi","family":"Katoh","sequence":"first","affiliation":[]},{"given":"Hiroki","family":"Arimura","sequence":"additional","affiliation":[]},{"given":"Kouichi","family":"Hirata","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: Proc. 20th VLDB, pp. 487\u2013499 (1994)"},{"key":"18_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/978-3-540-68125-0_2","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"H. Arimura","year":"2008","unstructured":"Arimura, H.: Efficient algorithms for mining frequent and closed patterns from semi-structured data. In: Washio, T., Suzuki, E., Ting, K.M., Inokuchi, A. (eds.) PAKDD 2008. LNCS, vol.\u00a05012, pp. 2\u201313. Springer, Heidelberg (2008)"},{"key":"18_CR3","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.\u00a03827, pp. 724\u2013737. Springer, Heidelberg (2005)"},{"key":"18_CR4","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 Applied Mathematics\u00a065, 21\u201346 (1996)","journal-title":"Discrete Applied Mathematics"},{"key":"18_CR5","unstructured":"Katoh, T., Hirata, K.: Mining frequent elliptic episodes from event sequences. In: Proc.\u00a05th LLLL, pp. 46\u201352 (2007)"},{"key":"18_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/978-3-540-73729-2_45","volume-title":"Modeling Decisions for Artificial Intelligence","author":"T. Katoh","year":"2007","unstructured":"Katoh, T., Hirata, K., Harao, M.: Mining frequent diamond episodes from event sequences. In: Torra, V., Narukawa, Y., Yoshida, Y. (eds.) MDAI 2007. LNCS (LNAI), vol.\u00a04617, pp. 477\u2013488. Springer, Heidelberg (2007)"},{"key":"18_CR7","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 Mining and Knowledge Discovery\u00a01, 259\u2013289 (1997)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"18_CR8","first-page":"1467","volume":"18","author":"J. Pei","year":"2006","unstructured":"Pei, J., Wang, H., Liu, J., Wang, K., Wang, J., Yu, P.S.: Discovering frequent closed partial orders from strings. IEEE TKDE\u00a018, 1467\u20131481 (2006)","journal-title":"IEEE TKDE"},{"key":"18_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TKDE.2004.1264816","volume":"16","author":"J. Pei","year":"2004","unstructured":"Pei, J., Han, J., Mortazavi-Asi, B., Wang, J., Pinto, H., Chen, Q., Dayal, U., Hsu, M.-C.: Mining sequential patterns by pattern-growth: The PrefixSpan approach. IEEE Trans. Knowledge and Data Engineering\u00a016, 1\u201317 (2004)","journal-title":"IEEE Trans. Knowledge and Data Engineering"},{"key":"18_CR10","unstructured":"Uno, T.: Two general methods to reduce delay and change of enumeration algorithms, NII Technical Report, NII-2003-004E (April 2003)"},{"key":"18_CR11","first-page":"457","volume-title":"Proc. 2nd SDM","author":"M.J. Zaki","year":"2002","unstructured":"Zaki, M.J., Hsiao, C.-J.: CHARM: An efficient algorithm for closed itemset mining. In: Proc. 2nd SDM, pp. 457\u2013478. SIAM, Philadelphia (2002)"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-01307-2_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,7]],"date-time":"2019-03-07T19:44:13Z","timestamp":1551987853000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-01307-2_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642013065","9783642013072"],"references-count":11,"URL":"http:\/\/dx.doi.org\/10.1007\/978-3-642-01307-2_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}
