The DOI matches its OpenAlex record.
Estimating the generalization performance of a SVM efficiently
Open accessOverview
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
Cited by
A survey on concept drift adaptation
Gama, J., Žliobaitė, I., Bifet, A., Pechenizkiy, M., & Bouchachia, A. (2014) · ACM Computing Surveys · doi:10.1145/2523813 · Cited by 3,735
Choosing Multiple Parameters for Support Vector Machines
Chapelle, O., Vapnik, V., Bousquet, O., & Mukherjee, S. (2002) · Machine Learning · doi:10.1023/a:1012450327387 · Cited by 2,206
Asymptotic Behaviors of Support Vector Machines with Gaussian Kernel
Keerthi, S. S., & Lin, C.-J. (2003) · Neural Computation · doi:10.1162/089976603321891855 · Cited by 1,622
The text mining handbook: advanced approaches in analyzing unstructured data
(2007) · Choice Reviews Online · doi:10.5860/choice.44-5684 · Cited by 1,598
Intrusion detection using neural networks and support vector machines
Mukkamala, S., Janoski, G., & Sung, A. (2003) · Proceedings of the 2002 International Joint Conference on Neural Networks. IJCNN'02 (Cat. No.02CH37290) · doi:10.1109/ijcnn.2002.1007774 · Cited by 814
Learning and evaluating classifiers under sample selection bias
Zadrozny, B. (2004) · Twenty-first international conference on Machine learning - ICML '04 · doi:10.1145/1015330.1015425 · Cited by 800
“In its basic form, the support vector machine (SVM) algorithm (Joachims, 2000a) learns the parameters a and b describing a linear decision rule whose sign determines the label of an example, so that the smallest distance between each training example and the decision boundary, i.e. the margin, is…”
BackgroundMethodLee, Y., Lin, Y., & Wahba, G. (2004) · Journal of the American Statistical Association · doi:10.1198/016214504000000098 · Cited by 741
Support vector machines: hype or hallelujah?
Bennett, K. P., & Campbell, C. (2000) · ACM SIGKDD Explorations Newsletter · doi:10.1145/380995.380999 · Cited by 687
Cost-sensitive learning by cost-proportionate example weighting
Zadrozny, B., Langford, J., & Abe, N. (2004) · Third IEEE International Conference on Data Mining · doi:10.1109/icdm.2003.1250950 · Cited by 680
“The SVM algorithm [11] learns the parameters a and b describing a linear decision rule h x sign a x b , so that the smallest distance between each training example and the decision boundary (the margin) is maximized.”
MethodWavelet Support Vector Machine
Zhang, L., Zhou, W., & Jiao, L. (2004) · IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2003.811113 · Cited by 510
A hybrid machine learning approach to network anomaly detection
Shon, T., & Moon, J. (2007) · Information Sciences · doi:10.1016/j.ins.2007.03.025 · Cited by 440
Learning drifting concepts: Example selection vs. example weighting
Klinkenberg, R. (2004) · Intelligent Data Analysis · doi:10.3233/ida-2004-8305 · Cited by 438
Accurate On-line Support Vector Regression
Ma, J., Theiler, J., & Perkins, S. (2003) · Neural Computation · doi:10.1162/089976603322385117 · Cited by 408
Sung, A. H., & Mukkamala, S. (2003) · 2003 Symposium on Applications and the Internet, 2003. Proceedings. · doi:10.1109/saint.2003.1183050 · Cited by 384
Learning from streaming data with concept drift and imbalance: an overview
Hoens, T. R., Polikar, R., & Chawla, N. V. (2012) · Progress in Artificial Intelligence · doi:10.1007/s13748-011-0008-0 · Cited by 301
Mimicking Cellular Sorting Improves Prediction of Subcellular Localization
Nair, R., & Rost, B. (2005) · Journal of Molecular Biology · doi:10.1016/j.jmb.2005.02.025 · Cited by 290
Kernel methods: a survey of current techniques
Campbell, C. (2002) · Neurocomputing · doi:10.1016/s0925-2312(01)00643-9 · Cited by 268
Inglada, J. (2007) · ISPRS Journal of Photogrammetry and Remote Sensing · doi:10.1016/j.isprsjprs.2007.05.011 · Cited by 261
Nonparallel Support Vector Machines for Pattern Classification
Tian, Y., Qi, Z., Ju, X., Shi, Y., & Liu, X. (2014) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2013.2279167 · Cited by 261
Metadata
- Authors
- Joachims, T.
- Venue
- Technische Universität Dortmund Eldorado (Technische Universität Dortmund)
- Publisher
- Erich-Brost-Institut
- Published
- 1999-01-01
- Pages
- 431-438
- OpenAlex
- W1539150806
- Cited by
- 327
- References
- 0
- Type
- report
- Language
- en
- Open access
- green
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.