Efficient learning of semi-structured data from Queries

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2225, Issue , 2001, Pages 315-331

  Arimura, Hiroki ^a,b   Sakamoto, Hiroshi ^a   Arikawa, Setsuo ^a  

^a KYUSHU UNIVERSITY   (Japan)

^b JAPAN SCIENCE AND TECHNOLOGY AGENCY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; EQUIVALENCE CLASSES; FORESTRY; POLYNOMIAL APPROXIMATION; QUERY LANGUAGES; QUERY PROCESSING; SEMANTICS;

EFFICIENT LEARNING; EQUIVALENCE QUERIES; MEMBERSHIP QUERY; POLYNOMIAL TIME LEARNABILITY; QUERY LEARNING MODELS; REGULAR PATTERNS; SEMI STRUCTURED DATA; SEMI-STRUCTURED;

LEARNING ALGORITHMS;

EID: 84948180435     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45583-3_24     Document Type: Conference Paper

References (21)

1. S. Abiteboul, Quass, McHugh, J. Widom, J. L. Wiener, The Lorel query language for semistructured data, Int’l. J. on Digital Libraries, 1(1), 68-88, 1997.
2. T. R. Amoth, P. Cull, and P. Tadepalli, Exact learning of unordered tree patterns from queries, In Proc. COLT’99, ACM Press, 323–332, 1999.
3. T. R. Amoth, P. Cull, and P. Tadepalli, Exact learning of tree patterns from queries and counterexamples, In Proc. COLT’98, ACM Press, 175-186, 1988.
4. D. Angluin, Finding patterns common to a set of strings, JCSS, 21, 46–62, 1980.
5. D. Angluin, Queries and concept learning, Machine Learning, 2(4), 319–342, 1988.
6. H. Arimura, H. Ishizaka, T. Shinohara, S. Otsuki, A generalization of the least general generalization, Machine Intelligence, 13, 59–85, 1994.
7. H. Arimura, H. Ishizaka, T. Shinohara, Learning unions of tree patterns using queries, Theoretical Computer Science, 185(1), 47–62, 1997.
8. H. Arimura, T. Shinohara, S. Otsuki, Finding minimal generalizations for unions of pattern languages and its application to inductive inference from positive data, In Proc. STACS’94, LNCS 775, Springer-Verlag, 649–660, 1994.
9. P. Buneman, M. F. Fernandez, D. Suciu, UnQL: A query language and algebra for semistructured data based on structural recursion, VLDB J., 9(1), 76–110, 2000.
10. M. Frazier, L. Pitt, Classic learning, Machine Learning, 25 (2-3), 151–193, 1996.
11. R. Khardon, Learning function-free Horn expressions, Mach. Learn., 35(1), 241–275, 1999.
12. K-I. Ko, A. Marron, Tzeng, Learning string patterns and tree patterns from examples, In Proc. 7th Internat. Conference on Machine Learning, 384–391, 1990.
13. Kosaraju, S. R., Efficient tree pattern matching, In Proc. 30th FOCS, 178–183, 1989.
14. N. Kushmerick, Wrapper induction: efficiency and expressiveness, Artificial Intelligence, Vol.118, pp.15–68, 2000.
15. S. Matsumoto and A. Shinohara, Learning Pattern Languages Using Queries, Proc. Euro COLT’97, LNAI, Springer-Verlag, 185–197, 1997.
16. J. Nessel and S. Lange, Learning erasing pattern languages with queries, Proc. ALT2000, LNAI 1968, Springer-Verlag, 86–100, 2000.
17. G. D. Plotkin, A note on inductive generalization, In Machine Intell., 5, Edinburgh Univ. Press, 153–163, 1970.
18. H. Sakamoto, Y. Murakami, H. Arimura, S. Arikawa, Extracting Partial Structures from HTML Documents, In Proc. FLAIRS 2001, AAAI Press, 2001.
19. Extensible Markup Language (XML) Version 1.0. W3C Recommendation 1998.
20. XML-QL: A Query Language for XML W3C Note, Aug. 1998.
21. L. Pitt, M. K. Warmuth, Prediction-preserving reducibility, J. Comput. System Sci. 41(3) (1990) 430–467.