The DOI matches its Crossref record.
10.1162/15324430152748218
Abstract
An implicit Lagrangian for the dual of a simple reformulation of the standard quadratic program of a linear support vector machine proposed. This leads to the minimization of an unconstrained differentiable convex function in a space of dimensionality equal to the number of classified points. This problem solvable by an extremely simple linearly convergent Lagrangian support vector machine (LSVM) algorithm. LSVM requires the inversion at the outset of a single matrix of the order of the much smaller dimensionality of the original input space plus one. The full algorithm given in this paper in 11 lines of MATLAB code without any special optimization tools such linear or quadratic programming solvers. This LSVM code can be used as is to solve classification problems with millions of points. For example, 2 million points in 10 dimensional input space were classified by a linear surface in 82 minutes on a Pentium III 500 MHz notebook with 384 megabytes of memory (and additional swap space), and in 7 minutes on a 250 MHz UltraSPARC II processor with 2 gigabytes of memory. Other standard classification test problems were also solved. Nonlinear kernel classification can also be solved by LSVM. Although it does not scale up to very large problems, it can handle any positive semidefinite kernel and guaranteed to converge. A short MATLAB code also given for nonlinear kernels and tested on a number of 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
Cited by
Training linear SVMs in linear time
Joachims, T. (2006) · Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1150402.1150429 · Cited by 1,920
Lessmann, S., Baesens, B., Mues, C., & Pietsch, S. (2008) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2008.35 · Cited by 1,226
Support Vector Machine-Based Expert System for Reliable Heartbeat Recognition
Osowski, S., Hoai, L. T., & Markiewicz, T. (2004) · IEEE Transactions on Biomedical Engineering · doi:10.1109/tbme.2004.824138 · Cited by 536
Reduced Support Vector Machines: A Statistical Theory
Lee, Y.-J., & Huang, S.-Y. (2007) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2006.883722 · Cited by 268
Decomposition Methods for Linear Support Vector Machines
Kao, W.-C., Chung, K.-M., Sun, C.-L., & Lin, C.-J. (2004) · Neural Computation · doi:10.1162/089976604774201640 · Cited by 54
Metadata
- Venue
- CrossRef Listing of Deleted DOIs
- Publisher
- Unmaintained records
- Published
- 2000
- Volume
- 1
- ISSN
- 0003-6951 (ISSN-L)
- OpenAlex
- W2152523366
- Cited by
- 182
- References
- 0
- FWCI
- 10.41
- 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: 10.1162/15324430152748218. https://app.cochat.ai/papers/10.1162/15324430152748218
- The paper
- 10.1162/15324430152748218. (2000). CrossRef Listing of Deleted DOIs. https://doi.org/10.1162/15324430152748218
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.