Combining winnow and orthogonal sparse bigrams for incremental spam filtering

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3202, Issue , 2004, Pages 410-421

  Siefkes, Christian ^a   Assis, Fidelis ^b   Chhabra, Shalendra ^c   Yerazunis, William S ^d  

^a FREIE UNIVERSITÄT BERLIN   (Germany)

^b Empresa Brasileira de Telecomunicações Embratel   (Brazil)

^c University of California Riverside   (United States)

^d MITSUBISHI ELECTRIC RESEARCH LABORATORIES   (United States)

Author keywords

Bigrams; Classification; Email; Feature Generation; Feature Representation; Incremental Learning; Online Learning; Orthogonal Sparse Bigrams; Spam Filtering; Text Classification; Winnow

Indexed keywords

CLASSIFICATION (OF INFORMATION); ELECTRONIC MAIL; INTERNET;

BIGRAMS; FEATURE GENERATION; FEATURE REPRESENTATION; INCREMENTAL LEARNING; ONLINE LEARNING; ORTHOGONAL SPARSE BIGRAMS; SPAM FILTERING; TEXT CLASSIFICATION; WINNOW;

TEXT PROCESSING;

EID: 35048865513     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30116-5_38     Document Type: Article

References (16)

1. A. J. Carlson, C. M. Cumby, N. D. Rizzolo, J. L. Rosen, and D. Roth. SNoW user manual. Version: January, 2004. Technical report, UIUC, 2004.
2. W. W. Cohen and Y. Singer. Context-sensitive learning methods for text categorization. ACM Transactions on Information Systems, 17(2):141-173, 1999.
3. CRM114: The controllable regex mutilator. http://crm114.sourceforge.net/.
4. I. Dagan, Y. Karov, and D. Roth. Mistake-driven learning in text categorization. In EMNLP-97, 1997.
5. J. M. Gómez Hidalgo, E. Puertas Sanz, and M. J. Maña López. Evaluating cost-sensitive unsolicited bulk email categorization. In JADT-02, Madrid, ES, 2002.
6. P. Graham. Better Bayesian filtering. In MIT Spam Conference, 2003.
7. N. Littlestone. Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning, 2:285-318, 1988.
8. M. Munoz, V. Punyakanok, D. Roth, and D. Zimak. A learning approach to shallow parsing. Technical Report UIUCDCS-R-99-2087, Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, Illinois, 1999.
9. normalizemime v2004-02-04. http://hyvatti.iki.fi/jaakko/spam/.
10. C. Siefkes. A toolkit for caching and prefetching in the context of Web application platforms. Diplomarbeit, TU Berlin, 2002.
11. SpamAssassin. http://www.spamassassin.org/.
12. SpamBayes. http://spambayes.sourceforge.net/.
13. Trainable Incremental Extraction System. http://www.inf.fu-berlin.de/inst/agdb/software/ties/.
14. W. S. Yerazunis. Sparse binary polynomial hashing and the CRM114 discriminator. In 2003 Spam Conference, Cambridge, MA, 2003. MIT.
15. W. S. Yerazunis. The spam-filtering accuracy plateau at 99.9% accuracy and how to get past it. In 2004 Spam Conference, Cambridge, MA, 2004. MIT.
16. L. Zhang and T. Yao. Filtering junk mail with a maximum entropy model. In 20th International Conference on Computer Processing of Oriental Languages, 2003.