{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:30:33Z","timestamp":1725489033959},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540413523"},{"type":"electronic","value":"9783540444183"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44418-1_10","type":"book-chapter","created":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T01:00:14Z","timestamp":1186880414000},"page":"112-126","source":"Crossref","is-referenced-by-count":1,"title":["Discovering Characteristic Expressions from Literary Works: a New Text Analysis Method beyond N-Gram Statistics and KWIC"],"prefix":"10.1007","author":[{"given":"Masayuki","family":"Takeda","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tetsuya","family":"Matsumoto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomoko","family":"Fukuda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ichir\u014d","family":"Nanri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,10,19]]},"reference":[{"key":"10_CR1","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":"10_CR2","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":"10_CR3","unstructured":"M. Crochemore and W. Rytter. Text Algorithms. Oxford University Press, 1994."},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"L. Devroye, L. Gy orfi, and G. Lugosi. A Probablistic Theory of Pattern Recognition. Springer, 1997.","DOI":"10.1007\/978-1-4612-0711-5"},{"key":"10_CR5","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":"10_CR6","unstructured":"T. Fukuda, Y. Morimoto, S. Morishita, and T. Tokuyama. Data mining using twodimensional optimized association rules. In Proc. 1996 SIGMOD, pages 13\u201323, 1996."},{"key":"10_CR7","unstructured":"M. Kondo. Studies on classical Japanese literature based on string analysis using n-gram statistics. Technical report, Chiba University, March 2000. (in Japanese)."},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1002\/asi.5090110403","volume":"11","author":"H. Luhn","year":"1960","unstructured":"H. Luhn. Keyword-in-context index for technical literature (KWICindex). American Documentation, 11:288\u2013295, 1960.","journal-title":"American Documentation"},{"issue":"3","key":"10_CR9","first-page":"774","volume":"40","author":"M. Murakami","year":"1999","unstructured":"M. Murakami and Y. Imanishi. On a quantitative analysis of auxiliary verbs used in Genji Monogatari. Transactions of Information Processing Society of Japan, 40(3):774\u2013782, 1999. (in Japanese).","journal-title":"Transactions of Information Processing Society of Japan"},{"issue":"1","key":"10_CR10","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":"10_CR11","unstructured":"M. Takeda, T. Fukuda, I. Nanri, M. Yamasaki, and K. Tamari. Discovering similar poems from anthologies of classical Japanese poems. Proceedings of the Institute of Statistical Mathematics, 48(2), 2000. to appear (in Japanese)."},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"K. Tamari, M. Yamasaki, T. Kida, M. Takeda, T. Fukuda, and I. Nanri. Discovering poetic allusion in anthologies of classical Japaneses poems. In Proc. 2nd Int. Conf. Discovery Science, LNAI 1721, pages 128\u2013138. Springer-Verlag, 1999.","DOI":"10.1007\/3-540-46846-3_12"},{"issue":"1","key":"10_CR13","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. Previous version in: DS\u201998, LNAI 1532.","journal-title":"New Gener. Comput."}],"container-title":["Lecture Notes in Computer Science","Discovery Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44418-1_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T19:41:43Z","timestamp":1556739703000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44418-1_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540413523","9783540444183"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-44418-1_10","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}