9 search results - page 1 / 2 » A dual coordinate descent method for large-scale linear SVM |
ICML
2008
IEEE
14 years 11 months ago
2008
IEEE
In many applications, data appear with a huge number of instances as well as features. Linear Support Vector Machines (SVM) is one of the most popular tools to deal with such larg...
JMLR
2008
13 years 10 months ago
2008
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...
ICASSP
2010
IEEE
13 years 11 months ago
2010
IEEE
Polytope Faces Pursuit is a greedy algorithm that performs Basis Pursuit with similar order complexity to Orthogonal Matching Pursuit. The algorithm adds one basis vector at a tim...
SIGIR
2006
ACM
14 years 4 months ago
2006
ACM
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...
JMLR
2010
13 years 9 months ago
2010
Maximum entropy (Maxent) is useful in natural language processing and many other areas. Iterative scaling (IS) methods are one of the most popular approaches to solve Maxent. With...