Sciweavers

476 search results - page 29 / 96
» Support Vector Machines with Example Dependent Costs
Sort
View
ICASSP
2008
IEEE
14 years 3 months ago
Learning the kernel via convex optimization
The performance of a kernel-based learning algorithm depends very much on the choice of the kernel. Recently, much attention has been paid to the problem of learning the kernel it...
Seung-Jean Kim, Argyrios Zymnis, Alessandro Magnan...
TREC
2007
13 years 10 months ago
Relaxed Online SVMs in the TREC Spam Filtering Track
Relaxed Online Support Vector Machines (ROSVMs) have recently been proposed as an efficient methodology for attaining an approximate SVM solution for streaming data such as the on...
David Sculley, Gabriel Wachman
KDD
2002
ACM
187views Data Mining» more  KDD 2002»
14 years 9 months ago
Transforming classifier scores into accurate multiclass probability estimates
Class membership probability estimates are important for many applications of data mining in which classification outputs are combined with other sources of information for decisi...
Bianca Zadrozny, Charles Elkan
ICML
2007
IEEE
14 years 10 months ago
Sparse probabilistic classifiers
The scores returned by support vector machines are often used as a confidence measures in the classification of new examples. However, there is no theoretical argument sustaining ...
Romain Hérault, Yves Grandvalet
APPROX
2007
Springer
112views Algorithms» more  APPROX 2007»
14 years 3 months ago
Encouraging Cooperation in Sharing Supermodular Costs
Abstract Consider a situation where a group of agents wishes to share the costs of their joint actions, and needs to determine how to distribute the costs amongst themselves in a f...
Andreas S. Schulz, Nelson A. Uhan