Fast data selection for SVM training using ensemble margin
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
Training SVM on large datasets is inefficient or slow and a bottleneck because of high computational complexity (QP time O(n^3) and space O(n^2)) and model complexity.
“However, it is inefficient or impracticable to implement support vector machine in dealing with large scale training set due to its computational difficulties as well as the model complexity.”
From An efficient instance selection algorithm to reconstruct training set for support vector machine (2017) · cites this paper as [4]
Cites
The Strength of Weak Learnability
Schapire, R. E. (1990) · Machine Learning · doi:10.1007/bf00116037 · Cited by 4,600 · see citing works
Flagged first, then by citations
Cited by
Sorted by citations
An efficient instance selection algorithm to reconstruct training set for support vector machine
Liu, C., Wang, W., Wang, M., Lv, F., & Konan, M. (2017) · Knowledge-Based Systems · doi:10.1016/j.knosys.2016.10.031 · Cited by 146 · see citing works
- Authors
- Guo, L., & Boukir, S.
- Affiliations
- Centre National de la Recherche Scientifique (FR)
- Corresponding author
- Guo, Li
- ORCID
- Venue
- Pattern Recognition Letters
- Publisher
- Elsevier BV
- Published
- 2015-01
- Volume
- 51
- Pages
- 112-119
- ISSN
- 0167-8655 (ISSN-L)
- OpenAlex
- W2047300736
- Cited by
- 49
- References
- 1
- Citations by year
- 2026: 3 · 2025: 2 · 2024: 3 · 2023: 2 · 2022: 4 · 2021: 6 · 2020: 3 · 2019: 7 · 2018: 6 · 2017: 8 · 2016: 2 · 2015: 3
- FWCI
- 4.32
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- Pattern Recognition Letters (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and Data Classification
- Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and Algorithms
- Physical Sciences › Computer Science › Artificial Intelligence › Stochastic Gradient Optimization Techniques
- Keywords
- support vector machine training, data selection, instance selection, training complexity reduction, large-scale classification
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