{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,11]],"date-time":"2025-07-11T10:21:12Z","timestamp":1752229272444},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540604549"},{"type":"electronic","value":"9783540474708"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60454-5_29","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T20:38:46Z","timestamp":1330288726000},"page":"66-79","source":"Crossref","is-referenced-by-count":9,"title":["Learning unions of tree patterns using queries"],"prefix":"10.1007","author":[{"given":"Hiroki","family":"Arimura","sequence":"first","affiliation":[]},{"given":"Hiroki","family":"Ishizaka","sequence":"additional","affiliation":[]},{"given":"Takeshi","family":"Shinohara","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"5_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. Journal of Computer and System Sciences, 21:46\u201362, 1980.","journal-title":"Journal of Computer and System Sciences"},{"key":"5_CR2","first-page":"319","volume":"2","author":"D. Angluin","year":"1988","unstructured":"D. Angluin. Queries and concept learning. Machine Learning, 2:319\u2013342, 1988.","journal-title":"Machine Learning"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"S. Arikawa, S. Kuhara, S. Miyano, A. Shinohara, and T. Shinohara. A learning algorithm for elementary formal systems and its experiments on identification of transmembrane domains. In Proc. the 25th HICSS, 675\u2013684, 1992.","DOI":"10.1109\/HICSS.1992.183220"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"H. Arimura, T. Shinohara, and S. Otsuki. A polynomial time algorithm for finding finite unions of tree pattern languages. In Proc. the 2nd NIL, LNAI 659, Springer-Verlag, 118\u2013131, 1991.","DOI":"10.1007\/BFb0030389"},{"key":"5_CR5","doi-asserted-by":"crossref","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. In Proc. the 11th STACS, LNCS 775, Springer-Verlag, 649\u2013660, 1994.","DOI":"10.1007\/3-540-57785-8_178"},{"key":"5_CR6","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1093\/oso\/9780198538509.003.0003","volume":"13","author":"H. Arimura","year":"1994","unstructured":"H. Arimura, H. Ishizaka, T. Shinohara, and S. Otsuki. A generalization of the least general generalization. Machine Intelligence, 13, 59\u201385, Oxford Univ. Press, 1994.","journal-title":"Machine Intelligence"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"M. Frazier and L. Pitt. Classic Learning. In Proc. COLT'94, 23\u201334, 1994.","DOI":"10.1145\/180139.174994"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"H. Ishizaka, H. Arimura, and T. Shinohara. Finding tree patterns consistent with positive and negative examples using queries In Proc. ALT'94, LNAI872, 317\u2013332, 1994.","DOI":"10.1007\/3-540-58520-6_74"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"T. Jiang, A. Salomaa, K. Salomaa, and S. Yu. Inclusion is undecidable for pattern languages. In Proc. 20th ICALP, pp. 301\u2013312, LNCS 700, Springer, 1993.","DOI":"10.1007\/3-540-56939-1_81"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"G. Kuper, K. McAloon, K. Palem, K. Perry. Efficient Parallel Algorithm for Anti-Unification and Relative Complement. In Proc. the 3rd LICS, 111\u2013120, 1988.","DOI":"10.1109\/LICS.1988.5109"},{"key":"5_CR11","first-page":"285","volume":"2","author":"N. Littlestone","year":"1988","unstructured":"N. Littlestone. Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning, 2, 285\u2013318, 1988.","journal-title":"Machine Learning"},{"key":"5_CR12","first-page":"107","volume":"9","author":"W. Maass","year":"1992","unstructured":"W. Maass and G. Tur\u00e1n. Lower bound methods and separation results for on-line learning models. Machine Learning, 9, 107\u2013145, 1992.","journal-title":"Machine Learning"},{"key":"5_CR13","unstructured":"C. D. Page Jr. and A. M. Frisch. Generalization and Learnability: A Study of Constrained Atoms. S. Muggleton, editor, Inductive Logic Programming, 29\u201361, 1992."},{"key":"5_CR14","doi-asserted-by":"crossref","first-page":"965","DOI":"10.1145\/48014.63140","volume":"35","author":"L. Pitt","year":"1988","unstructured":"L. Pitt and L. G. Valiant. Computational limitations on learning from examples. JACM, 35:965\u2013984, 1988.","journal-title":"JACM"},{"key":"5_CR15","first-page":"430","volume":"41","author":"L. Pitt","year":"1990","unstructured":"L. Pitt and M. K. Warmuth. Prediction preserving reduction. JCSS, 41:430\u2013467, 1990.","journal-title":"JCSS"},{"key":"5_CR16","unstructured":"G. D. Plotkin. A note on inductive generalization. In Machine Intelligence 5, 153\u2013163. Edinburgh University Press, 1970."},{"key":"5_CR17","unstructured":"J. C. Reynolds. Transformational systems and the algebraic structure of atomic formulas. In Machine Intelligence 5, 135\u2013152. Edinburgh University Press, 1970."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60454-5_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,20]],"date-time":"2024-04-20T16:58:10Z","timestamp":1713632290000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60454-5_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540604549","9783540474708"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-60454-5_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}