2031 search results - page 136 / 407 » Oblique Support Vector Machines |
146
click to vote
ICML
2009
IEEE
16 years 4 months ago
2009
IEEE
We propose a new penalty function which, when used as regularization for empirical risk minimization procedures, leads to sparse estimators. The support of the sparse vector is ty...
118
click to vote
ADMA
2005
Springer
15 years 5 months ago
2005
Springer
We develop the notion of normalized information distance (NID) [7] into a kernel distance suitable for use with a Support Vector Machine classifier, and demonstrate its use for an...
121
click to vote
NAACL
2010
15 years 1 months ago
2010
We present a new method that compresses sentences by removing words. In a first stage, it generates candidate compressions by removing branches from the source sentence's dep...
111
click to vote
ICASSP
2010
IEEE
15 years 2 months ago
2010
IEEE
In this paper, we introduce a novel bayesian compressive sensing (CS) technique for phonetic classification. CS is often used to characterize a signal from a few support training...
122
click to vote
PKDD
2009
Springer
15 years 10 months ago
2009
Springer
The Support Vector Machine error bound is a function of the margin and radius. Standard SVM algorithms maximize the margin within a given feature space, therefore the radius is fi...