Cited by 271Web Data Mining and AnalysisInformation Retrieval and Search BehaviorData Mining Algorithms and Applications

Template detection via data mining and its applications

Bar-Yossef, Ziv, Rajagopalan, Sridhar·2002·Proceedings of the 11th international conference on World Wide Web

Abstract

We formulate and propose the template detection problem, and suggest a practical solution for it based on counting frequent item sets. We show that the use of templates is pervasive on the web. We describe three principles, which characterize the assumptions made by hypertext information retrieval (IR) and data mining (DM) systems, and show that templates are a major source of violation of these principles. As a consequence, basic "pure" implementations of simple search algorithms coupled with template detection and elimination show surprising increases in precision at all levels of recall.

Integrity signals

Registry

Crossref · 10.1145/511446.511522

Cites

26 of 26 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Intra-host linkage patterns are more regular and predictable than inter-host linkage patterns, due to the prevalent use of templates in Web sites.

    “Furthermore, intra-host linkage patterns are more regular and predictable than inter-host linkage patterns, due to the prevalent use of templates in Web sites (Bar-Yossef and Rajagopalan, 2002).”

    From Efficient PageRank approximation via graph aggregation (2006) · cites this paper as Bar-Yossef and Rajagopalan, 2002

Cites

Flagged first, then by citations

1 of the 27 references couldn’t be matched to a known paper.

Cited by

Sorted by citations

Authors
Bar-Yossef, Z., & Rajagopalan, S.
Affiliations
  • University of California, Berkeley (US)
  • IBM Research - Almaden (US)
Venue
Proceedings of the 11th international conference on World Wide Web
Publisher
ACM
Published
2002-05-07
Pages
580-591
OpenAlex
W2040075907
Cited by
271
References
27
Citations by year
2026: 2 · 2025: 1 · 2023: 4 · 2022: 4 · 2021: 1 · 2020: 3 · 2019: 4 · 2018: 6 · 2017: 2 · 2016: 14 · 2015: 20 · 2014: 17 · 2013: 18 · 2012: 15
FWCI
15.05
Type
conference paper
Language
en
Open access
closed
Locations
International World Wide Web Conference (WWW) (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Information Systems › Web Data Mining and Analysis
  • Physical Sciences › Computer Science › Information Systems › Information Retrieval and Search Behavior
  • Physical Sciences › Computer Science › Information Systems › Data Mining Algorithms and Applications
Keywords
template detection, web templates, search precision, web search

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