Abstract
In the field of Web mining, a Web page can be represented by a rooted tree T such that every internal vertex of T has ordered children and string data such as tags or texts are assigned to edges of T. A term tree is an ordered tree pattern, which has ordered tree structures and variables, and is suited for a representation of a tree structured pattern in Web pages. A term tree t is allowed to have a repeated variable which occurs in t more than once. In this paper, we consider the learnability of finite unions of term trees with repeated variables in the query learning model of Angluin (1988). We present polynomial time learning algorithms for finite unions of term trees with repeated variables by using superset and restricted equivalence queries. Moreover we show that there exists no polynomial time learning algorithm for finite unions of term trees by using restricted equivalence, membership and subset queries. This result indicates the hardness of learning finite unions of term trees in the query learning model.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abiteboul, S., Buneman, P., Suciu, D.: Data on the Web: From Relations to Semistructured Data and XML. Morgan Kaufmann, San Francisco (2000)
Amoth, T.R., Cull, P., Tadepalli, P.: Exact learning of tree patterns from queries and counterexamples. In: Proc. COLT 1998, pp. 175–186. ACM Press, New York (1998)
Amoth, T.R., Cull, P., Tadepalli, P.: Exact learning of unordered tree patterns from queries. In: Proc. COLT 1999, pp. 323–332. ACM Press, New York (1999)
Angluin, D.: Finding pattern common to a set of strings. Journal of Computer and System Sciences 21, 46–62 (1980)
Angluin, D.: Queries and concept learning. Machine Learning 2, 319–342 (1988)
Arimura, H., Ishizaka, H., Shinohara, T.: Learning unions of tree patterns using queries. Theoretical Computer Science 185(1), 47–62 (1997)
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. 2225, pp. 315–331. Springer, Heidelberg (2001)
Arimura, H., Shinohara, T., Otsuki, S.: Polynomial time algorithm for finding finite unions of tree pattern languages. In: Brewka, G., Jantke, K.P., Schmitt, P.H. (eds.) NIL 1991. LNCS (LNAI), vol. 659, pp. 118–131. Springer, Heidelberg (1993)
Lovász, L.: Two classical enumeration problems in graph theory. In: Lovász, L. (ed.) Combinatorial Problems and Exercises, North-Holland Publishing Company, Amsterdam (1979)
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. 2557, pp. 523–534. Springer, Heidelberg (2002)
Matsumoto, S., Shoudai, T., Miyahara, T., Uchida, T.: Learning unions of term tree languages using queries. In: Proceedings of LA Summer Symposium, July 2002, pp. 21–10 (2002)
Miyahara, T., Suzuki, Y., Shoudai, T., Uchida, T., Takahashi, K., Ueda, H.: Discovery of frequent tag tree patterns in semistructured web documents. In: Chen, M.-S., Yu, P.S., Liu, B. (eds.) PAKDD 2002. LNCS (LNAI), vol. 2336, pp. 341–355. Springer, Heidelberg (2002)
Suzuki, Y., Akanuma, R., Shoudai, T., Miyahara, T., 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. 2375, pp. 169–184. Springer, Heidelberg (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Matsumoto, S., Suzuki, Y., Shoudai, T., Miyahara, T., Uchida, T. (2003). Learning of Finite Unions of Tree Patterns with Repeated Internal Structured Variables from Queries. In: Gavaldá, R., Jantke, K.P., Takimoto, E. (eds) Algorithmic Learning Theory. ALT 2003. Lecture Notes in Computer Science(), vol 2842. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39624-6_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-39624-6_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20291-2
Online ISBN: 978-3-540-39624-6
eBook Packages: Springer Book Archive