Knowledge discovery from semistructured texts

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

Volumn 2281, Issue , 2002, Pages 586-599

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

^a KYUSHU UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

HTML;

HETEROGENEOUS STRUCTURES; HTML DOCUMENTS; LABELED TREES; PAPER SURVEYS; REAL-WORLD; REWRITING RULES; SEMI-STRUCTURED TEXT; WRAPPER INDUCTION;

FORESTRY;

EID: 84867652833     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45884-0_45     Document Type: Review

References (21)

1. S. Abiteboul, P. Buneman, D. Suciu, Data on theWeb: From relations to semistructured data and XML, Morgan Kaufmann, San Francisco, CA, 2000.
2. D. Angluin, Queries and concept learning, Machine Learning vol.2, pp.319-342, 1988.
3. H. Arimura, Learning Acyclic First-order Horn Sentences From Entailment, Proc. 7th Int. Workshop on Algorithmic Learning Theory, LNAI 1316, pp.432-445, 1997.
4. H. Arimura, H. Ishizaka, T. Shinohara, Learning unions of tree patterns using queries, Theoretical Computer Science vol.185, pp.47-62, 1997.
5. W. W. Cohen, W. Fan, Learning Page-Independent Heuristics for Extracting Data from Web Pages, Proc. WWW-99, 1999.
6. M. Craven, D. DiPasquo, D. Freitag, A. McCallum, T. Mitchell, K. Nigam, S. Slattery, Learning to construct knowledge bases from the World Wide Web, Artificial Intelligence vol. 118 pp. 69-113, 2000.
7. N. Dershowitz, J.-P. Jouannaud, Rewrite Systems, Chapter 6, Formal Models and Semantics, Handbook of Theoretical Computer Science Vol. B, Elseveir, 1990.
8. F. Drewes, Computation by Tree Transductions, Ph D. Thesis, University of Bremen, Department of Mathematics and Informatics, February 1996.
9. M. Frazier, L. Pitt, Learning from entailment: an application to propositional Horn sentences, Proc. 10th Int. Conf. Machine Learning, pp.120-127, 1993.
10. D. Freitag, Information extraction from HTML: Application of a general machine learning approach. Proc. the Fifteenth National Conference on Artificial Intelligence, pp. 517-523, 1998.
11. K. Hirata, K. Yamada, H. Harao, Tractable and intractable second-order matching problems. Proc. 5th Annual International Computing and Combinatorics Conference, LNCS 1627, pp. 432-441, 1999.
12. J. Hammer, H. Garcia-Molina, J. Cho, A. Crespo, Extracting semistructured information from the Web. Proc. the Workshop on Management of Semistructured Data, pp. 18-25, 1997.
13. C.-H. Hsu, Initial results on wrapping semistructured web pages with finite-state transducers and contextual rules. In papers from the 1998 Workshop on AI and Information Integration, pp. 66-73, 1998.
14. R. Khardon, Learning function-free Horn expressions, Proc. COLT'98, pp. 154-165, 1998.
15. P. Kilpelainen, H. Mannila, Ordered and unordered tree inclusion, SIAM J. Comput., vol. 24, pp.340-356, 1995.
16. N. Kushmerick, Wrapper induction: efficiency and expressiveness. Artificial Intelligence vol. 118, pp. 15-68, 2000.
17. I. Muslea, S. Minton, C. A. Knoblock, Wrapper induction for semistructured, web-based information sources. Proc. the Conference on Automated Learning and Discovery, 1998.
18. H. Sakamoto, H. Arimura, S. Arikawa, Identification of tree translation rules from examples. Proc. 5th International Colloquium on Grammatical Inference. LNAI 1891, pp. 241-255, 2000.
19. H. Sakamoto, Y. Murakami, H. Arimura, S. Arikawa, Extracting Partial Structures from HTML Documents, Proc. the 14the International FLAIRS Conference, pp. 264-268, 2001, AAAI Press.
20. K. Taniguchi, H. Sakamoto, H. Arimura, S. Shimozono, S. Arikawa, Mining Semi-Structured Data by Path Expressions, Proc. the 4th International Conference on Discovery Science, (to appear).
21. L. G. Valiant, A theory of learnable, Commun. ACM vol.27, pp. 1134-1142, 1984.