The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Training linear SVMs in linear time
Abstract
Linear Support Vector Machines (SVMs) have become one of the most prominent machine learning techniques for high-dimensional sparse data commonly encountered in applications like text classification, word-sense disambiguation, and drug design. These applications involve a large number of examples n as well as a large number of features N, while each example has only s
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
LIBSVM: A library for support vector machines
Chang, C.-C., & Lin, C.-J. (2011) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/1961189.1961199 · Cited by 40,918
Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond
Schölkopf, B., & Smola, A. J. (2001) · The MIT Press eBooks · doi:10.7551/mitpress/4175.001.0001 · Cited by 11,703
Libsvm : A library for support vector machines
Ferrari, V. (2008) · Medical Entomology and Zoology · Cited by 10,122
Text categorization with Support Vector Machines: Learning with many relevant features
Joachims, T. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0026683 · Cited by 7,999
Self-citationAdvances in kernel methods: support vector learning
Schölkopf, B., Burges, C. J. C., & Smola, A. J. (1999) · doi:10.5555/299094 · Cited by 5,789
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
Making Large-Scale SVM Learning Practical
Joachims, T. (1998) · RePEc: Research Papers in Economics · doi:10.17877/de290r-14262 · Cited by 4,411
Self-citationOptimizing search engines using clickthrough data
Joachims, T. (2002) · Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/775047.775067 · Cited by 3,873
Self-citation(1999) · doi:10.1162/089976600300015565 · Cited by 2,799
RCV1: A New Benchmark Collection for Text Categorization Research
Lewis, D., Yang, Y., Rose, T. G., & Li, F. (2004) · Goldsmiths (University of London) · doi:10.5555/1005332.1005345 · Cited by 2,503
Large Margin Methods for Structured and Interdependent Output Variables
Tsochantaridis, I., Joachims, T., Hofmann, T., & Altün, Y. (2005) · Journal of Machine Learning Research · doi:10.5555/1046920.1088722 · Cited by 2,225
Self-citationThe Cutting-Plane Method for Solving Convex Programs
Kelley, Jr. (1960) · Journal of the Society for Industrial and Applied Mathematics · doi:10.1137/0108053 · Cited by 1,549
Inductive learning algorithms and representations for text categorization
Dumais, S., Platt, J., Heckerman, D., & Sahami, M. (1998) · Proceedings of the seventh international conference on Information and knowledge management · doi:10.1145/288627.288651 · Cited by 1,461
Large Margin Rank Boundaries for Ordinal Regression
Herbrich, R., Graepel, T., & Obermayer, K. (2000) · Advances in Large-Margin Classifiers · doi:10.7551/mitpress/1113.003.0010 · Cited by 1,074
Core Vector Machines: Fast SVM Training on Very Large Data Sets
Tsang, I. W.-H., Kwok, J. T.-Y., & Cheung, P.-M. (2005) · doi:10.5555/1046920.1058114 · Cited by 928
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
A support vector method for multivariate performance measures
Joachims, T. (2005) · Proceedings of the 22nd international conference on Machine learning - ICML '05 · doi:10.1145/1102351.1102399 · Cited by 786
Self-citation(2000) · CrossRef Listing of Deleted DOIs · doi:10.1162/15324430152733142 · Cited by 385
A Modified Finite Newton Method for Fast Solution of Large Scale Linear SVMs
Keerthi, S. S., & DeCoste, D. (2005) · doi:10.5555/1046920.1088684 · Cited by 265
Interior-Point Methods for Massive Support Vector Machines
Ferris, M. C., & Munson, T. S. (2002) · SIAM Journal on Optimization · doi:10.1137/s1052623400374379 · Cited by 186
(2000) · CrossRef Listing of Deleted DOIs · doi:10.1162/15324430152748218 · Cited by 182
Bradshaw, R. L., & McClain, W. C. (1971) · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · Cited by 107
Polynomial-Time Decomposition Algorithms for Support Vector Machines
Hush, D. R., & Scovel, C. (2003) · Machine Learning · doi:10.1023/a:1021877911972 · Cited by 78
Learning to Align Sequences: A Maximum-Margin Approach
Joachims, T., Galor, T., & Elber, R. (2006) · Springer eBooks · doi:10.1007/3-540-31618-3_4 · Cited by 44
Self-citation
Cited by
Chandola, V., Banerjee, A., & Kumar, V. (2009) · ACM Computing Surveys · doi:10.1145/1541880.1541882 · Cited by 11,687
“Generally, training decision trees tends to be faster while techniques that involve quadratic optimization, such as SVMs, are more expensive, though linear time SVMs [Joachims 2006] have been proposed that have linear training time.”
BackgroundLarge-Scale Machine Learning with Stochastic Gradient Descent
Bottou, L. (2010) · Proceedings of COMPSTAT'2010 · doi:10.1007/978-3-7908-2604-3_16 · Cited by 5,795
Improving the Fisher Kernel for Large-Scale Image Classification
Perronnin, F., Sánchez, J., & Mensink, T. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-15561-1_11 · Cited by 2,588
“This is in contrast with linear SVMs whose training cost is in O(N) [11,12] and which can therefore be efficiently learned with large quantities of images [13].”
Rajaraman, A., & Ullman, J. D. (2011) · Cambridge University Press eBooks · doi:10.1017/cbo9781139058452 · Cited by 2,262
Stochastic Gradient Descent Tricks
Bottou, L. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-35289-8_25 · Cited by 1,929
Metadata
- Authors
- Joachims, T.
- Venue
- Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
- Publisher
- ACM
- Published
- 2006-08-20
- Pages
- 217-226
- OpenAlex
- W2035720976
- Cited by
- 1,920
- References
- 24
- FWCI
- 49.94
- Type
- conference paper
- 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.