{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:29:39Z","timestamp":1725488979633},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540001706"},{"type":"electronic","value":"9783540361695"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36169-3_17","type":"book-chapter","created":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T04:27:32Z","timestamp":1186892852000},"page":"188-202","source":"Crossref","is-referenced-by-count":6,"title":["Ordered Term Tree Languages which Are Polynomial Time Inductively Inferable from Positive Data"],"prefix":"10.1007","author":[{"given":"Yusuke","family":"Suzuki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takayoshi","family":"Shoudai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomoyuki","family":"Uchida","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tetsuhiro","family":"Miyahara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,11,8]]},"reference":[{"key":"17_CR1","unstructured":"S. Abiteboul, P. Buneman, and D. Suciu. Data on the Web: From Relations to Semistructured Data and XML. Morgan Kaufmann, 2000."},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"T. R. Amoth, P. Cull, and P. Tadepalli. Exact learning of unordered tree patterns from queries. Proc. COLT-99, ACM Press, pages 323\u2013332, 1999.","DOI":"10.1145\/307400.307486"},{"key":"17_CR3","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. Journal of Computer and System Science, 21:46\u201362, 1980.","journal-title":"Journal of Computer and System Science"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"H. Arimura, H. Sakamoto, and S. Arikawa. Efficient learning of semi-structured data from queries. Proc. ALT-2001, Springer-Verlag, LNAI 2225, pages 315\u2013331, 2001.","DOI":"10.1007\/3-540-45583-3_24"},{"key":"17_CR5","series-title":"Lect Notes Comput Sci","first-page":"649","volume-title":"Finding minimal generalizations for unions of pattern languages and its application to inductive inference from positive data","author":"H. Arimura","year":"1994","unstructured":"H. Arimura, T. Shinohara, and S. Otsuki. Finding minimal generalizations for unions of pattern languages and its application to inductive inference from positive data. Proc. STACS-94, Springer-Verlag, LNCS 775, pages 649\u2013660, 1994."},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"S. Matsumoto, Y. Hayashi, and T. Shoudai. Polynomial time inductive inference of regular term tree languages from positive data. Proc. ALT-97, Springer-Verlag, LNAI 1316, pages 212\u2013227, 1997.","DOI":"10.1007\/3-540-63577-7_45"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"T. Miyahara, T. Shoudai, T. Uchida, K. Takahashi, and H. Ueda. Polynomial time matching algorithms for tree-like structured patterns in knowledge discovery. Proc. PAKDD-2000, Springer-Verlag, LNAI 1805, pages 5\u201316, 2000.","DOI":"10.1007\/3-540-45571-X_4"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"T. Miyahara, T. Shoudai, T. Uchida, K. Takahashi, and H. Ueda. Discovery of frequent tree structured patterns in semistructured web documents. Proc. PAKDD-2001, Springer-Verlag, LNAI 2035, pages 47\u201352, 2001.","DOI":"10.1007\/3-540-45357-1_8"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"T. Miyahara, Y. Suzuki, T. Shoudai, T. Uchida, K. Takahashi, and H. Ueda. Discovery of frequent tag tree patterns in semistructured web documents. Proc. PAKDD-2002, Springer-Verlag, LNAI 2336, pages 341\u2013355, 2002.","DOI":"10.1007\/3-540-47887-6_35"},{"key":"17_CR10","series-title":"Lect Notes Comput Sci","first-page":"115","volume-title":"Polynomial time inference of extended regular pattern languages","author":"T. Shinohara","year":"1982","unstructured":"T. Shinohara. Polynomial time inference of extended regular pattern languages. In Springer-Verlag, LNCS 147, pages 115\u2013127, 1982."},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"T. Shinohara and S. Arikawa. Pattern inference. GOSLER Final Report, Springer-Verlag, LNAI 961, pages 259\u2013291, 1995.","DOI":"10.1007\/3-540-60217-8_13"},{"key":"17_CR12","first-page":"85","volume":"XI","author":"T. Shoudai","year":"2000","unstructured":"T. Shoudai, T. Miyahara, T. Uchida, and S. Matsumoto. Inductive inference of regular term tree languages and its application to knowledge discovery. Information Modeling and Knowledge Bases XI, IOS Press, pages 85\u2013102, 2000.","journal-title":"Information Modeling and Knowledge Bases"},{"key":"17_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/3-540-44669-9_32","volume-title":"Polynomial time algorithms for finding unordered tree patterns with internal variables","author":"T. Shoudai","year":"2001","unstructured":"T. Shoudai, T. Uchida, and T. Miyahara. Polynomial time algorithms for finding unordered tree patterns with internal variables. Proc. FCT-2001, Springer-Verlag, LNCS 2138, pages 335\u2013346, 2001."},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"Y. Suzuki, R. Akanuma, T. Shoudai, T. Miyahara, and T. Uchida. Polynomial time inductive inference of ordered tree patterns with internal structured variables from positive data. Proc. COLT-2002, Springer-Verlag, LNAI 2375, pages 169\u2013184, 2002.","DOI":"10.1007\/3-540-45435-7_12"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Y. Suzuki, K. Inomae, T. Shoudai, T. Miyahara, and T. Uchida. A polynomial time matching algorithm of structured ordered tree patterns for data mining from semistructured data. Proc. ILP-2002, Springer-Verlag, LNAI (to appear), 2002.","DOI":"10.1007\/3-540-36468-4_18"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36169-3_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T23:40:23Z","timestamp":1556754023000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36169-3_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540001706","9783540361695"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-36169-3_17","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}