The DOI matches its Crossref record; 26 of the 27 references it cites were found in a registry or an index.
Template detection via data mining and its applications
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.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
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?
In the citing paper
“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
Citations
Cites
The anatomy of a large-scale hypertextual Web search engine
Brin, S., & Page, L. (1998) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(98)00110-x · Cited by 16,004
(1999) · Cited by 12,854
Fast Algorithms for Mining Association Rules in Large Databases
Agrawal, R., & Srikant, R. (1994) · Very Large Data Bases · Cited by 9,454
Authoritative sources in a hyperlinked environment
Kleinberg, J. M. (1999) · Journal of the ACM · doi:10.1145/324133.324140 · Cited by 9,032
Co‐citation in the scientific literature: A new measure of the relationship between two documents
Small, H. (1973) · Journal of the American Society for Information Science · doi:10.1002/asi.4630240406 · Cited by 5,345
Bibliographic coupling between scientific papers
Kessler, M. M. (1963) · American Documentation · doi:10.1002/asi.5090140103 · Cited by 3,122
Bush, V. (1945) · Cited by 2,998
Garfield, E. (1972) · Science · doi:10.1126/science.178.4060.471 · Cited by 2,788
Focused crawling: a new approach to topic-specific Web resource discovery
Chakrabarti, S., van den Berg, M., & Dom, B. (1999) · Computer Networks · doi:10.1016/s1389-1286(99)00052-3 · Cited by 1,487
Syntactic clustering of the Web
Broder, A., Glassman, S. C., Manasse, M. S., & Zweig, G. (1997) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(97)00031-7 · Cited by 1,348
Cited by
Sorted by citations
Data Mining: Concepts and Techniques (2nd edition)
Han, J., & Kamber, M. (2006) · Cited by 968
On the bursty evolution of blogspace
Kumar, R., Novak, J., Raghavan, P., & Tomkins, A. (2003) · International World Wide Web Conference (WWW) · doi:10.1145/775152.775233 · Cited by 563
VIPS: a Vision-based Page Segmentation Algorithm
Cai, D., Yu, S., Wen, J.-R., & Ma, W. (2003) · Cited by 521
Web data extraction based on partial tree alignment
Zhai, Y., & Liu, B. (2005) · International World Wide Web Conference (WWW) · doi:10.1145/1060745.1060761 · Cited by 495
Boilerplate detection using shallow text features
Kohlschütter, C., Fankhauser, P., & Nejdl, W. (2010) · ACM International Conference on Web Search and Data Mining (WSDM) · doi:10.1145/1718487.1718542 · Cited by 478
Metadata
- 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
