2000 · 54 citations · 9 references
ComputingComputer ScienceData MiningMachine LearningNatural Language ProcessingData PreprocessingExpert SystemsScalable Data MiningScalable Machine LearningSupport Vector MachinesKnowledge Discovery ProcessesLarge-scale Support Vector MachinesScalable ClassificationSupport Vector Machine Classification
Support vector machines (SVMs) provide classi cation models with strong theoretical foundations as well as excellent empirical performance on a variety of applications. One of the major drawbacks of SVMs is the necessity to solve a large-scale quadratic programming problem. This paper combines likelihood-based squashing with a probabilistic formulation of SVMs, enabling fast training on squashed data sets. We reduce the problem of training the SVMs on the weighted \squashed" data to a quadratic programming problem and show that it can be solved using Platt's sequential minimal optimization (SMO) algorithm. W e compare performance of the SMO algorithm on the squashed and the full data, as well as on simple random and boosted samples of the data. Experiments on a number of datasets show that squashing allows one to speed-up training, decrease memory requirements, and obtain parameter estimates close to that of the full data. More importantly, squashing produces close to optimal classi cation accuracies.
9
Corinna Cortes, Vladimir Vapnik · Machine Learning · 1995 · 33K citations · Full text
Training support vector machines: an application to face detection
E. Osuna, Robert M. Freund · 2002 · 2.5K citations
1998 · 2.2K citations
A brief introduction to boosting
Robert E. Schapire · 1999 · 1.2K citations