{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T05:14:54Z","timestamp":1737090894094,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540438625"},{"type":"electronic","value":"9783540454526"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45452-7_2","type":"book-chapter","created":{"date-parts":[[2007,5,16]],"date-time":"2007-05-16T01:55:29Z","timestamp":1179280529000},"page":"17-19","source":"Crossref","is-referenced-by-count":6,"title":["Efficient Text Mining with Optimized Pattern Discovery"],"prefix":"10.1007","author":[{"given":"Hiroki","family":"Arimura","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,6,21]]},"reference":[{"key":"2_CR1","unstructured":"R. Agrawal, R. Srikant, Fast algorithms for mining association rules, In Proc. VLDB\u201994, 487\u2013499, 1994."},{"key":"2_CR2","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. 9th Int. Workshop on Algorithmic Learning Theory, LNAI 1501, 247\u2013261, 1998.","DOI":"10.1007\/3-540-49730-7_19"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"T. Asai, K. Abe, S. Kawasoe, H. Arimura, H. Sakamoto, S. Arikawa, Efficient substructure discovery from large semi-structured data, In Proc. 2nd SIAM Int\u2019l. Conf. on Data Mining, 158\u2013174, 2002.","DOI":"10.1137\/1.9781611972726.10"},{"issue":"2","key":"2_CR4","first-page":"141","volume":"17","author":"W. W. Cohen","year":"1999","unstructured":"W. W. Cohen, Y. Singer, Context-sensitive learning methods for text categorization, J. ACM, 17(2), 141\u2013173, 1999.","journal-title":"J. ACM"},{"key":"2_CR5","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":"2_CR6","doi-asserted-by":"crossref","unstructured":"L. Devroye, L. Gyorfi, G. Lugosi, A probablistic theory of pattern recognition, Springer-Verlag, 1996.","DOI":"10.1007\/978-1-4612-0711-5"},{"key":"2_CR7","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"U. M. Fayyad","year":"1996","unstructured":"U. M. Fayyad, G. Piatetsky-Shapiro, P. Smyth, and R. Uthurusamy, Advances in Knowledge Discovery and Data Mining, The MIT Press, Cambridge, 1996."},{"key":"2_CR8","volume-title":"Principles of Data","author":"D. Hand","year":"1996","unstructured":"D. Hand, H. mannila, and P. Smyth, Principles of Data The MIT Press, Cambridge, 1996."},{"key":"2_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/3-540-48194-X_17","volume-title":"Proc. 12th Combinatorial Pattern Matching","author":"T. Kasai","year":"2001","unstructured":"T. Kasai, G. Lee, H. Arimura, S. Arikawa, K. Park, Linear-time longest-common-prefix computation in suffix arrays and its applications, In Proc. 12th Combinatorial Pattern Matching, LNCS 2089, 181\u2013192, Springer-Verlag, 2001."},{"issue":"2\u2013-3","key":"2_CR10","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\u2013-3), 115\u2013141, 1994.","journal-title":"Machine Learning"},{"key":"2_CR11","unstructured":"S. Morishita, On classification and regression, In Proc. 1st Int\u2019l. Conf. on Discovery Conference, LNAI 1532, 49\u201359, 1998."},{"key":"2_CR12","unstructured":"L. Parida, I. Rigoutsos, A. Floratos, D. Platt, Y. Gao, Pattern discovery on character sets and real-valued data: linear bound on irredundant motifs and an efficient polynomial time algorithm, In Proc. 11th ACM-SIAM Symposium on Discrete Algorithms, 297\u2013308, 2000."},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"F. Provost, M. Schkolnick, R. Srikant (eds.), Proc. 7th ACM SIGKDD international conference on Knowledge discovery and data mining ACM Press, 2001.","DOI":"10.1145\/502512.502517"},{"key":"2_CR14","unstructured":"H. Sakamoto, H. Arimura, and S. Arikawa, Extracting partial structures from html documents, In Proc. 14th Florida Artificial Intelligence Research Symposium (FLAIRS\u20192001), Florida, AAAI, 264\u2013268, May, 2001."},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"K. Taniguchi, H. Sakamoto, H. Arimura, S. Shimozono and S. Arikawa, Mining semi-structured data by path expressions, In Proc. 4th Int\u2019l. Conf. on Discovery Science, LNAI 2226, 378\u2013388, Springer-Verlag, 2001.","DOI":"10.1007\/3-540-45650-3_32"},{"key":"2_CR16","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/BF03037568","volume":"18","author":"S. Shimozono","year":"2000","unstructured":"S. Shimozono, H. Arimura, S. Arikawa, Efficient discovery of optimal word-association patterns in large text databases, New Gener. Comp., 18, 49\u201360, 2000.","journal-title":"New Gener. Comp."},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"J. T. L. Wang, G. W. Chirn, T. G. Marr, B. Shapiro, D. Shasha and K. Zhang, Combinatorial pattern discovery for scientific data: Some preliminary results, In Proc. SIGMOD\u201994, 115\u2013125, 1994.","DOI":"10.1145\/191839.191863"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45452-7_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T09:13:34Z","timestamp":1737018814000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45452-7_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540438625","9783540454526"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-45452-7_2","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}