Automatic web news extraction using tree edit distance

Thirteenth International World Wide Web Conference Proceedings, WWW2004

Volumn , Issue , 2004, Pages 502-511

  De Reis, Davi Castro ^a,b   Golgher, Paulo B ^b   Da Silva, Altigran S ^c   Laender, Alberto H F ^a  

^a FEDERAL UNIVERSITY OF MINAS GERAIS   (Brazil)

^b Akwan Information Technologies   (Brazil)

^c FEDERAL UNIVERSITY OF AMAZONAS   (Brazil)

Author keywords

Data extraction; Edit distance; Electronic news; Schema; Trees

Indexed keywords

ALGORITHMS; DATA REDUCTION; DATA STRUCTURES; HTML; IDENTIFICATION (CONTROL SYSTEMS); INFORMATION ANALYSIS; INFORMATION RETRIEVAL; OBJECT ORIENTED PROGRAMMING;

DATA EXTRACTION; EDIT DISTANCE; ELECTRONIC NEWS; SCHEMA; TREES;

WORLD WIDE WEB;

EID: 4644340823     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (27)

1. A. Arasu, H. Garcia-Molina, and S. University. Extracting structured data from web pages. In Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, pages 337-348. ACM Press, 2003.
2. L. Arllota, V. Crescenzi, G. Mecca, and P. Merialdo. Automatic annotation of data extraction from large Web sites. In Proceedings of the International Workshop on the Web and Databases, pages 7-12, San Diego, USA, 2003.
3. R. Baeza-Yates and B. Ribeiro-Neto. Modern Information Retrieval. Addison-Wesley, Harlow, England, 1st edition, 1999.
4. V. Boyapati, K. Chevrier, A. Finkel, N. Glance, T. Pierce, R. Stockton, and C. Whitmer. Changedetector™: a site-level monitoring tool for the WWW. In Proceedings of the 11th International Conference on World Wide Web, pages 570-579. ACM Press, 2002.
5. S. S. Chawathe. Comparing hierarchical data in external memory. In Proceedings of the 25th International Conference on Very Large Data Bases, pages 90-101, Edinburgh, Scotland, U.K., 1999.
6. W. Chen. New algorithm for ordered tree-to-tree correction problem. Journal of Algorithms, 40:135-158, 2001.
7. V. Crescenzi, G. Mecca, and P. Merialdo. RoadRunner: Towards automatic data extraction from large Web sites. In Proceedings of the 27th International Conference on Very Large Data Bases, pages 109-118, Rome, Italy, 2001.
8. V. Crescenzi, G. Mecca, and P. Merialdo. Wrapping-oriented classification of Web pages. In Proceedings of the 2002 ACM Symposium on Applied Computing, pages 1108-1112. ACM Press, 2002.
9. D. Florescu, A. Levy, and A. Mendelzon. Database techniques for the world-wide web: a survey. SIGMOD Rec., 27(3):59-74, 1998.
10. M. Garofalakis, A. Gionis, R. Rastogi, S. Seshadri, and K. Shim. Xtract: a system for extracting document type descriptors from xml documents. In Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, pages 165-176. ACM Press, 2000.
11. S. Grumbach and G. Mecca. In search of the lost schema. In C. Beeri and P. Buneman, editors, Proceedings of 7th International Conference on Database Theory, Lecture Notes in Computer Science, pages 314-331, Jerusalem, Israel, 1999. Springer.
12. A. Heydon and M. Najork. Mercator: A scalable, extensible web crawler. World Wide Web, 2(4):219-229, 1999.
13. A. Laender, B. Ribeiro-Neto, A. Silva, and J. S. Teixeira. A brief survey of Web data extraction tools. SIGMOD Record, 31(2):84-93, 2002.
14. B. Liu, R. Grossman, and Y. Zhai. Mining data records in web pages. In Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 601-606. ACM Press, 2003.
15. J.-K. Min, J.-Y. Ahn, and C.-W. Chung. Efficient extraction of schemas for xml documents. Information Processing Letters, 85(1):7-12, 2003.
16. A. Nierman and H. V. Jagadish. Evaluating structural similarity in XML documents. In Proceedings of the 5th International Workshop on the Web and Databases (WebDB 2002), Madison, Wisconsin, USA, June 2002.
17. S. M. Selkow. The tree-to-tree editing problem. Information Processing Letters, 6:184-186, Dec. 1977.
18. K.-C. Tai. The tree-to-tree correction problem. J. ACM, 26(3):422-433, 1979.
19. G. Valiente. An efficient bottom-up distance between trees. In Proceedings of the 8th International Symposium on String Processing and Information Retrieval, pages 212-219, Santiago, Chile, 2001. IEEE Computer Science Press.
20. G. Valiente. Tree edit distance and common subtrees. Research Report LSI-02-20-R, Universitat Politècnica de Catalunya, Barcelona, Spain, 2002.
21. J. T.-L. Wang, B. A. Shapiro, D. Shasha, K. Zhang, and K. M. Currey. An algorithm for finding the largest approximately common substructures of two trees. IEEE Transactions on Pattern Analysis and Machine Intelligence, 20(8):889-895, 1998.
22. J. T. L. Wang and K. Zhang. Finding similar consensus between trees: an algorithm and a distance hierarchy. Pattern Recognition, 34:127-137, 2001.
23. P. Willett. Recent trends in hierarchic document clustering: a critical review. Information Processing and Management, 24(5):577-597, 1988.
24. G. Yang, I. V. Ramakrishnan, and M. Kifer. On the complexity of schema inference from web pages in the presence of nullable data attributes. In Proceedings of the 12th International Conference on Information and Knowledge Management, pages 224-231. ACM Press, 2003.
25. W. Yang. Identifying syntactic differences between two programs. Softw. Pract. Exper., 21(7):739-755, 1991.
26. K. Zhang, D. Shasha, and J. T. L. Wang. Approximate tree matching in the presence of variable length don't cares. J. Algorithms, 16(1):33-66, 1994.
27. K. Zhang, R. Statman, and D. Shasha. On the editing distance between unordered labeled trees. Information Processing Letters, 42(3):133-139, 1992.