1334 search results - page 152 / 267 » Composite kernel learning |
129
click to vote
ESANN
2007
15 years 5 months ago
2007
Imprecision, incompleteness, prior knowledge or improved learning speed can motivate interval–represented data. Most approaches for SVM learning of interval data use local kernel...
133
Voted
NIPS
2000
15 years 5 months ago
2000
We present an improvement of Noviko 's perceptron convergence theorem. Reinterpreting this mistakebound as a margindependent sparsity guarantee allows us to give a PAC{style ...
111
click to vote
ICML
2003
IEEE
16 years 4 months ago
2003
IEEE
When the training instances of the target class are heavily outnumbered by non-target training instances, SVMs can be ineffective in determining the class boundary. To remedy this...
114
Voted
NIPS
2007
15 years 5 months ago
2007
Incorporating invariances into a learning algorithm is a common problem in machine learning. We provide a convex formulation which can deal with arbitrary loss functions and arbit...
132
Voted
COLING
2010
14 years 10 months ago
2010
Lexicalized Well-Founded Grammar (LWFG) is a recently developed syntacticsemantic grammar formalism for deep language understanding, which balances expressiveness with provable le...