The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Support vector machines for spam categorization
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.
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
The Nature of Statistical Learning Theory
Vapnik, V. N. (1995) · doi:10.1007/978-1-4757-2440-0 · Cited by 39,138
Self-citation(1992) · Cited by 23,431
Text categorization with Support Vector Machines: Learning with many relevant features
Joachims, T. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0026683 · Cited by 7,999
A Comparative Study on Feature Selection in Text Categorization
Yang, Y., & Pedersen, J. (1997) · Cited by 4,790
Support Vector Regression Machines
Drucker, H., Burges, C. J. C., Kaufman, L., Smola, A. J., & Vapnik, V. N. (1996) · Cited by 4,658
Self-citationCohen, W. W. (1995) · Machine Learning Proceedings 1995 · doi:10.1016/b978-1-55860-377-6.50023-2 · Cited by 3,787
(1998) · Cited by 2,679
A Probabilistic Analysis of the Rocchio Algorithm with TFIDF for Text Categorization
Joachims, T. (1997) · Cited by 1,262
A Bayesian Approach to Filtering Junk E-Mail
Sahami, M., Dumais, S., Heckerman, D. E., & Horvitz, E. (1998) · Cited by 1,206
An improved training algorithm for support vector machines
Osuna, E., Freund, R., & Girosi, F. (2002) · Neural Networks for Signal Processing VII. Proceedings of the 1997 IEEE Signal Processing Society Workshop · doi:10.1109/nnsp.1997.622408 · Cited by 1,061
Training algorithms for linear text classifiers
Lewis, D. D., Schapire, R. E., Callan, J. P., & Papka, R. (1996) · Proceedings of the 19th annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '96 · doi:10.1145/243199.243277 · Cited by 520
Learning Rules that Classify E-Mail
Cohen, W. W. (1996) · Cited by 406
Game theory, on-line prediction and boosting
Freund, Y., & Schapire, R. E. (1996) · Proceedings of the ninth annual conference on Computational learning theory - COLT '96 · doi:10.1145/238061.238163 · Cited by 383
Context-sensitive learning methods for text categorization
Cohen, W. W., & Singer, Y. (1999) · ACM Transactions on Information Systems · doi:10.1145/306686.306688 · Cited by 360
Boosting and Rocchio applied to text filtering
Schapire, R. E., Singer, Y., & Singhal, A. (1998) · Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/290941.290996 · Cited by 301
Cranor, L. F., & LaMacchia, B. A. (1998) · Communications of the ACM · doi:10.1145/280324.280336 · Cited by 204
(1996)
Cited by
Machine learning in automated text categorization
Sebastiani, F. (2002) · ACM Computing Surveys · doi:10.1145/505282.505283 · Cited by 7,926
(2006) · The MIT Press eBooks · doi:10.7551/mitpress/9780262033589.001.0001 · Cited by 4,280
An introduction to kernel-based learning algorithms
Muller, K.-R., Mika, S., Ratsch, G., Tsuda, K., & Scholkopf, B. (2001) · IEEE Transactions on Neural Networks · doi:10.1109/72.914517 · Cited by 3,473
Natural language processing: state of the art, current trends and challenges
Khurana, D., Koli, A., Khatter, K., & Singh, S. (2023) · Multimedia Tools and Applications · doi:10.1007/s11042-022-13428-4 · Cited by 1,823
Financial time series forecasting using support vector machines
Kim, K.-J. (2003) · Neurocomputing · doi:10.1016/s0925-2312(03)00372-2 · Cited by 1,734
Metadata
- Authors
- Drucker, H., Wu, D., & Vapnik, V. N.
- Venue
- IEEE Transactions on Neural Networks
- Published
- 1999
- Volume
- 10
- Issue
- 5
- Pages
- 1048-1054
- ISSN
- 1045-9227 (ISSN-L)
- OpenAlex
- W2169384781
- Cited by
- 1,471
- References
- 17
- FWCI
- 32.32
- 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
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.