Sciweavers

466 search results - page 2 / 94
» Consensus-based distributed linear support vector machines
Sort
View
ICPR
2006
IEEE
14 years 6 months ago
Fast Support Vector Machine Classification using linear SVMs
We propose a classification method based on a decision tree whose nodes consist of linear Support Vector Machines (SVMs). Each node defines a decision hyperplane that classifies p...
Karina Zapien Arreola, Janis Fehr, Hans Burkhardt
ECML
2006
Springer
13 years 7 months ago
Efficient Large Scale Linear Programming Support Vector Machines
This paper presents a decomposition method for efficiently constructing 1-norm Support Vector Machines (SVMs). The decomposition algorithm introduced in this paper possesses many d...
Suvrit Sra
JMLR
2008
114views more  JMLR 2008»
13 years 5 months ago
Coordinate Descent Method for Large-scale L2-loss Linear Support Vector Machines
Linear support vector machines (SVM) are useful for classifying large-scale sparse data. Problems with sparse features are common in applications such as document classification a...
Kai-Wei Chang, Cho-Jui Hsieh, Chih-Jen Lin
KDD
2005
ACM
117views Data Mining» more  KDD 2005»
14 years 5 months ago
Rule extraction from linear support vector machines
We describe an algorithm for converting linear support vector machines and any other arbitrary hyperplane-based linear classifiers into a set of non-overlapping rules that, unlike...
Glenn Fung, Sathyakama Sandilya, R. Bharat Rao
ANNPR
2006
Springer
13 years 9 months ago
Fast Training of Linear Programming Support Vector Machines Using Decomposition Techniques
Abstract. Decomposition techniques are used to speed up training support vector machines but for linear programming support vector machines (LP-SVMs) direct implementation of decom...
Yusuke Torii, Shigeo Abe