{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:44:26Z","timestamp":1725486266721},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540433385"},{"type":"electronic","value":"9783540458845"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45884-0_39","type":"book-chapter","created":{"date-parts":[[2007,6,3]],"date-time":"2007-06-03T18:06:11Z","timestamp":1180893971000},"page":"518-531","source":"Crossref","is-referenced-by-count":0,"title":["Mining from Literary Texts: Pattern Discovery and Similarity Computation"],"prefix":"10.1007","author":[{"given":"Masayuki","family":"Takeda","sequence":"first","affiliation":[]},{"given":"Tomoko","family":"Fukuda","sequence":"additional","affiliation":[]},{"given":"Ichir\u014d","family":"Nanri","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,3,14]]},"reference":[{"key":"39_CR1","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/0022-0000(80)90041-0","volume":"21","author":"D. Angluin","year":"1980","unstructured":"D. Angluin. Finding patterns common to a set of strings. J. Comput. Sys. Sci., 21:46\u201362, 1980.","journal-title":"J. Comput. Sys. Sci."},{"key":"39_CR2","doi-asserted-by":"crossref","unstructured":"H. Arimura. Text data mining with optimized pattern discovery. In Proc. 17th Workshop on Machine Intelligence, Cambridge, July 2000.","DOI":"10.1007\/3-540-45452-7_2"},{"issue":"3","key":"39_CR3","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1145\/28869.28873","volume":"34","author":"A. Blumer","year":"1987","unstructured":"A. Blumer, J. Blumer, D. Haussler, R. Mcconnell, and A. Ehrenfeucht. Complete inverted files for efficient text retrieval and analysis. J. ACM, 34(3):578\u2013595, 1987. Previous version in: STOC\u201984.","journal-title":"J. ACM"},{"key":"39_CR4","doi-asserted-by":"crossref","unstructured":"A. Br\u00e4zma, E. Ukkonen, and J. Vilo. Discovering unbounded unions of regular pattern languages from positive examples. In Proc. 7th International Symposium on Algorithms and Computation (ISAAC\u201996), pages 95\u2013104, 1996.","DOI":"10.1007\/BFb0009485"},{"key":"39_CR5","unstructured":"M. Crochemore and W. Rytter. Text Algorithms. Oxford University Press, 1994."},{"key":"39_CR6","doi-asserted-by":"crossref","unstructured":"L. Devroye, L. Gy\u00f6r., and G. Lugosi. A Probabilistic Theory of Pattern Recognition. Springer, 1997.","DOI":"10.1007\/978-1-4612-0711-5"},{"key":"39_CR7","unstructured":"U. M. Fayyad, G. P.-Shapiro, and P. Smyth. From data mining to knowledge discovery: an overview. In Advances in Knowledge Discovery and Data Mining, pages 1\u201334. The AAAI Press, 1996."},{"key":"39_CR8","doi-asserted-by":"crossref","unstructured":"Z. Galil. Open problems in stringology. In A. Apostolico and Z. Galil, editors, Combinatorial Algorithms on Words, NATO ASI Series, Advanced Science Institutes Series, Series F: Computer and Systems Sciences, Vol. 12, pages 1\u20138. Springer-Verlag, 1985.","DOI":"10.1007\/978-3-642-82456-2_1"},{"key":"39_CR9","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology","author":"D. Gusfield","year":"1997","unstructured":"D. Gusfield. Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, New York, 1997."},{"key":"39_CR10","doi-asserted-by":"crossref","unstructured":"H. Hori, S. Shimozono, M. Takeda, and A. Shinohara. Fragmentary pattern matching: Complexity, algorithms and applications for analyzing classic literary works. In Proc. 12th Annual International Symposium on Algorithms and Computation (ISAAC\u2019\u2ad71), 2001. To appear.","DOI":"10.1007\/3-540-45678-3_61"},{"key":"39_CR11","doi-asserted-by":"crossref","unstructured":"T. Kadota, M. Hirao, A. Ishino, M. Takeda, A. Shinohara, and F. Matsuo. Musical sequence comparison for melodic and rhythmic similarities. In Proc. 8th International Symposium on String Processing and Information Retrieval (SPIRE2001). IEEE Computer Society, 2001. To appear.","DOI":"10.1109\/SPIRE.2001.989744"},{"key":"39_CR12","doi-asserted-by":"crossref","unstructured":"O. Maruyama, T. Uchida, K. L. Sim, and S. Miyano. Designing views in HypothesisCreator: System for assisting in discovery. In Proc. 2nd International Conference on Discovery Science (DS\u201999), LNAI 1721, pages 115\u2013127, 1999.","DOI":"10.1007\/3-540-46846-3_11"},{"key":"39_CR13","doi-asserted-by":"crossref","unstructured":"S. Morishita. On classification and regression. InProc. 1st International Conference on Discovery Science (DS\u201999), LNAI1532, pages 49\u201359, 1998.","DOI":"10.1007\/3-540-49292-5_4"},{"issue":"1","key":"39_CR14","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/BF03037568","volume":"18","author":"S. Shimozono","year":"2000","unstructured":"S. Shimozono, H. Arimura, and S. Arikawa. Efficient discovery of optimal wordassociation patterns in large databases. New Gener. Comput., 18(1):49\u201360, 2000.","journal-title":"New Gener. Comput."},{"key":"39_CR15","unstructured":"M. Takeda, T. Fukuda, I. Nanri, M. Yamasaki, and K. Tamari. Discovering instances of poetic allusion from anthologies of classical Japanese poems. Theor. Comput. Sci., 2001. To appear. Preliminary version in: Proc. DS\u201999 (LNAI 1721)."},{"key":"39_CR16","unstructured":"M. Takeda, T. Matsumoto, T. Fukuda, and I. Nanri. Discovering characteristic expressions from literary works. Theor. Comput. Sci., 2001. To appear. Preliminary version in: Proc. DS 2000 (LNAI1967)."},{"key":"39_CR17","doi-asserted-by":"crossref","unstructured":"K. Yamamoto, M. Takeda, A. Shinohara, T. Fukuda, and I. Nanri. Discovering repetitive expressions and afinities from anthologies of classical Japanese poems. In Proc. 4th International Conference on Discovery Science (DS2001), 2001. To appear.","DOI":"10.1007\/3-540-45650-3_35"},{"issue":"1","key":"39_CR18","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/BF03037569","volume":"18","author":"M. Yamasaki","year":"2000","unstructured":"M. Yamasaki, M. Takeda, T. Fukuda, and I. Nanri. Discovering characteristic patterns from collections of classical Japanese poems. New Gener. Comput., 18(1):61\u201373, 2000. Preliminary version in: Proc. DS\u201998 (LNAI 1532).","journal-title":"New Gener. Comput."}],"container-title":["Lecture Notes in Computer Science","Progress in Discovery Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45884-0_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T12:59:34Z","timestamp":1556456374000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45884-0_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540433385","9783540458845"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-45884-0_39","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}