The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Massive data discrimination via linear support vector machines
Abstract
A linear support vector machine formulation is used to generate a fast, finitely-terminating linear-programming algorithm for discriminating between two massive sets in n-dimen-sional space, where the number of points can be orders of magnitude larger than n. The algorithm creates a succession of sufficiently small linear programs that separate chunks of the data at a time. The key idea is that a small number of support vectors, corresponding to linear programming constraints with positive dual variables, are carried over between the successive small linear programs, each of which containing a chunk of the data. We prove that this procedure is monotonic and terminates in a finite number of steps at an exact solution that leads to an optimal separating plane for the entire dataset. Numerical results on fully dense publicly available datasets, numbering 20,000 to 1 million points in 32-dimensional space, confirm the theoretical results and demonstrate the ability to handle very large problems
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
Cortes, C., & Vapnik, V. (1995) · Machine Learning · doi:10.1007/bf00994018 · Cited by 59,421
Cited by
Twin Support Vector Machines for Pattern Classification
Jayadeva, Khemchandani, R., & Chandra, S. (2007) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.1068 · Cited by 1,803
Proximal support vector machine classifiers
Fung, G., & Mangasarian, O. L. (2001) · Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/502512.502527 · Cited by 842
Self-citationSupport vector machine applications in the field of hydrology: A review
Raghavendra. N, S., & Deka, P. C. (2014) · Applied Soft Computing · doi:10.1016/j.asoc.2014.02.002 · Cited by 780
RSVM: Reduced Support Vector Machines
Lee, Y.-J., & Mangasarian, O. L. (2001) · Proceedings of the 2001 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972719.13 · Cited by 647
Self-citationSSVM: A Smooth Support Vector Machine for Classification
Lee, Y.-J., & Mangasarian, O. L. (2001) · Computational Optimization and Applications · doi:10.1023/a:1011215321374 · Cited by 518
Self-citation
Metadata
- Authors
- Bradley, P. S., & Mangasarian, O. L.
- Venue
- Optimization Methods and Software
- Publisher
- Informa UK Limited
- Published
- 2000-01
- Volume
- 13
- Issue
- 1
- Pages
- 1-10
- ISSN
- 1026-7670 (ISSN-L)
- 1055-6788
- 1029-4937
- OpenAlex
- W2091143818
- Cited by
- 178
- References
- 1
- FWCI
- 9.16
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Massive data discrimination via linear support vector machines. https://app.cochat.ai/papers/10.1080/10556780008805771
- The paper
- Bradley, P. S., & Mangasarian, O. L. (2000). Massive data discrimination via linear support vector machines. Optimization Methods and Software. https://doi.org/10.1080/10556780008805771
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.