3256 search results - page 253 / 652 » Learning Linear Transformations |
189
click to vote
ICML
2006
IEEE
16 years 7 months ago
2006
IEEE
String kernels which compare the set of all common substrings between two given strings have recently been proposed by Vishwanathan & Smola (2004). Surprisingly, these kernels...
148
click to vote
ALT
2008
Springer
16 years 3 months ago
2008
Springer
In this paper we discuss boosting algorithms that maximize the soft margin of the produced linear combination of base hypotheses. LPBoost is the most straightforward boosting algor...
198
click to vote
ECML
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. Tree induction methods and linear models are popular techniques for supervised learning tasks, both for the prediction of nominal classes and continuous numeric values. F...
169
click to vote
COLT
2001
Springer
15 years 11 months ago
2001
Springer
We consider geometric conditions on a labeled data set which guarantee that boosting algorithms work well when linear classifiers are used as weak learners. We start by providing ...
173
click to vote
CC
2006
Springer
15 years 10 months ago
2006
Springer
We introduce a new class of compiler heuristics: hybrid optimizations. Hybrid optimizations choose dynamically at compile time which optimization algorithm to apply from a set of d...