The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Efficient tuning of SVM hyperparameters using radius/margin bound and iterative algorithms
Abstract
The paper discusses implementation issues related to the tuning of the hyperparameters of a support vector machine (SVM) with L/sub 2/ soft margin, for which the radius/margin bound is taken as the index to be minimized, and iterative techniques are employed for computing radius and margin. The implementation is shown to be feasible and efficient, even for large problems having more than 10000 support vectors.
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
Cortes, C., & Vapnik, V. (1995) · Machine Learning · doi:10.1007/bf00994018 · Cited by 59,421
Wu, Y. (1999) · Technometrics · doi:10.1080/00401706.1999.10485951 · Cited by 27,221
A Tutorial on Support Vector Machines for Pattern Recognition
Burges, C. J. C. (1998) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009715923555 · Cited by 16,429
Estimating the Support of a High-Dimensional Distribution
Schölkopf, B., Platt, J. C., Shawe-Taylor, J., Smola, A. J., & Williamson, R. C. (2001) · Neural Computation · doi:10.1162/089976601750264965 · Cited by 6,168
Fast Training of Support Vector Machines Using Sequential Minimal Optimization
Platt, J. C. (1998) · Advances in Kernel Methods · doi:10.7551/mitpress/1130.003.0016 · Cited by 5,437
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
Improvements to Platt's SMO Algorithm for SVM Classifier Design
Keerthi, S. S., Shevade, S. K., Bhattacharyya, C., & Murthy, K. R. K. (2001) · Neural Computation · doi:10.1162/089976601300014493 · Cited by 1,318
Self-citationBounds on Error Expectation for Support Vector Machines
Vapnik, V., & Chapelle, O. (2000) · Neural Computation · doi:10.1162/089976600300015042 · Cited by 624
Extracting Support Data for a Given Task
Schölkopf, B., Burges, C. J. C., & Vapnik, V. N. (1995) · Cited by 539
A fast iterative nearest point algorithm for support vector machine classifier design
Keerthi, S. S., Shevade, S. K., Bhattacharyya, C., & Murthy, K. R. K. (2000) · IEEE Transactions on Neural Networks · doi:10.1109/72.822516 · Cited by 383
Self-citationRemark on “Algorithm 500: Minimization of Unconstrained Multivariate Functions [E4]”
Shanno, D. F., & Phua, K. H. (1980) · ACM Transactions on Mathematical Software · doi:10.1145/355921.355933 · Cited by 245
Cited by
Evolving support vector machines using fruit fly optimization for medical data classification
Shen, L., Chen, H., Yu, Z., Kang, W., Zhang, B., Li, H., Yang, B., & Liu, D. (2016) · Knowledge-Based Systems · doi:10.1016/j.knosys.2016.01.002 · Cited by 538
Evolutionary tuning of multiple SVM parameters
Friedrichs, F., & Igel, C. (2005) · Neurocomputing · doi:10.1016/j.neucom.2004.11.022 · Cited by 499
Support vector regression with genetic algorithms in forecasting tourism demand
Chen, K.-Y., & Wang, C.-H. (2007) · Tourism Management · doi:10.1016/j.tourman.2005.12.018 · Cited by 378
Fast exact leave-one-out cross-validation of sparse least-squares support vector machines
Cawley, G. C., & Talbot, N. L. C. (2004) · Neural Networks · doi:10.1016/j.neunet.2004.07.002 · Cited by 332
Machine learning for predicting greenhouse gas emissions from agricultural soils
Hamrani, A., Akbarzadeh, A., & Madramootoo, C. A. (2020) · Science of The Total Environment · doi:10.1016/j.scitotenv.2020.140338 · Cited by 293
Metadata
- Authors
- Keerthi, S. S.
- Venue
- IEEE Transactions on Neural Networks
- Published
- 2002-09
- Volume
- 13
- Issue
- 5
- Pages
- 1225-1229
- ISSN
- 1045-9227 (ISSN-L)
- OpenAlex
- W2143628522
- Cited by
- 317
- References
- 11
- FWCI
- 11.71
- 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.