The DOI matches its OpenAlex record; 1 of the 1 references it cites were found in a registry or an index.
Spam Filtering Using Statistical Data Compression Models
Abstract
Spam filtering poses a special problem in text categorization, of which the defining characteristic is that filters face an active adversary, which constantly attempts to evade filtering. Since spam evolves continuously and most practical applications are based on online user feedback, the task calls for fast, incremental and robust learning algorithms. In this paper, we investigate a novel approach to spam filtering based on adaptive statistical data compression models. The nature of these models allows them to be employed as probabilistic text classifiers based on character-level or binary sequences. By modeling messages as sequences, tokenization and other error-prone preprocessing steps are omitted altogether, resulting in a method that is very robust. The models are also fast to construct and incrementally updateable. We evaluate the filtering performance of two different compression algorithms; dynamic Markov compression and prediction by partial matching. The results of our empirical evaluation indicate that compression models outperform currently established spam filters, as well as a number of methods proposed in previous studies.
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
Data Compression Using Dynamic Markov Modelling
Cormack, G. V., & Horspool, R. N. S. (1987) · The Computer Journal · doi:10.1093/comjnl/30.6.541 · Cited by 213
Self-citation
Cited by
Uncovering social spammers: social honeypots + machine learning
Lee, K., Caverlee, J., & Webb, S. (2010) · Proceedings of the 33rd international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1835449.1835522 · Cited by 619
A review of machine learning approaches to Spam filtering
Guzella, T. S., & Caminhas, W. M. (2009) · Expert Systems with Applications · doi:10.1016/j.eswa.2009.02.037 · Cited by 542
Seven Months with the Devils: A Long-Term Study of Content Polluters on Twitter
Lee, K., Eoff, B., & Caverlee, J. (2021) · Proceedings of the International AAAI Conference on Web and Social Media · doi:10.1609/icwsm.v5i1.14106 · Cited by 452
A survey of learning-based techniques of email spam filtering
Blanzieri, E., & Bryl, A. (2008) · Artificial Intelligence Review · doi:10.1007/s10462-009-9109-6 · Cited by 407
Applications of Artificial Intelligence in Machine Learning: Review and Prospect
Das, S., Dey, A., Pal, A., & Roy, N. (2015) · International Journal of Computer Applications · doi:10.5120/20182-2402 · Cited by 360
Metadata
- Authors
- Bratko, A., Filipič, B., Cormack, G. V., Lynam, T. R., & Zupan, B.
- Published
- 2006-12-01
- Volume
- 7
- Issue
- 97
- Pages
- 2673-2698
- DOI
- 10.5555/1248547.1248644
- OpenAlex
- W2104290684
- Cited by
- 245
- References
- 1
- FWCI
- 54.85
- Type
- journal article
- 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: Spam Filtering Using Statistical Data Compression Models. https://app.cochat.ai/papers/10.5555/1248547.1248644
- The paper
- Bratko, A., Filipič, B., Cormack, G. V., Lynam, T. R., & Zupan, B. (2006). Spam Filtering Using Statistical Data Compression Models. https://doi.org/10.5555/1248547.1248644
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.