DMCA
Support vector machines for spam categorization (1999)
Cached
Download Links
| Venue: | IEEE TRANSACTIONS ON NEURAL NETWORKS |
| Citations: | 341 - 2 self |
BibTeX
@ARTICLE{Drucker99supportvector,
author = {Harris Drucker and Donghui Wu and Vladimir N. Vapnik},
title = {Support vector machines for spam categorization},
journal = {IEEE TRANSACTIONS ON NEURAL NETWORKS},
year = {1999},
volume = {10},
number = {5},
pages = {1048--1054}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We study the use of support vector machines (SVM’s) in classifying e-mail as spam or nonspam by comparing it to three other classification algorithms: Ripper, Rocchio, and boosting decision trees. These four algorithms were tested on two different data sets: one data set where the number of features were constrained to the 1000 best features and another data set where the dimensionality was over 7000. SVM’s performed best when using binary features. For both data sets, boosting trees and SVM’s had acceptable test performance in terms of accuracy and speed. However, SVM’s had significantly less training time.
