The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Efficient and effective spam filtering and re-ranking for large web datasets
Open accessAbstract
The TREC 2009 web ad hoc and relevance feedback tasks used a new document collection, the ClueWeb09 dataset, which was crawled from the general web in early 2009. This dataset contains 1 billion web pages, a substantial fraction of which are spam—pages designed to deceive search engines so as to deliver an unwanted payload. We examine the effect of spam on the results of the TREC 2009 web ad hoc and relevance feedback tasks, which used the ClueWeb09 dataset. We show that a simple content-based classifier with minimal training is efficient enough to rank the “spamminess” of every page in the dataset using a standard personal computer in 48 hours, and effective enough to yield significant and substantive improvements in the fixed-cutoff precision (estP10) as well as rank measures (estR-Precision, StatMAP, MAP) of nearly all submitted runs. Moreover, using a set of “honeypot” queries the labeling of training data may be reduced to an entirely automatic process. The results of classical information retrieval methods are particularly enhanced by filtering—from among the worst to among the best.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Beyond PageRank: machine learning for static ranking
Richardson, M., Prakash, A., & Brill, E. (2006) · Proceedings of the 15th international conference on World Wide Web · doi:10.1145/1135777.1135881 · Cited by 169
On information retrieval metrics designed for evaluation with incomplete relevance assessments
Sakai, T., & Kando, N. (2008) · Information Retrieval · doi:10.1007/s10791-008-9059-7 · Cited by 136
Link analysis for Web spam detection
Becchetti, L., Castillo, C., Donato, D., Baeza-Yates, R. A., & Leonardi, S. (2008) · ACM Transactions on the Web · doi:10.1145/1326561.1326563 · Cited by 121
Evaluation over thousands of queries
Carterette, B., Pavlu, V., Kanoulas, E., Aslam, J. A., & Allan, J. (2008) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/1390334.1390445 · Cited by 104
Büttcher, S., Clarke, C. L. A., & Soboroff, I. M. (2006) · Cited by 74
Self-citationOnline Discriminative Spam Filter Training.
Goodman, J., & Yih, W.-T. (2006) · Cited by 71
On Collection Size and Retrieval Effectiveness
Hawking, D., & Robertson, S. E. (2003) · Information Retrieval · doi:10.1023/a:1022904715765 · Cited by 59
Lynam, T. R., Cormack, G. V., & Cheriton, D. R. (2006) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/1148170.1148195 · Cited by 48
Self-citationOverview of the TREC 2007 Legal Track.
Tomlinson, S., Oard, D. W., Baron, J. R., & Thompson, P. M. (2007) · Cited by 44
University of Glasgow at TREC 2009: Experiments with Terrier
McCreadie, R., MacDonald, C. M., Ounis, I., Peng, J., & Santos, R. L. T. (2009) · Cited by 40
Cited by
A Deep Relevance Matching Model for Ad-hoc Retrieval
Guo, J., Fan, Y., Ai, Q., & Croft, W. B. (2016) · Proceedings of the 25th ACM International on Conference on Information and Knowledge Management · doi:10.1145/2983323.2983769 · Cited by 806
Accurate and effective latent concept modeling for ad hoc information retrieval
Deveaud, R., SanJuan, E., & Bellot, P. (2014) · Document numérique · doi:10.3166/dn.17.1.61-84 · Cited by 609
Phishing Attacks: A Recent Comprehensive Study and a New Anatomy
Alkhalil, Z., Hewage, C., Nawaf, L., & Khan, I. (2021) · Frontiers in Computer Science · doi:10.3389/fcomp.2021.563060 · Cited by 524
Neural Ranking Models with Weak Supervision
Dehghani, M., Zamani, H., Severyn, A., Kamps, J., & Croft, W. B. (2017) · Proceedings of the 40th International ACM SIGIR Conference on Research and Development in Information Retrieval · doi:10.1145/3077136.3080832 · Cited by 299
Entity query feature expansion using knowledge base links
Dalton, J., Dietz, L., & Allan, J. (2014) · Proceedings of the 37th international ACM SIGIR conference on Research & development in information retrieval · doi:10.1145/2600428.2609628 · Cited by 257
Metadata
- Authors
- Cormack, G. V., Smucker, M. D., & Clarke, C. L. A.
- Venue
- Information Retrieval
- Published
- 2011-01-30
- Volume
- 14
- Issue
- 5
- Pages
- 441-465
- ISSN
- 1386-4564 (ISSN-L)
- 1573-7659
- OpenAlex
- W1685426458
- Cited by
- 282
- References
- 14
- FWCI
- 116.52
- Type
- journal article
- Language
- en
- Open access
- bronze
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: Efficient and effective spam filtering and re-ranking for large web datasets. https://app.cochat.ai/papers/10.1007/s10791-011-9162-z
- The paper
- Cormack, G. V., Smucker, M. D., & Clarke, C. L. A. (2011). Efficient and effective spam filtering and re-ranking for large web datasets. Information Retrieval. https://doi.org/10.1007/s10791-011-9162-z
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.