2031 search results - page 184 / 407 » Binarized Support Vector Machines |
164
click to vote
COLT
2001
Springer
15 years 10 months ago
2001
Springer
We investigate the use of certain data-dependent estimates of the complexity of a function class, called Rademacher and Gaussian complexities. In a decision theoretic setting, we ...
152
click to vote
ECML
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. We investigate the application of classification techniques to the problem of information extraction (IE). In particular we use support vector machines and several differ...
182
click to vote
ECML
2006
Springer
15 years 9 months ago
2006
Springer
In this paper, we provide a study on the use of tree kernels to encode syntactic parsing information in natural language learning. In particular, we propose a new convolution kerne...
152
Voted
ECML
2006
Springer
15 years 9 months ago
2006
Springer
We perform a systematic evaluation of feature selection (FS) methods for support vector machines (SVMs) using simulated high-dimensional data (up to 5000 dimensions). Several findi...
169
Voted
ML
2002
ACM
15 years 5 months ago
2002
ACM
Matching Pursuit algorithms learn a function that is a weighted sum of basis functions, by sequentially appending functions to an initially empty basis, to approximate a target fu...