The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Automatic web news extraction using tree edit distance
Abstract
The Web poses itself as the largest data repository ever available in the history of humankind. Major efforts have been made in order to provide efficient access to relevant information within this huge repository of data. Although several techniques have been developed to the problem of Web data extraction, their use is still not spread, mostly because of the need for high human intervention and the low quality of the extraction results.In this paper, we present a domain-oriented approach to Web data extraction and discuss its application to automatically extracting news from Web sites. Our approach is based on a highly efficient tree structure analysis that produces very effective results. We have tested our approach with several important Brazilian on-line news sites and achieved very precise results, correctly extracting 87.71% of the news in a set of 4088 pages distributed among 35 different sites.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Baeza-Yates, R. A., & Ribeiro-Neto, B. A. (1999) · Cited by 11,505
RoadRunner: Towards Automatic Data Extraction from Large Web Sites
Crescenzi, V., Mecca, G., & Merialdo, P. (2001) · Iris (Roma Tre University) · Cited by 1,043
The Tree-to-Tree Correction Problem
Tai, K.-C. (1979) · Journal of the ACM · doi:10.1145/322139.322143 · Cited by 865
Proceedings of the 27th International Conference on Very Large Data Bases
Apers, P. M. G., Atzeni, P., Ceri, S., Paraboschi, S., Ramamohanarao, K., & Snodgrass, R. T. (2001) · Cited by 845
Extracting structured data from Web pages
Arasu, A., & García-Molina, H. (2003) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/872757.872799 · Cited by 756
Recent trends in hierarchic document clustering: A critical review
Willett, P. (1988) · Information Processing & Management · doi:10.1016/0306-4573(88)90027-1 · Cited by 705
Mercator: A scalable, extensible Web crawler
Heydon, A., & Najork, M. (1999) · World Wide Web · doi:10.1023/a:1019213109274 · Cited by 582
Database techniques for the World-Wide Web: a survey
Florescu, D., Levy, A., & Mendelzon, A. (1998) · ACM SIGMOD Record · doi:10.1145/290593.290605 · Cited by 561
The tree-to-tree editing problem
Selkow, S. M. (1977) · Information Processing Letters · doi:10.1016/0020-0190(77)90064-3 · Cited by 474
On the editing distance between unordered labeled trees
Zhang, K., Statman, R., & Shasha, D. E. (1992) · Information Processing Letters · doi:10.1016/0020-0190(92)90136-j · Cited by 359
Cited by
Web data extraction based on partial tree alignment
Zhai, Y., & Liu, B. (2005) · Proceedings of the 14th international conference on World Wide Web - WWW '05 · doi:10.1145/1060745.1060761 · Cited by 496
Web data extraction, applications and techniques: A survey
Ferrara, E., De Meo, P., Fiumara, G., & Baumgartner, R. (2014) · Knowledge-Based Systems · doi:10.1016/j.knosys.2014.07.007 · Cited by 396
Soldani, J., & Brogi, A. (2023) · ACM Computing Surveys · doi:10.1145/3501297 · Cited by 256
Detecting anomalies in microservices with execution trace comparison
Meng, L., Ji, F., Sun, Y., & Wang, T. (2021) · Future Generation Computer Systems · doi:10.1016/j.future.2020.10.040 · Cited by 70
Workflow-Aware Automatic Fault Diagnosis for Microservice-Based Applications With Statistics
Wang, T., Zhang, W., Xu, J., & Gu, Z. (2020) · IEEE Transactions on Network and Service Management · doi:10.1109/tnsm.2020.3022028 · Cited by 54
Metadata
- Authors
- Reis, D. C., Golgher, P. B., Silva, A. S., & Laender, A. F.
- Venue
- Proceedings of the 13th international conference on World Wide Web
- Publisher
- ACM
- Published
- 2004-05-17
- Pages
- 502-511
- OpenAlex
- W2129595335
- Cited by
- 342
- References
- 14
- FWCI
- 21.14
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Automatic web news extraction using tree edit distance. https://app.cochat.ai/papers/10.1145/988672.988740
- The paper
- Reis, D. C., Golgher, P. B., Silva, A. S., & Laender, A. F. (2004). Automatic web news extraction using tree edit distance. Proceedings of the 13th international conference on World Wide Web. https://doi.org/10.1145/988672.988740
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.