Training linear SVMs in linear time
Explore this paper's citation graph
Summary
A Cutting Plane Algorithm for training linear SVMs that provably has training time 0(s,n) for classification problems and o(sn log (n)) for ordinal regression problems and several orders of magnitude faster than decomposition methods like svm light for large datasets.
- Type
- article
- Published
- 2006-08-20
- Cited by
- 2,195
- References
- 26
- OpenAlex
- https://openalex.org/W2035720976
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:5155714
Keywords
Support vector machine, Computer science, Artificial intelligence, Machine learning, Word (group theory)
References
- Polynomial-Time Decomposition Algorithms for Support Vector Machines
- Text Categorization with Support Vector Machines: Learning with Many Relevant Features
- Making large scale SVM learning practical
- KDD-Cup 2004: results and analysis
- Optimizing search engines using clickthrough data
- Interior-Point Methods for Massive Support Vector Machines
- Proximal support vector machine classifiers
- The Cutting-Plane Method for Solving Convex Programs
- A support vector method for multivariate performance measures
- Large Margin Methods for Structured and Interdependent Output Variables
- A Modified Finite Newton Method for Fast Solution of Large Scale Linear SVMs
- RCV1: A New Benchmark Collection for Text Categorization Research
- Core Vector Machines: Fast SVM Training on Very Large Data Sets
- New Support Vector Algorithms
- RESULTS AND ANALYSIS.
- Inductive learning algorithms and representations for text categorization
- Libsvm : A library for support vector machines
- SVMTorch: Support Vector Machines for Large-Scale Regression Problems
- Lagrangian Support Vector Machines
- Fast Training of Support Vector Machines using Sequential Minimal Optimization
Cited by
- SMO-Style Algorithms for Learning Using Privileged Information
- A Structural SVM Based Approach for Optimizing Partial AUC
- A user's guide to support vector machines.
- Towards structured representation of academic search results
- Fast Bundle Algorithm for Multiple-Instance Learning
- Novel Cascade FPGA Accelerator for Support Vector Machines Classification
- FSMRank: Feature Selection Algorithm for Learning to Rank
- Adaptive dual control of topic-based information retrieval
- Modeling Spread of Disease from Social Interactions
- UTD: Determining Relational Similarity Using Lexical Patterns
- CLASSIFICATION IN HIGH DIMENSIONAL FEATURE SPACES
- From Flat to Hierarchical: Modeling Structures in Visual Recognition
- EXPERIMENTAL STUDY AND GEOMETRICAL ANALYSIS OF A LINEAR PROGRAMMING SUPPORT VECTOR MACHINE
- Efficient max-margin metric learning
- Visual Indexing and Retrieval
- The Pairwise Piecewise-Linear Embedding for Efficient Non-Linear Classification
- Multiple Kernel Clustering
- Comparison of Large-scale SVM Training Algorithms for Language Recognition
- Simple Yet Effective Methods for Cross-Lingual Link Discovery (CLLD) - KMI @ NTCIR-10 CrossLink-2
- On the Selection of Negative Examples for Hierarchical Text Categorization
Related papers
- Classification using support vector machines with graded resolution
- Domain Adaptation using Word Embeddings for Word Sense Disambiguation
- Prediction of neural tube defect using support vector machine.
- sense2vec - A Fast and Accurate Method for Word Sense Disambiguation In Neural Word Embeddings
- Re-examination of training of semantic class disambiguation classifier for all words
- Chinese word sense disambiguation by combining pseudo training data
- OE: WSD Using Optimal Ensembling (OE) Method