{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,8]],"date-time":"2025-05-08T15:02:46Z","timestamp":1746716566290},"publisher-location":"Berlin, Heidelberg","reference-count":27,"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_6","type":"book-chapter","created":{"date-parts":[[2007,6,3]],"date-time":"2007-06-03T22:06:11Z","timestamp":1180908371000},"page":"123-139","source":"Crossref","is-referenced-by-count":2,"title":["Efficient Data Mining from Large Text Databases"],"prefix":"10.1007","author":[{"given":"Hiroki","family":"Arimura","sequence":"first","affiliation":[]},{"given":"Hiroshi","family":"Sakamoto","sequence":"additional","affiliation":[]},{"given":"Setsuo","family":"Arikawa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,3,14]]},"reference":[{"key":"6_CR1","unstructured":"A. V. Aho, J. E. Hopcroft, and J. Ullman, The design and Analysis of Computer Algorithms. Addison-Wesley, 1974."},{"key":"6_CR2","unstructured":"R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A. I. Verkamo, Fast discovery of association rules, Advances in Knowledge Discovery and Data Mining, Chap. 12, MIT Press, 307\u2013328, 1996."},{"key":"6_CR3","unstructured":"R. Agrawal, R. Srikant, Fast algorithms for mining association rules, In Proc. VLDB\u201994, 487\u2013499, 1994."},{"key":"6_CR4","unstructured":"A. V. Aho, M. J. Corasick, Efficient string matching: An aid to bibliographic search, Comm. ACM, 1998"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"H. Arimura, J. Abe, R. Fujino, H. Sakamoto, S. Shimozono, S. Arikawa, Text Data Mining: Discovery of Important Keywords in the Cyberspace, In Proc. IEEE Kyoto Int\u2019l Conf. Digital Library, 2001. (to appear)","DOI":"10.1109\/DLRP.2000.942178"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"H. Arimura, A. Wataki, R. Fujino, S. Arikawa, A fast algorithm for discovering optimal string patterns in large text databases, In Proc. the 9th Int. Workshop on Algorithmic Learning Theory (ALT\u201998), LNAI 1501, 247\u2013261, 1998.","DOI":"10.1007\/3-540-49730-7_19"},{"key":"6_CR7","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/S0004-3702(00)00004-7","volume":"118","author":"M. Craven","year":"2000","unstructured":"M. Craven, D. DiPasquo, D. Freitag, A. McCallum, T. Mitchell, K. Nigam, and S. Slattery, Learning to construct knowledge bases from the World Wide Web, Artificial Intelligence, 118, 69\u2013114, 2000.","journal-title":"Artificial Intelligence"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"L. Devroye, L. Gyor., G. Lugosi, A Probablistic Theory of Pattern Recognition, Springer-Verlag,1996.","DOI":"10.1007\/978-1-4612-0711-5"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1137\/0221005","volume":"21","author":"L. Devroye","year":"1992","unstructured":"L. Devroye, W. Szpankowski, B. Rais, A note on the height of the sufix trees. SIAM J. Comput., 21, 48\u201353 (1992).","journal-title":"SIAM J. Comput."},{"key":"6_CR10","first-page":"281","volume":"1805","author":"R. Fujino","year":"2000","unstructured":"R. Fujino, H. Arimura, S. Arikawa, Discovering unordered and ordered phrase association patterns for text mining. Proc. PAKDD2000, LNAI 1805, 281\u2013293, 2000.","journal-title":"Proc. PAKDD2000, LNAI"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"T. Fukuda, Y. Morimoto, S. Morishita, and T. Tokuyama, Data mining using two-dimensional optimized association rules, In Proc. SIGMOD\u201996, 13\u201323, 1996.","DOI":"10.1145\/233269.233313"},{"key":"6_CR12","unstructured":"G. Gonnet, R. Baeza-Yates and T. Snider, New indices for text: Pat trees and pat arrays, In William Frakes and Ricardo Baeza-Yates (eds.), Information Retrieval: Data Structures and Algorithms, 66\u201382, 1992."},{"key":"6_CR13","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":"6_CR14","unstructured":"J. E. Hopcroft, and J. Ullman, Introduction to Automata Theory, Languages and Computation. Addison-Wesley, 1979."},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"M. J. Kearns and U. V. Vazirani, An Introduction to Computational Learning Theory, MIT Press, 1994.","DOI":"10.7551\/mitpress\/3897.001.0001"},{"key":"6_CR16","series-title":"Lect Notes Comput Sci","volume-title":"Proc. CPM\u201901","author":"T. Kasai","year":"2000","unstructured":"T. Kasai, G. Lee, H. Arimura, S. Arikawa, K. Park, Linear-time longest-commonpre fix computation in sufix arrays and its applications, In Proc. CPM\u201901, LNCS, Springer-Verlag, 2000(this volumn)."},{"key":"6_CR17","unstructured":"J. M. Kleinberg, Authoritative sources in a hyperlinked environment. In Proc. SODA\u201998, 668\u2013677, 1998."},{"issue":"2","key":"6_CR18","first-page":"115","volume":"17","author":"M. J. Kearns","year":"1994","unstructured":"M. J. Kearns, R. E. Shapire, L. M. Sellie, Toward efficient agnostic learning. Machine Learning, 17(2\u20133), 115\u2013141, 1994.","journal-title":"Machine Learning"},{"key":"6_CR19","unstructured":"D. Lewis, Reuters-21578 text categorization test collection, Distribution 1.0, AT&T Labs-Research, http:\/\/www.research.att.com\/~lewis\/ , 1997."},{"key":"6_CR20","unstructured":"L. C. K. Lui, Color set size problem with applications to string matching. Proc. the 3rd Annual Symp. Combinatorial Pattern Matching, 1992."},{"issue":"2","key":"6_CR21","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1145\/321941.321946","volume":"23","author":"E. M. McCreight","year":"1976","unstructured":"E. M. McCreight, A space-economical sufix tree construction algorithm, JACM, 23(2):262\u2013272, 1976.","journal-title":"JACM"},{"key":"6_CR22","doi-asserted-by":"crossref","unstructured":"U. Manber and R. Baeza-Yates, An algorithm for string matching with a sequence of don\u2019t cares. IPL 37, 1991.","DOI":"10.1016\/0020-0190(91)90032-D"},{"issue":"5","key":"6_CR23","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1137\/0222058","volume":"22","author":"U. Manber","year":"1993","unstructured":"U. Manber and G. Myers, Sufix arrays: A new method for on-line string searches, SIAM J. Computing, 22(5), 935\u2013948 (1993).","journal-title":"SIAM J. Computing"},{"key":"6_CR24","unstructured":"S. Morishita, On classification and regression, In Proc. Discovery Science\u2019 98, LNAI 1532, 49\u201359, 1998."},{"key":"6_CR25","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1137\/0217079","volume":"17","author":"B. Schieber","year":"1988","unstructured":"B. Schieber and U. Vishkin, On finding lowest common ancestors: simplifications an parallelization, SIAM J. Computing, 17, 1253\u20131262, 1988.","journal-title":"SIAM J. Computing"},{"key":"6_CR26","doi-asserted-by":"publisher","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 text databases, New Generation Computing, Special issue on Discovery Science, 18, 49\u201360, 2000.","journal-title":"New Generation Computing"},{"key":"6_CR27","doi-asserted-by":"crossref","unstructured":"J. T. L. Wang, G. W. Chirn, T. G. Marr, B. Shapiro, D. Shasha and K. Zhang, In Proc. SIGMOD\u201994, 115\u2013125, 1994.","DOI":"10.1145\/191843.191863"}],"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_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T16:59:28Z","timestamp":1556470768000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45884-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540433385","9783540458845"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/3-540-45884-0_6","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}