{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:46:11Z","timestamp":1725558371983},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540202912"},{"type":"electronic","value":"9783540396246"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39624-6_11","type":"book-chapter","created":{"date-parts":[[2010,6,28]],"date-time":"2010-06-28T04:01:51Z","timestamp":1277697711000},"page":"114-128","source":"Crossref","is-referenced-by-count":4,"title":["Efficient Learning of Ordered and Unordered Tree Patterns with Contractible Variables"],"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":"Satoshi","family":"Matsumoto","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","reference":[{"key":"11_CR1","volume-title":"Data on the Web: From Relations to Semistructured Data and XML","author":"S. Abiteboul","year":"2000","unstructured":"Abiteboul, S., Buneman, P., Suciu, D.: Data on the Web: From Relations to Semistructured Data and XML. Morgan Kaufmann, San Francisco (2000)"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Amer-Yahia, S., Cho, S., Lakshmanan, L.V.S., Srivastava, D.: Minimization of Tree Pattern Queries. In: Proc. ACM SIGMOD 2001, pp. 497\u2013508 (2001)","DOI":"10.1145\/375663.375730"},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1145\/307400.307486","volume-title":"Proc. COLT 1999","author":"T.R. Amoth","year":"1999","unstructured":"Amoth, T.R., Cull, P., Tadepalli, P.: Exact learning of unordered tree patterns from queries. In: Proc. COLT 1999, pp. 323\u2013332. ACM Press, New York (1999)"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/0022-0000(80)90041-0","volume":"21","author":"D. Angluin","year":"1980","unstructured":"Angluin, D.: Finding patterns common to a set of strings. Journal of Computer and System Science\u00a021, 46\u201362 (1980)","journal-title":"Journal of Computer and System Science"},{"key":"11_CR5","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/3-540-45583-3_24","volume-title":"Algorithmic Learning Theory","author":"H. Arimura","year":"2001","unstructured":"Arimura, H., Sakamoto, H., Arikawa, S.: Efficient learning of semi-structured data from queries. In: Abe, N., Khardon, R., Zeugmann, T. (eds.) ALT 2001. LNCS (LNAI), vol.\u00a02225, pp. 315\u2013331. Springer, Heidelberg (2001)"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Asai, T., Abe, K., Kawasoe, S., Arimura, H., Sakamoto, H., Arikawa, S.: Efficient Substructure Discovery from Large Semi-structured Data. In: Proc. of the Second SIAM International Conference on Data Mining, pp. 158\u2013174 (2002)","DOI":"10.1137\/1.9781611972726.10"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1007\/3-540-63577-7_45","volume-title":"Algorithmic Learning Theory","author":"S. Matsumoto","year":"1997","unstructured":"Matsumoto, S., Hayashi, Y., Shoudai, T.: Polynomial time inductive inference of regular term tree languages from positive data. In: Li, M. (ed.) ALT 1997. LNCS, vol.\u00a01316, pp. 212\u2013227. Springer, Heidelberg (1997)"},{"key":"11_CR8","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/3-540-36187-1_46","volume-title":"AI 2002: Advances in Artificial Intelligence","author":"S. Matsumoto","year":"2002","unstructured":"Matsumoto, S., Shoudai, T., Miyahara, T., Uchida, T.: Learning of finite unions of tree patterns with internal structured variables from queries. In: McKay, B., Slaney, J.K. (eds.) Canadian AI 2002. LNCS (LNAI), vol.\u00a02557, pp. 523\u2013534. Springer, Heidelberg (2002)"},{"key":"11_CR9","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/3-540-48751-4_21","volume-title":"Inductive Logic Programming","author":"T. Miyahara","year":"1999","unstructured":"Miyahara, T., Shoudai, T., Uchida, T., Kuboyama, K., Takahashi, K., Ueda, H.: Discovering New Knowledge from Graph Data Using Inductive Logic Programming. In: D\u017eeroski, S., Flach, P.A. (eds.) ILP 1999. LNCS (LNAI), vol.\u00a01634, pp. 222\u2013233. Springer, Heidelberg (1999)"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Miyahara, T., Suzuki, Y., Shoudai, T., Uchida, T., Hirokawa, S., Takahashi, K., Ueda, H.: Extraction of Tag Tree Patterns with Contractible Variables from Irregular Semistructured data. In: PAKDD 2003, vol.\u00a02637, pp. 430\u2013436. Springer, Heidelberg (2003)","DOI":"10.1007\/3-540-36175-8_43"},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/3-540-11980-9_19","volume-title":"RIMS Symposium on Software Science and Engineering","author":"T. Shinohara","year":"1983","unstructured":"Shinohara, T.: Polynomial time inference of extended regular pattern languages. In: Goto, E., Nakajima, R., Yonezawa, A., Nakata, I., Furukawa, K. (eds.) RIMS 1982. LNCS, vol.\u00a0147, pp. 115\u2013127. Springer, Heidelberg (1983)"},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/3-540-44669-9_32","volume-title":"Fundamentals of Computation Theory","author":"T. Shoudai","year":"2001","unstructured":"Shoudai, T., Uchida, T., Miyahara, T.: Polynomial time algorithms for finding unordered tree patterns with internal variables. In: Freivalds, R. (ed.) FCT 2001. LNCS, vol.\u00a02138, pp. 335\u2013346. Springer, Heidelberg (2001)"},{"key":"11_CR13","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/3-540-45435-7_12","volume-title":"Computational Learning Theory","author":"T. Uchida","year":"2002","unstructured":"Uchida, T.: Polynomial time inductive inference of ordered tree patterns with internal structured variables from positive data. In: Kivinen, J., Sloan, R.H. (eds.) COLT 2002. LNCS (LNAI), vol.\u00a02375, pp. 169\u2013184. Springer, Heidelberg (2002)"},{"key":"11_CR14","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/3-540-36169-3_17","volume-title":"Algorithmic Learning Theory","author":"Y. Suzuki","year":"2002","unstructured":"Suzuki, Y., Shoudai, T., Uchida, T., Miyahara, T.: Ordered term tree languages which are polynomial time inductively inferable from positive data. In: Cesa-Bianchi, N., Numao, M., Reischuk, R. (eds.) ALT 2002. LNCS (LNAI), vol.\u00a02533, pp. 188\u2013202. Springer, Heidelberg (2002)"},{"key":"11_CR15","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/978-3-540-39917-9_23","volume-title":"Inductive Logic Programming","author":"Y. Suzuki","year":"2003","unstructured":"Suzuki, Y., Shoudai, T., Matsumoto, S., Uchida, T.: Efficient Learning of Unlabeled Term Trees with Contractible Variables from Positive Data. In: Horv\u00e1th, T., Yamamoto, A. (eds.) ILP 2003. LNCS (LNAI), vol.\u00a02835, pp. 347\u2013364. Springer, Heidelberg (2003) (to appear)"},{"key":"11_CR16","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/3-540-36169-3_24","volume-title":"Algorithmic Learning Theory","author":"J. Uemura","year":"2002","unstructured":"Uemura, J., Sato, M.: Compactness and Learning of Classes of Unions of Erasing Regular Pattern Languages. In: Cesa-Bianchi, N., Numao, M., Reischuk, R. (eds.) ALT 2002. LNCS (LNAI), vol.\u00a02533, pp. 293\u2013307. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-39624-6_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T04:03:40Z","timestamp":1620014620000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39624-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540202912","9783540396246"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39624-6_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}