The DOI matches its Crossref record.
Large scale semi-supervised linear SVMs
Abstract
Large scale learning is often realistic only in a semi-supervised setting where a small set of labeled examples is available together with a large collection of unlabeled data. In many information retrieval and data mining applications, linear classifiers are strongly preferred because of their ease of implementation, interpretability and empirical performance. In this work, we present a family of semi-supervised linear support vector classifiers that are designed to handle partially-labeled sparse datasets with possibly very large number of examples and features. At their core, our algorithms employ recently developed modified finite Newton techniques. Our contributions in this paper are as follows: (a) We provide an implementation of Transductive SVM (TSVM) that is significantly more efficient and scalable than currently used dual techniques, for linear classification problems involving large, sparse datasets. (b) We propose a variant of TSVM that involves multiple switching of labels. Experimental results show that this variant provides an order of magnitude further improvement in training efficiency. (c) We present a new algorithm for semi-supervised learning based on a Deterministic Annealing (DA) approach. This algorithm alleviates the problem of local minimum in the TSVM optimization procedure while also being computationally attractive. We conduct an empirical study on several document classification tasks which confirms the value of our methods in large scale semi-supervised settings.
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
Cited by
He, H., & Garcia, E. A. (2009) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2008.239 · Cited by 10,359
“Other representative works for semisupervised learning include the selftraining methods [138], [139], semisupervised support vector machines [140], [141], graph-based methods [142], [143], and Expectation-Maximization (EM) algorithm with generative mixture models [144], [145].”
BackgroundSemi-supervised learning for peptide identification from shotgun proteomics datasets
Käll, L., Canterbury, J. D., Weston, J., Noble, W. S., & MacCoss, M. J. (2007) · Nature Methods · doi:10.1038/nmeth1113 · Cited by 2,424
A Survey of Text Classification Algorithms
Aggarwal, C. C., & Zhai, C. (2012) · Mining Text Data · doi:10.1007/978-1-4614-3223-4_6 · Cited by 842
A User’s Guide to Support Vector Machines
Ben-Hur, A., & Weston, J. (2010) · Methods in Molecular Biology · doi:10.1007/978-1-60327-241-4_13 · Cited by 822
Support Vector Machines and Kernels for Computational Biology
Ben-Hur, A., Ong, C. S., Sonnenburg, S., Schölkopf, B., & Rätsch, G. (2008) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1000173 · Cited by 702
Metadata
- Authors
- Sindhwani, V., & Keerthi, S. S.
- Venue
- Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval
- Publisher
- ACM
- Published
- 2006-08-06
- Pages
- 477-484
- OpenAlex
- W2128097790
- Cited by
- 230
- References
- 0
- FWCI
- 9.84
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Large scale semi-supervised linear SVMs. https://app.cochat.ai/papers/10.1145/1148170.1148253
- The paper
- Sindhwani, V., & Keerthi, S. S. (2006). Large scale semi-supervised linear SVMs. Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval. https://doi.org/10.1145/1148170.1148253
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.