{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T17:11:14Z","timestamp":1725729074906},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642388118"},{"type":"electronic","value":"9783642388125"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38812-5_18","type":"book-chapter","created":{"date-parts":[[2013,6,3]],"date-time":"2013-06-03T21:10:03Z","timestamp":1370293803000},"page":"257-272","source":"Crossref","is-referenced-by-count":4,"title":["Learning Unordered Tree Contraction Patterns in Polynomial Time"],"prefix":"10.1007","author":[{"given":"Yuta","family":"Yoshimura","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takayoshi","family":"Shoudai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"18_CR1","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1023\/A:1010971904477","volume":"44","author":"T.R. Amoth","year":"2001","unstructured":"Amoth, T.R., Cull, P., Tadepalli, P.: On exact learning of unordered tree patterns. Machine Learning\u00a044(3), 211\u2013243 (2001)","journal-title":"Machine Learning"},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/S0019-9958(80)90285-5","volume":"45","author":"D. Angluin","year":"1980","unstructured":"Angluin, D.: Inductive inference of formal languages from positive data. Information and Control\u00a045, 117\u2013135 (1980)","journal-title":"Information and Control"},{"key":"18_CR3","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman (1979)"},{"key":"18_CR4","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/3-540-46769-6_29","volume-title":"Algorithmic Learning Theory","author":"S.A. Goldman","year":"1999","unstructured":"Goldman, S.A., Kwek, S.S.: On learning unions of pattern languages and tree patterns. In: Watanabe, O., Yokomori, T. (eds.) ALT 1999. LNCS (LNAI), vol.\u00a01720, pp. 347\u2013363. Springer, Heidelberg (1999)"},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"J.E. Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Karp, R.M.: An n\n                5\/2 algorithm for maximum matchings in bipartite graphs. SIAM Journal on Computing\u00a02, 225\u2013231 (1973)","journal-title":"SIAM Journal on Computing"},{"key":"18_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/3-540-45571-X_4","volume-title":"Knowledge Discovery and Data Mining. Current Issues and New Applications","author":"T. Miyahara","year":"2000","unstructured":"Miyahara, T., Shoudai, T., Uchida, T., Takahashi, K., Ueda, H.: Polynomial time matching algorithms for tree-like structured patterns in knowledge discovery. In: Terano, T., Liu, H., Chen, A.L.P. (eds.) PAKDD 2000. LNCS, vol.\u00a01805, pp. 5\u201316. Springer, Heidelberg (2000)"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Nestorov, S., Abiteboul, S., Motwani, R.: Extracting schema from semistructured data. In: Proc. ACM SIGMOD Int. Conf. Management of Data, pp. 295\u2013306 (1998)","DOI":"10.1145\/276305.276331"},{"key":"18_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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 inductive inference of extended regular pattern languages. In: Goto, E., Furukawa, K., Nakajima, R., Nakata, I., Yonezawa, A. (eds.) RIMS 1982. LNCS, vol.\u00a0147, pp. 115\u2013127. Springer, Heidelberg (1983)"},{"key":"18_CR9","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":"18_CR10","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/978-3-540-39624-6_11","volume-title":"Algorithmic Learning Theory","author":"Y. Suzuki","year":"2003","unstructured":"Suzuki, Y., Shoudai, T., Matsumoto, S., Uchida, T., Miyahara, T.: Efficient learning of ordered and unordered tree patterns with contractible variables. In: Gavald\u00e1, R., Jantke, K.P., Takimoto, E. (eds.) ALT 2003. LNCS (LNAI), vol.\u00a02842, pp. 114\u2013128. Springer, Heidelberg (2003)"},{"key":"18_CR11","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1109\/69.846290","volume":"12","author":"K. Wang","year":"2000","unstructured":"Wang, K., Liu, H.: Discovering structural association of semistructured data. IEEE Trans. Knowledge and Data Engineering\u00a012, 353\u2013371 (2000)","journal-title":"IEEE Trans. Knowledge and Data Engineering"}],"container-title":["Lecture Notes in Computer Science","Inductive Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38812-5_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T13:24:35Z","timestamp":1557753875000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38812-5_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642388118","9783642388125"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38812-5_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}